Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 33K Apr 11 20:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 233K Apr 11 20:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 11 20:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 11 20:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 22K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 64K Apr 11 20:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 436K Apr 11 20:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 149K Apr 11 20:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 568K Apr 11 20:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717276878189

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00020M0002C001P001G001
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:21:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:21:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:21:20] [INFO ] Load time of PNML (sax parser for PT used): 326 ms
[2024-06-01 21:21:20] [INFO ] Transformed 3271 places.
[2024-06-01 21:21:20] [INFO ] Transformed 2753 transitions.
[2024-06-01 21:21:20] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 536 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 165 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 11 places and 0 transitions.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 601 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Reduce places removed 76 places and 0 transitions.
Discarding 315 places :
Implicit places reduction removed 315 places
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 2869 transition count 2753
Discarding 252 places :
Symmetric choice reduction at 1 with 252 rule applications. Total rules 643 place count 2617 transition count 2480
Iterating global reduction 1 with 252 rules applied. Total rules applied 895 place count 2617 transition count 2480
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 938 place count 2574 transition count 2397
Iterating global reduction 1 with 43 rules applied. Total rules applied 981 place count 2574 transition count 2397
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 1002 place count 2553 transition count 2397
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1044 place count 2511 transition count 2335
Iterating global reduction 2 with 42 rules applied. Total rules applied 1086 place count 2511 transition count 2335
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1108 place count 2489 transition count 2293
Iterating global reduction 2 with 22 rules applied. Total rules applied 1130 place count 2489 transition count 2293
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 1193 place count 2447 transition count 2272
Applied a total of 1193 rules in 1961 ms. Remains 2447 /3260 variables (removed 813) and now considering 2272/2753 (removed 481) transitions.
// Phase 1: matrix 2272 rows 2447 cols
[2024-06-01 21:21:23] [INFO ] Computed 320 invariants in 128 ms
[2024-06-01 21:21:24] [INFO ] Implicit Places using invariants in 1802 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 483, 1199, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303, 1304, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1538, 1581, 1582, 1583, 1584, 1585, 1586, 1587, 1588, 1589, 1590, 1591, 1592, 1593, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1949, 1950, 1951, 1952, 1953, 1955, 1956, 1957, 1958, 1959, 1960, 2256]
Discarding 107 places :
Implicit Place search using SMT only with invariants took 1870 ms to find 107 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2340/3260 places, 2272/2753 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2299 transition count 2231
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2299 transition count 2231
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 2279 transition count 2191
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 2279 transition count 2191
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 2259 transition count 2171
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 2259 transition count 2171
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 181 place count 2240 transition count 2152
Iterating global reduction 0 with 19 rules applied. Total rules applied 200 place count 2240 transition count 2152
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 219 place count 2221 transition count 2133
Iterating global reduction 0 with 19 rules applied. Total rules applied 238 place count 2221 transition count 2133
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 257 place count 2202 transition count 2114
Iterating global reduction 0 with 19 rules applied. Total rules applied 276 place count 2202 transition count 2114
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 295 place count 2183 transition count 2095
Iterating global reduction 0 with 19 rules applied. Total rules applied 314 place count 2183 transition count 2095
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 333 place count 2164 transition count 2076
Iterating global reduction 0 with 19 rules applied. Total rules applied 352 place count 2164 transition count 2076
Applied a total of 352 rules in 938 ms. Remains 2164 /2340 variables (removed 176) and now considering 2076/2272 (removed 196) transitions.
// Phase 1: matrix 2076 rows 2164 cols
[2024-06-01 21:21:25] [INFO ] Computed 213 invariants in 52 ms
[2024-06-01 21:21:26] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-06-01 21:21:26] [INFO ] Invariant cache hit.
[2024-06-01 21:21:28] [INFO ] Implicit Places using invariants and state equation in 2083 ms returned []
Implicit Place search using SMT with State Equation took 2834 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2164/3260 places, 2076/2753 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7642 ms. Remains : 2164/3260 places, 2076/2753 transitions.
Support contains 601 out of 2164 places after structural reductions.
[2024-06-01 21:21:29] [INFO ] Flatten gal took : 193 ms
[2024-06-01 21:21:29] [INFO ] Flatten gal took : 125 ms
[2024-06-01 21:21:29] [INFO ] Input system was already deterministic with 2076 transitions.
RANDOM walk for 40000 steps (32 resets) in 2425 ms. (16 steps per ms) remains 2/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
[2024-06-01 21:21:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1800/1806 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1806 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 345/2151 variables, 208/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2151 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/2153 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2153 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2064/4217 variables, 2153/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4217 variables, 0/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/4224 variables, 3/2369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4224 variables, 0/2369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7/4231 variables, 3/2372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4231 variables, 0/2372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/4239 variables, 4/2376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4239 variables, 0/2376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/4240 variables, 1/2377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4240 variables, 0/2377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/4240 variables, 0/2377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4240/4240 variables, and 2377 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4164 ms.
Refiners :[Generalized P Invariants (flows): 213/213 constraints, State Equation: 2164/2164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1800/1806 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1806 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 345/2151 variables, 208/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2151 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/2153 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2153 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2064/4217 variables, 2153/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4217 variables, 2/2368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4217 variables, 0/2368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/4224 variables, 3/2371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4224 variables, 0/2371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 7/4231 variables, 3/2374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4231 variables, 0/2374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/4239 variables, 4/2378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4239 variables, 0/2378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/4240 variables, 1/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4240 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/4240 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4240/4240 variables, and 2379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4580 ms.
Refiners :[Generalized P Invariants (flows): 213/213 constraints, State Equation: 2164/2164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 8807ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 458 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=38 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 23 ms.
Computed a total of 2164 stabilizing places and 2076 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2164 transition count 2076
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(F(!p0))) U G(!p1)))'
Support contains 63 out of 2164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2164/2164 places, 2076/2076 transitions.
Graph (complete) has 2667 edges and 2164 vertex of which 1980 are kept as prefixes of interest. Removing 184 places using SCC suffix rule.15 ms
Discarding 184 places :
Also discarding 163 output transitions
Drop transitions (Output transitions of discarded places.) removed 163 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1260 transitions
Trivial Post-agglo rules discarded 1260 transitions
Performed 1260 trivial Post agglomeration. Transition count delta: 1260
Iterating post reduction 0 with 1323 rules applied. Total rules applied 1324 place count 1896 transition count 632
Reduce places removed 1260 places and 0 transitions.
Iterating post reduction 1 with 1260 rules applied. Total rules applied 2584 place count 636 transition count 632
Performed 189 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 189 Pre rules applied. Total rules applied 2584 place count 636 transition count 443
Deduced a syphon composed of 189 places in 0 ms
Ensure Unique test removed 63 places
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 441 rules applied. Total rules applied 3025 place count 384 transition count 443
Discarding 40 places :
Implicit places reduction removed 40 places
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 2 with 80 rules applied. Total rules applied 3105 place count 344 transition count 403
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 3145 place count 304 transition count 403
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3145 place count 304 transition count 402
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3147 place count 303 transition count 402
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 3170 place count 280 transition count 339
Iterating global reduction 4 with 23 rules applied. Total rules applied 3193 place count 280 transition count 339
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 4 with 148 rules applied. Total rules applied 3341 place count 259 transition count 212
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 3405 place count 195 transition count 212
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 3447 place count 174 transition count 191
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 6 with 21 rules applied. Total rules applied 3468 place count 153 transition count 170
Applied a total of 3468 rules in 159 ms. Remains 153 /2164 variables (removed 2011) and now considering 170/2076 (removed 1906) transitions.
// Phase 1: matrix 170 rows 153 cols
[2024-06-01 21:21:40] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 21:21:40] [INFO ] Implicit Places using invariants in 96 ms returned [42, 43, 86, 87]
[2024-06-01 21:21:40] [INFO ] Actually due to overlaps returned [42, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 101 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/2164 places, 170/2076 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 149 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 147 transition count 168
Applied a total of 6 rules in 7 ms. Remains 147 /151 variables (removed 4) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 147 cols
[2024-06-01 21:21:40] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 21:21:40] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 21:21:40] [INFO ] Invariant cache hit.
[2024-06-01 21:21:40] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 147/2164 places, 168/2076 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 412 ms. Remains : 147/2164 places, 168/2076 transitions.
Stuttering acceptance computed with spot in 335 ms :[true, p1, (OR p0 p1), p1]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-00
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-00 finished in 829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 105 out of 2164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2164/2164 places, 2076/2076 transitions.
Graph (complete) has 2667 edges and 2164 vertex of which 1662 are kept as prefixes of interest. Removing 502 places using SCC suffix rule.9 ms
Discarding 502 places :
Also discarding 417 output transitions
Drop transitions (Output transitions of discarded places.) removed 417 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1029 transitions
Trivial Post-agglo rules discarded 1029 transitions
Performed 1029 trivial Post agglomeration. Transition count delta: 1029
Iterating post reduction 0 with 1092 rules applied. Total rules applied 1093 place count 1578 transition count 609
Reduce places removed 1029 places and 0 transitions.
Iterating post reduction 1 with 1029 rules applied. Total rules applied 2122 place count 549 transition count 609
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 2122 place count 549 transition count 483
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 42 places
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 2 with 294 rules applied. Total rules applied 2416 place count 381 transition count 483
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 2439 place count 358 transition count 420
Iterating global reduction 2 with 23 rules applied. Total rules applied 2462 place count 358 transition count 420
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 2 with 105 rules applied. Total rules applied 2567 place count 337 transition count 336
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 2630 place count 274 transition count 336
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 2672 place count 253 transition count 315
Applied a total of 2672 rules in 99 ms. Remains 253 /2164 variables (removed 1911) and now considering 315/2076 (removed 1761) transitions.
// Phase 1: matrix 315 rows 253 cols
[2024-06-01 21:21:40] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 21:21:40] [INFO ] Implicit Places using invariants in 105 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 252/2164 places, 315/2076 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 231 transition count 336
Applied a total of 42 rules in 13 ms. Remains 231 /252 variables (removed 21) and now considering 336/315 (removed -21) transitions.
// Phase 1: matrix 336 rows 231 cols
[2024-06-01 21:21:40] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 21:21:40] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 21:21:40] [INFO ] Invariant cache hit.
[2024-06-01 21:21:41] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/2164 places, 336/2076 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 431 ms. Remains : 231/2164 places, 336/2076 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01
Product exploration explored 100000 steps with 3138 reset in 702 ms.
Stuttering criterion allowed to conclude after 13141 steps with 412 reset in 83 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01 finished in 1542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 129 out of 2164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2164/2164 places, 2076/2076 transitions.
Graph (complete) has 2667 edges and 2164 vertex of which 1452 are kept as prefixes of interest. Removing 712 places using SCC suffix rule.6 ms
Discarding 712 places :
Also discarding 585 output transitions
Drop transitions (Output transitions of discarded places.) removed 585 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 903 transitions
Trivial Post-agglo rules discarded 903 transitions
Performed 903 trivial Post agglomeration. Transition count delta: 903
Iterating post reduction 0 with 966 rules applied. Total rules applied 967 place count 1368 transition count 567
Reduce places removed 903 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 966 rules applied. Total rules applied 1933 place count 465 transition count 504
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 1996 place count 402 transition count 504
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 1996 place count 402 transition count 441
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 2122 place count 339 transition count 441
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2164 place count 318 transition count 420
Applied a total of 2164 rules in 69 ms. Remains 318 /2164 variables (removed 1846) and now considering 420/2076 (removed 1656) transitions.
// Phase 1: matrix 420 rows 318 cols
[2024-06-01 21:21:42] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 21:21:42] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 21:21:42] [INFO ] Invariant cache hit.
[2024-06-01 21:21:42] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-06-01 21:21:42] [INFO ] Redundant transitions in 28 ms returned []
Running 357 sub problems to find dead transitions.
[2024-06-01 21:21:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 420/717 variables, 297/319 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/717 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 21/738 variables, 21/340 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/738 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (OVERLAPS) 0/738 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Real declared 738/738 variables, and 340 constraints, problems are : Problem set: 0 solved, 357 unsolved in 23234 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 420/717 variables, 297/319 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/717 variables, 357/676 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (OVERLAPS) 21/738 variables, 21/697 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/738 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (OVERLAPS) 0/738 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Int declared 738/738 variables, and 697 constraints, problems are : Problem set: 0 solved, 357 unsolved in 29526 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 0/0 constraints]
After SMT, in 52938ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 52948ms
Starting structural reductions in SI_LTL mode, iteration 1 : 318/2164 places, 420/2076 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53378 ms. Remains : 318/2164 places, 420/2076 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02
Product exploration explored 100000 steps with 1217 reset in 616 ms.
Product exploration explored 100000 steps with 1221 reset in 612 ms.
Computed a total of 318 stabilizing places and 420 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 318 transition count 420
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 316 steps (0 resets) in 7 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 21:22:37] [INFO ] Invariant cache hit.
[2024-06-01 21:22:38] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 7 ms returned sat
[2024-06-01 21:22:38] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-06-01 21:22:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:22:38] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 10 ms returned sat
[2024-06-01 21:22:38] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2024-06-01 21:22:38] [INFO ] Computed and/alt/rep : 294/546/294 causal constraints (skipped 63 transitions) in 39 ms.
[2024-06-01 21:22:39] [INFO ] Added : 148 causal constraints over 30 iterations in 1045 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 42 out of 318 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 420/420 transitions.
Applied a total of 0 rules in 11 ms. Remains 318 /318 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-06-01 21:22:39] [INFO ] Invariant cache hit.
[2024-06-01 21:22:39] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 21:22:39] [INFO ] Invariant cache hit.
[2024-06-01 21:22:40] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-01 21:22:40] [INFO ] Redundant transitions in 8 ms returned []
Running 357 sub problems to find dead transitions.
[2024-06-01 21:22:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 420/717 variables, 297/319 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/717 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 21/738 variables, 21/340 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/738 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (OVERLAPS) 0/738 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Real declared 738/738 variables, and 340 constraints, problems are : Problem set: 0 solved, 357 unsolved in 22844 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 420/717 variables, 297/319 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/717 variables, 357/676 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (OVERLAPS) 21/738 variables, 21/697 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/738 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (OVERLAPS) 0/738 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Int declared 738/738 variables, and 697 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30007 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 0/0 constraints]
After SMT, in 52981ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 52995ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53340 ms. Remains : 318/318 places, 420/420 transitions.
Computed a total of 318 stabilizing places and 420 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 318 transition count 420
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 273 steps (0 resets) in 5 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-06-01 21:23:33] [INFO ] Invariant cache hit.
[2024-06-01 21:23:34] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 10 ms returned sat
[2024-06-01 21:23:34] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-06-01 21:23:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:23:34] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 10 ms returned sat
[2024-06-01 21:23:34] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2024-06-01 21:23:34] [INFO ] Computed and/alt/rep : 294/546/294 causal constraints (skipped 63 transitions) in 38 ms.
[2024-06-01 21:23:35] [INFO ] Added : 148 causal constraints over 30 iterations in 909 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1286 reset in 536 ms.
Product exploration explored 100000 steps with 1290 reset in 575 ms.
Support contains 42 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 420/420 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 318 transition count 357
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 255 transition count 357
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 126 place count 255 transition count 294
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 252 place count 192 transition count 294
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 275 place count 169 transition count 231
Ensure Unique test removed 21 places
Iterating global reduction 2 with 44 rules applied. Total rules applied 319 place count 148 transition count 231
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 2 with 105 rules applied. Total rules applied 424 place count 148 transition count 126
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 466 place count 106 transition count 126
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 487 place count 85 transition count 105
Applied a total of 487 rules in 20 ms. Remains 85 /318 variables (removed 233) and now considering 105/420 (removed 315) transitions.
// Phase 1: matrix 105 rows 85 cols
[2024-06-01 21:23:36] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 21:23:36] [INFO ] Implicit Places using invariants in 78 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/318 places, 105/420 transitions.
Reduce places removed 21 places and 21 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /84 variables (removed 21) and now considering 84/105 (removed 21) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 63/318 places, 84/420 transitions.
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02 finished in 115061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (F(G(p0)) U p1))))'
Support contains 168 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 2076/2076 transitions.
Discarding 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 85 place count 2079 transition count 1991
Iterating global reduction 0 with 85 rules applied. Total rules applied 170 place count 2079 transition count 1991
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 235 place count 2014 transition count 1926
Iterating global reduction 0 with 65 rules applied. Total rules applied 300 place count 2014 transition count 1926
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 0 with 42 rules applied. Total rules applied 342 place count 1993 transition count 1905
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 346 place count 1989 transition count 1861
Iterating global reduction 1 with 4 rules applied. Total rules applied 350 place count 1989 transition count 1861
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 393 place count 1946 transition count 1818
Iterating global reduction 1 with 43 rules applied. Total rules applied 436 place count 1946 transition count 1818
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 479 place count 1903 transition count 1775
Iterating global reduction 1 with 43 rules applied. Total rules applied 522 place count 1903 transition count 1775
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 564 place count 1861 transition count 1733
Iterating global reduction 1 with 42 rules applied. Total rules applied 606 place count 1861 transition count 1733
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 648 place count 1819 transition count 1691
Iterating global reduction 1 with 42 rules applied. Total rules applied 690 place count 1819 transition count 1691
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 732 place count 1777 transition count 1649
Iterating global reduction 1 with 42 rules applied. Total rules applied 774 place count 1777 transition count 1649
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 816 place count 1735 transition count 1607
Iterating global reduction 1 with 42 rules applied. Total rules applied 858 place count 1735 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 900 place count 1693 transition count 1565
Iterating global reduction 1 with 42 rules applied. Total rules applied 942 place count 1693 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 984 place count 1651 transition count 1523
Iterating global reduction 1 with 42 rules applied. Total rules applied 1026 place count 1651 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1068 place count 1609 transition count 1481
Iterating global reduction 1 with 42 rules applied. Total rules applied 1110 place count 1609 transition count 1481
Applied a total of 1110 rules in 1406 ms. Remains 1609 /2164 variables (removed 555) and now considering 1481/2076 (removed 595) transitions.
// Phase 1: matrix 1481 rows 1609 cols
[2024-06-01 21:23:38] [INFO ] Computed 192 invariants in 20 ms
[2024-06-01 21:23:39] [INFO ] Implicit Places using invariants in 547 ms returned [847, 1146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 551 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1607/2164 places, 1481/2076 transitions.
Applied a total of 0 rules in 74 ms. Remains 1607 /1607 variables (removed 0) and now considering 1481/1481 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2033 ms. Remains : 1607/2164 places, 1481/2076 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03
Stuttering criterion allowed to conclude after 1214 steps with 0 reset in 25 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03 finished in 2238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 126 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 2076/2076 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 2101 transition count 2076
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 106 place count 2058 transition count 2033
Iterating global reduction 1 with 43 rules applied. Total rules applied 149 place count 2058 transition count 2033
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 172 place count 2035 transition count 2010
Iterating global reduction 1 with 23 rules applied. Total rules applied 195 place count 2035 transition count 2010
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 237 place count 2014 transition count 1989
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 239 place count 2012 transition count 1987
Iterating global reduction 2 with 2 rules applied. Total rules applied 241 place count 2012 transition count 1987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 242 place count 2011 transition count 1986
Iterating global reduction 2 with 1 rules applied. Total rules applied 243 place count 2011 transition count 1986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 244 place count 2010 transition count 1985
Iterating global reduction 2 with 1 rules applied. Total rules applied 245 place count 2010 transition count 1985
Applied a total of 245 rules in 743 ms. Remains 2010 /2164 variables (removed 154) and now considering 1985/2076 (removed 91) transitions.
// Phase 1: matrix 1985 rows 2010 cols
[2024-06-01 21:23:40] [INFO ] Computed 129 invariants in 29 ms
[2024-06-01 21:23:41] [INFO ] Implicit Places using invariants in 731 ms returned [1547]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 734 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2009/2164 places, 1985/2076 transitions.
Applied a total of 0 rules in 133 ms. Remains 2009 /2009 variables (removed 0) and now considering 1985/1985 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1611 ms. Remains : 2009/2164 places, 1985/2076 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-04
Product exploration explored 100000 steps with 381 reset in 575 ms.
Product exploration explored 100000 steps with 378 reset in 596 ms.
Computed a total of 2009 stabilizing places and 1985 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2009 transition count 1985
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 1005 steps (0 resets) in 12 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 243 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 1985 rows 2009 cols
[2024-06-01 21:23:43] [INFO ] Computed 128 invariants in 17 ms
[2024-06-01 21:23:45] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 89 ms returned sat
[2024-06-01 21:23:49] [INFO ] [Real]Absence check using state equation in 3165 ms returned sat
[2024-06-01 21:23:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:23:50] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 91 ms returned sat
[2024-06-01 21:23:57] [INFO ] [Nat]Absence check using state equation in 6534 ms returned sat
[2024-06-01 21:23:57] [INFO ] Computed and/alt/rep : 1899/2131/1899 causal constraints (skipped 65 transitions) in 154 ms.
Could not prove EG (NOT p1)
Support contains 63 out of 2009 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2009/2009 places, 1985/1985 transitions.
Applied a total of 0 rules in 127 ms. Remains 2009 /2009 variables (removed 0) and now considering 1985/1985 (removed 0) transitions.
[2024-06-01 21:24:04] [INFO ] Invariant cache hit.
[2024-06-01 21:24:05] [INFO ] Implicit Places using invariants in 659 ms returned []
[2024-06-01 21:24:05] [INFO ] Invariant cache hit.
[2024-06-01 21:24:07] [INFO ] Implicit Places using invariants and state equation in 2818 ms returned []
Implicit Place search using SMT with State Equation took 3478 ms to find 0 implicit places.
Running 1964 sub problems to find dead transitions.
[2024-06-01 21:24:07] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1988 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1964 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1988/3994 variables, and 126 constraints, problems are : Problem set: 0 solved, 1964 unsolved in 30083 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/2009 constraints, PredecessorRefiner: 1964/1964 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1964 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1988 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1964 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1988/3994 variables, and 126 constraints, problems are : Problem set: 0 solved, 1964 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/2009 constraints, PredecessorRefiner: 0/1964 constraints, Known Traps: 0/0 constraints]
After SMT, in 60679ms problems are : Problem set: 0 solved, 1964 unsolved
Search for dead transitions found 0 dead transitions in 60706ms
Finished structural reductions in LTL mode , in 1 iterations and 64317 ms. Remains : 2009/2009 places, 1985/1985 transitions.
Computed a total of 2009 stabilizing places and 1985 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2009 transition count 1985
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 1081 steps (0 resets) in 12 ms. (83 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 21:25:09] [INFO ] Invariant cache hit.
[2024-06-01 21:25:11] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 89 ms returned sat
[2024-06-01 21:25:14] [INFO ] [Real]Absence check using state equation in 2714 ms returned sat
[2024-06-01 21:25:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:25:16] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 85 ms returned sat
[2024-06-01 21:25:21] [INFO ] [Nat]Absence check using state equation in 5748 ms returned sat
[2024-06-01 21:25:22] [INFO ] Computed and/alt/rep : 1899/2131/1899 causal constraints (skipped 65 transitions) in 152 ms.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 381 reset in 570 ms.
Product exploration explored 100000 steps with 386 reset in 596 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 63 out of 2009 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2009/2009 places, 1985/1985 transitions.
Graph (complete) has 2384 edges and 2009 vertex of which 1074 are kept as prefixes of interest. Removing 935 places using SCC suffix rule.7 ms
Discarding 935 places :
Also discarding 830 output transitions
Drop transitions (Output transitions of discarded places.) removed 830 transitions
Performed 462 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 462 rules applied. Total rules applied 463 place count 1074 transition count 1155
Performed 357 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 357 Pre rules applied. Total rules applied 463 place count 1074 transition count 1197
Deduced a syphon composed of 819 places in 1 ms
Iterating global reduction 1 with 357 rules applied. Total rules applied 820 place count 1074 transition count 1197
Discarding 651 places :
Symmetric choice reduction at 1 with 651 rule applications. Total rules 1471 place count 423 transition count 546
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 1 with 651 rules applied. Total rules applied 2122 place count 423 transition count 546
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 252 places in 0 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 2206 place count 423 transition count 546
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 2353 place count 276 transition count 399
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 2500 place count 276 transition count 399
Deduced a syphon composed of 105 places in 0 ms
Applied a total of 2500 rules in 401 ms. Remains 276 /2009 variables (removed 1733) and now considering 399/1985 (removed 1586) transitions.
[2024-06-01 21:25:31] [INFO ] Redundant transitions in 3 ms returned []
Running 336 sub problems to find dead transitions.
// Phase 1: matrix 399 rows 276 cols
[2024-06-01 21:25:31] [INFO ] Computed 1 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
At refinement iteration 2 (OVERLAPS) 399/654 variables, 255/256 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/654 variables, 0/256 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 21/675 variables, 21/277 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/675 variables, 0/277 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/675 variables, 0/277 constraints. Problems are: Problem set: 147 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 277 constraints, problems are : Problem set: 147 solved, 189 unsolved in 12918 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 147 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 21/171 variables, 1/1 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/1 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 399/570 variables, 171/172 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 189/361 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/361 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 105/675 variables, 105/466 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/466 constraints. Problems are: Problem set: 147 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/675 variables, 0/466 constraints. Problems are: Problem set: 147 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 466 constraints, problems are : Problem set: 147 solved, 189 unsolved in 12605 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 189/336 constraints, Known Traps: 0/0 constraints]
After SMT, in 25696ms problems are : Problem set: 147 solved, 189 unsolved
Search for dead transitions found 147 dead transitions in 25701ms
Found 147 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 147 transitions
Dead transitions reduction (with SMT) removed 147 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 276/2009 places, 252/1985 transitions.
Graph (complete) has 273 edges and 276 vertex of which 171 are kept as prefixes of interest. Removing 105 places using SCC suffix rule.0 ms
Discarding 105 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 171 /276 variables (removed 105) and now considering 252/252 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 171/2009 places, 252/1985 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26141 ms. Remains : 171/2009 places, 252/1985 transitions.
Support contains 63 out of 2009 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2009/2009 places, 1985/1985 transitions.
Applied a total of 0 rules in 131 ms. Remains 2009 /2009 variables (removed 0) and now considering 1985/1985 (removed 0) transitions.
// Phase 1: matrix 1985 rows 2009 cols
[2024-06-01 21:25:57] [INFO ] Computed 128 invariants in 17 ms
[2024-06-01 21:25:57] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-06-01 21:25:57] [INFO ] Invariant cache hit.
[2024-06-01 21:26:00] [INFO ] Implicit Places using invariants and state equation in 2839 ms returned []
Implicit Place search using SMT with State Equation took 3492 ms to find 0 implicit places.
Running 1964 sub problems to find dead transitions.
[2024-06-01 21:26:00] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1988 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1964 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1988/3994 variables, and 126 constraints, problems are : Problem set: 0 solved, 1964 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/2009 constraints, PredecessorRefiner: 1964/1964 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1964 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1988 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1964 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1988/3994 variables, and 126 constraints, problems are : Problem set: 0 solved, 1964 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 126/128 constraints, State Equation: 0/2009 constraints, PredecessorRefiner: 0/1964 constraints, Known Traps: 0/0 constraints]
After SMT, in 60598ms problems are : Problem set: 0 solved, 1964 unsolved
Search for dead transitions found 0 dead transitions in 60623ms
Finished structural reductions in LTL mode , in 1 iterations and 64251 ms. Remains : 2009/2009 places, 1985/1985 transitions.
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-04 finished in 201864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(!p1 U (p2||G(!p1))))))'
Support contains 129 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 2076/2076 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 2101 transition count 2076
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 148 place count 2016 transition count 1991
Iterating global reduction 1 with 85 rules applied. Total rules applied 233 place count 2016 transition count 1991
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 277 place count 1972 transition count 1947
Iterating global reduction 1 with 44 rules applied. Total rules applied 321 place count 1972 transition count 1947
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 323 place count 1970 transition count 1945
Iterating global reduction 1 with 2 rules applied. Total rules applied 325 place count 1970 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 326 place count 1969 transition count 1944
Iterating global reduction 1 with 1 rules applied. Total rules applied 327 place count 1969 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 328 place count 1968 transition count 1943
Iterating global reduction 1 with 1 rules applied. Total rules applied 329 place count 1968 transition count 1943
Applied a total of 329 rules in 668 ms. Remains 1968 /2164 variables (removed 196) and now considering 1943/2076 (removed 133) transitions.
// Phase 1: matrix 1943 rows 1968 cols
[2024-06-01 21:27:02] [INFO ] Computed 150 invariants in 16 ms
[2024-06-01 21:27:02] [INFO ] Implicit Places using invariants in 718 ms returned [1379, 1380, 1381, 1382, 1383, 1384, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1398, 1399, 1505]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 720 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1946/2164 places, 1943/2076 transitions.
Applied a total of 0 rules in 115 ms. Remains 1946 /1946 variables (removed 0) and now considering 1943/1943 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1503 ms. Remains : 1946/2164 places, 1943/2076 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06 finished in 1662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p2)||p1)))))'
Support contains 4 out of 2164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2164/2164 places, 2076/2076 transitions.
Graph (complete) has 2667 edges and 2164 vertex of which 1046 are kept as prefixes of interest. Removing 1118 places using SCC suffix rule.3 ms
Discarding 1118 places :
Also discarding 1012 output transitions
Drop transitions (Output transitions of discarded places.) removed 1012 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 62 places :
Implicit places reduction removed 62 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 876 transitions
Trivial Post-agglo rules discarded 876 transitions
Performed 876 trivial Post agglomeration. Transition count delta: 876
Iterating post reduction 0 with 938 rules applied. Total rules applied 939 place count 963 transition count 167
Reduce places removed 876 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 877 rules applied. Total rules applied 1816 place count 87 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1817 place count 86 transition count 166
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 1817 place count 86 transition count 140
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 1870 place count 59 transition count 140
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1891 place count 38 transition count 79
Iterating global reduction 3 with 21 rules applied. Total rules applied 1912 place count 38 transition count 79
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 46 rules applied. Total rules applied 1958 place count 37 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1961 place count 34 transition count 34
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1978 place count 17 transition count 17
Iterating global reduction 5 with 17 rules applied. Total rules applied 1995 place count 17 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1997 place count 16 transition count 16
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 2000 place count 13 transition count 13
Applied a total of 2000 rules in 34 ms. Remains 13 /2164 variables (removed 2151) and now considering 13/2076 (removed 2063) transitions.
// Phase 1: matrix 13 rows 13 cols
[2024-06-01 21:27:03] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 21:27:03] [INFO ] Implicit Places using invariants in 39 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/2164 places, 13/2076 transitions.
Graph (complete) has 11 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 11/13 (removed 2) transitions.
// Phase 1: matrix 11 rows 10 cols
[2024-06-01 21:27:03] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 21:27:03] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 21:27:03] [INFO ] Invariant cache hit.
[2024-06-01 21:27:03] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/2164 places, 11/2076 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 263 ms. Remains : 10/2164 places, 11/2076 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09
Product exploration explored 100000 steps with 13521 reset in 152 ms.
Product exploration explored 100000 steps with 13501 reset in 208 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X p1)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 159 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09 finished in 936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 2164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2164/2164 places, 2076/2076 transitions.
Graph (complete) has 2667 edges and 2164 vertex of which 1047 are kept as prefixes of interest. Removing 1117 places using SCC suffix rule.2 ms
Discarding 1117 places :
Also discarding 1013 output transitions
Drop transitions (Output transitions of discarded places.) removed 1013 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 875 transitions
Trivial Post-agglo rules discarded 875 transitions
Performed 875 trivial Post agglomeration. Transition count delta: 875
Iterating post reduction 0 with 938 rules applied. Total rules applied 939 place count 963 transition count 167
Reduce places removed 875 places and 0 transitions.
Iterating post reduction 1 with 875 rules applied. Total rules applied 1814 place count 88 transition count 167
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 1814 place count 88 transition count 139
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 1872 place count 58 transition count 139
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1893 place count 37 transition count 78
Iterating global reduction 2 with 21 rules applied. Total rules applied 1914 place count 37 transition count 78
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 47 rules applied. Total rules applied 1961 place count 36 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1964 place count 33 transition count 32
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1982 place count 15 transition count 14
Iterating global reduction 4 with 18 rules applied. Total rules applied 2000 place count 15 transition count 14
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 4 with 2 rules applied. Total rules applied 2002 place count 14 transition count 13
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 2005 place count 11 transition count 10
Applied a total of 2005 rules in 22 ms. Remains 11 /2164 variables (removed 2153) and now considering 10/2076 (removed 2066) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-06-01 21:27:04] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 21:27:04] [INFO ] Implicit Places using invariants in 34 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/2164 places, 10/2076 transitions.
Graph (complete) has 7 edges and 10 vertex of which 8 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 0 ms. Remains 7 /10 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-06-01 21:27:04] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 21:27:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 21:27:04] [INFO ] Invariant cache hit.
[2024-06-01 21:27:04] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/2164 places, 7/2076 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 7/2164 places, 7/2076 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-10
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-10 finished in 173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((G(p1)&&F((G(F(p0))||(p2&&F(p0))))) U (G((p1&&F((G(F(p0))||(p2&&F(p0))))))||(!p3&&G(p1)&&F((G(F(p0))||(p2&&F(p0)))))))))'
Support contains 5 out of 2164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2164/2164 places, 2076/2076 transitions.
Graph (complete) has 2667 edges and 2164 vertex of which 2156 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.9 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1362 transitions
Trivial Post-agglo rules discarded 1362 transitions
Performed 1362 trivial Post agglomeration. Transition count delta: 1362
Iterating post reduction 0 with 1425 rules applied. Total rules applied 1426 place count 2072 transition count 684
Reduce places removed 1362 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 1385 rules applied. Total rules applied 2811 place count 710 transition count 661
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 2834 place count 687 transition count 661
Performed 276 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 276 Pre rules applied. Total rules applied 2834 place count 687 transition count 385
Deduced a syphon composed of 276 places in 0 ms
Ensure Unique test removed 126 places
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 3 with 678 rules applied. Total rules applied 3512 place count 285 transition count 385
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 3 with 41 rules applied. Total rules applied 3553 place count 285 transition count 344
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 4 with 81 rules applied. Total rules applied 3634 place count 244 transition count 304
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 3654 place count 224 transition count 304
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 3654 place count 224 transition count 283
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 3696 place count 203 transition count 283
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 3738 place count 161 transition count 221
Iterating global reduction 6 with 42 rules applied. Total rules applied 3780 place count 161 transition count 221
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 6 with 106 rules applied. Total rules applied 3886 place count 140 transition count 136
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 7 with 43 rules applied. Total rules applied 3929 place count 97 transition count 136
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 3929 place count 97 transition count 134
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3933 place count 95 transition count 134
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 3951 place count 77 transition count 116
Iterating global reduction 8 with 18 rules applied. Total rules applied 3969 place count 77 transition count 116
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 3986 place count 60 transition count 82
Iterating global reduction 8 with 17 rules applied. Total rules applied 4003 place count 60 transition count 82
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 4020 place count 43 transition count 65
Iterating global reduction 8 with 17 rules applied. Total rules applied 4037 place count 43 transition count 65
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 4054 place count 26 transition count 31
Iterating global reduction 8 with 17 rules applied. Total rules applied 4071 place count 26 transition count 31
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 8 with 2 rules applied. Total rules applied 4073 place count 25 transition count 30
Applied a total of 4073 rules in 100 ms. Remains 25 /2164 variables (removed 2139) and now considering 30/2076 (removed 2046) transitions.
// Phase 1: matrix 30 rows 25 cols
[2024-06-01 21:27:04] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 21:27:04] [INFO ] Implicit Places using invariants in 139 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/2164 places, 30/2076 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 23 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 23 transition count 29
Applied a total of 2 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 29/30 (removed 1) transitions.
// Phase 1: matrix 29 rows 23 cols
[2024-06-01 21:27:04] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 21:27:04] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 21:27:04] [INFO ] Invariant cache hit.
[2024-06-01 21:27:04] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/2164 places, 29/2076 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 352 ms. Remains : 23/2164 places, 29/2076 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11
Stuttering criterion allowed to conclude after 96 steps with 1 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11 finished in 681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 2 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 2076/2076 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 2101 transition count 2076
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 148 place count 2016 transition count 1991
Iterating global reduction 1 with 85 rules applied. Total rules applied 233 place count 2016 transition count 1991
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 298 place count 1951 transition count 1926
Iterating global reduction 1 with 65 rules applied. Total rules applied 363 place count 1951 transition count 1926
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 405 place count 1930 transition count 1905
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 409 place count 1926 transition count 1861
Iterating global reduction 2 with 4 rules applied. Total rules applied 413 place count 1926 transition count 1861
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 456 place count 1883 transition count 1818
Iterating global reduction 2 with 43 rules applied. Total rules applied 499 place count 1883 transition count 1818
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 542 place count 1840 transition count 1775
Iterating global reduction 2 with 43 rules applied. Total rules applied 585 place count 1840 transition count 1775
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 627 place count 1798 transition count 1733
Iterating global reduction 2 with 42 rules applied. Total rules applied 669 place count 1798 transition count 1733
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 711 place count 1756 transition count 1691
Iterating global reduction 2 with 42 rules applied. Total rules applied 753 place count 1756 transition count 1691
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 795 place count 1714 transition count 1649
Iterating global reduction 2 with 42 rules applied. Total rules applied 837 place count 1714 transition count 1649
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 879 place count 1672 transition count 1607
Iterating global reduction 2 with 42 rules applied. Total rules applied 921 place count 1672 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 963 place count 1630 transition count 1565
Iterating global reduction 2 with 42 rules applied. Total rules applied 1005 place count 1630 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1047 place count 1588 transition count 1523
Iterating global reduction 2 with 42 rules applied. Total rules applied 1089 place count 1588 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1131 place count 1546 transition count 1481
Iterating global reduction 2 with 42 rules applied. Total rules applied 1173 place count 1546 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1215 place count 1504 transition count 1439
Iterating global reduction 2 with 42 rules applied. Total rules applied 1257 place count 1504 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1299 place count 1462 transition count 1397
Iterating global reduction 2 with 42 rules applied. Total rules applied 1341 place count 1462 transition count 1397
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1383 place count 1420 transition count 1355
Iterating global reduction 2 with 42 rules applied. Total rules applied 1425 place count 1420 transition count 1355
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1467 place count 1378 transition count 1313
Iterating global reduction 2 with 42 rules applied. Total rules applied 1509 place count 1378 transition count 1313
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 1551 place count 1378 transition count 1271
Applied a total of 1551 rules in 1590 ms. Remains 1378 /2164 variables (removed 786) and now considering 1271/2076 (removed 805) transitions.
// Phase 1: matrix 1271 rows 1378 cols
[2024-06-01 21:27:06] [INFO ] Computed 129 invariants in 7 ms
[2024-06-01 21:27:06] [INFO ] Implicit Places using invariants in 446 ms returned [616, 915]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 448 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1376/2164 places, 1271/2076 transitions.
Applied a total of 0 rules in 60 ms. Remains 1376 /1376 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2099 ms. Remains : 1376/2164 places, 1271/2076 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 402 ms.
Product exploration explored 100000 steps with 33333 reset in 436 ms.
Computed a total of 1376 stabilizing places and 1271 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1376 transition count 1271
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 29 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12 finished in 3537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2164/2164 places, 2076/2076 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 2101 transition count 2076
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 148 place count 2016 transition count 1991
Iterating global reduction 1 with 85 rules applied. Total rules applied 233 place count 2016 transition count 1991
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 298 place count 1951 transition count 1926
Iterating global reduction 1 with 65 rules applied. Total rules applied 363 place count 1951 transition count 1926
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 405 place count 1930 transition count 1905
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 409 place count 1926 transition count 1861
Iterating global reduction 2 with 4 rules applied. Total rules applied 413 place count 1926 transition count 1861
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 456 place count 1883 transition count 1818
Iterating global reduction 2 with 43 rules applied. Total rules applied 499 place count 1883 transition count 1818
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 542 place count 1840 transition count 1775
Iterating global reduction 2 with 43 rules applied. Total rules applied 585 place count 1840 transition count 1775
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 627 place count 1798 transition count 1733
Iterating global reduction 2 with 42 rules applied. Total rules applied 669 place count 1798 transition count 1733
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 711 place count 1756 transition count 1691
Iterating global reduction 2 with 42 rules applied. Total rules applied 753 place count 1756 transition count 1691
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 795 place count 1714 transition count 1649
Iterating global reduction 2 with 42 rules applied. Total rules applied 837 place count 1714 transition count 1649
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 879 place count 1672 transition count 1607
Iterating global reduction 2 with 42 rules applied. Total rules applied 921 place count 1672 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 963 place count 1630 transition count 1565
Iterating global reduction 2 with 42 rules applied. Total rules applied 1005 place count 1630 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1047 place count 1588 transition count 1523
Iterating global reduction 2 with 42 rules applied. Total rules applied 1089 place count 1588 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1131 place count 1546 transition count 1481
Iterating global reduction 2 with 42 rules applied. Total rules applied 1173 place count 1546 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1215 place count 1504 transition count 1439
Iterating global reduction 2 with 42 rules applied. Total rules applied 1257 place count 1504 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1299 place count 1462 transition count 1397
Iterating global reduction 2 with 42 rules applied. Total rules applied 1341 place count 1462 transition count 1397
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1383 place count 1420 transition count 1355
Iterating global reduction 2 with 42 rules applied. Total rules applied 1425 place count 1420 transition count 1355
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1467 place count 1378 transition count 1313
Iterating global reduction 2 with 42 rules applied. Total rules applied 1509 place count 1378 transition count 1313
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 1551 place count 1378 transition count 1271
Applied a total of 1551 rules in 1605 ms. Remains 1378 /2164 variables (removed 786) and now considering 1271/2076 (removed 805) transitions.
[2024-06-01 21:27:09] [INFO ] Invariant cache hit.
[2024-06-01 21:27:10] [INFO ] Implicit Places using invariants in 566 ms returned [616, 915]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 568 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1376/2164 places, 1271/2076 transitions.
Applied a total of 0 rules in 61 ms. Remains 1376 /1376 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2234 ms. Remains : 1376/2164 places, 1271/2076 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13 finished in 2333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2164/2164 places, 2076/2076 transitions.
Graph (complete) has 2667 edges and 2164 vertex of which 1020 are kept as prefixes of interest. Removing 1144 places using SCC suffix rule.2 ms
Discarding 1144 places :
Also discarding 1038 output transitions
Drop transitions (Output transitions of discarded places.) removed 1038 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 867 transitions
Trivial Post-agglo rules discarded 867 transitions
Performed 867 trivial Post agglomeration. Transition count delta: 867
Iterating post reduction 0 with 930 rules applied. Total rules applied 931 place count 936 transition count 150
Reduce places removed 867 places and 0 transitions.
Iterating post reduction 1 with 867 rules applied. Total rules applied 1798 place count 69 transition count 150
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 1798 place count 69 transition count 128
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 1842 place count 47 transition count 128
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1863 place count 26 transition count 67
Iterating global reduction 2 with 21 rules applied. Total rules applied 1884 place count 26 transition count 67
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 1926 place count 26 transition count 25
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1945 place count 7 transition count 6
Iterating global reduction 3 with 19 rules applied. Total rules applied 1964 place count 7 transition count 6
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1966 place count 5 transition count 4
Applied a total of 1966 rules in 21 ms. Remains 5 /2164 variables (removed 2159) and now considering 4/2076 (removed 2072) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-06-01 21:27:10] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 21:27:10] [INFO ] Implicit Places using invariants in 20 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2164 places, 4/2076 transitions.
Graph (complete) has 2 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 21:27:10] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 21:27:10] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 21:27:10] [INFO ] Invariant cache hit.
[2024-06-01 21:27:10] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/2164 places, 2/2076 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 2/2164 places, 2/2076 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 34 ms.
Product exploration explored 100000 steps with 50000 reset in 42 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-14 finished in 253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 2164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2164/2164 places, 2076/2076 transitions.
Graph (complete) has 2667 edges and 2164 vertex of which 1057 are kept as prefixes of interest. Removing 1107 places using SCC suffix rule.2 ms
Discarding 1107 places :
Also discarding 1005 output transitions
Drop transitions (Output transitions of discarded places.) removed 1005 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 859 transitions
Trivial Post-agglo rules discarded 859 transitions
Performed 859 trivial Post agglomeration. Transition count delta: 859
Iterating post reduction 0 with 922 rules applied. Total rules applied 923 place count 973 transition count 191
Reduce places removed 859 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 860 rules applied. Total rules applied 1783 place count 114 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1784 place count 113 transition count 190
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 1784 place count 113 transition count 159
Deduced a syphon composed of 31 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 1851 place count 77 transition count 159
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 1853 place count 77 transition count 157
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1856 place count 75 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1856 place count 75 transition count 155
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1858 place count 74 transition count 155
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1878 place count 54 transition count 97
Iterating global reduction 5 with 20 rules applied. Total rules applied 1898 place count 54 transition count 97
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 25 rules applied. Total rules applied 1923 place count 53 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1925 place count 51 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1925 place count 51 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1927 place count 50 transition count 72
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 1945 place count 32 transition count 54
Iterating global reduction 7 with 18 rules applied. Total rules applied 1963 place count 32 transition count 54
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 1981 place count 14 transition count 18
Iterating global reduction 7 with 18 rules applied. Total rules applied 1999 place count 14 transition count 18
Applied a total of 1999 rules in 25 ms. Remains 14 /2164 variables (removed 2150) and now considering 18/2076 (removed 2058) transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-06-01 21:27:10] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 21:27:11] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 21:27:11] [INFO ] Invariant cache hit.
[2024-06-01 21:27:11] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-06-01 21:27:11] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-06-01 21:27:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 18/29 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 3/32 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/32 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 15 constraints, problems are : Problem set: 0 solved, 12 unsolved in 161 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 18/29 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 3/32 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 27 constraints, problems are : Problem set: 0 solved, 12 unsolved in 142 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 320ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 320ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/2164 places, 18/2076 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 425 ms. Remains : 14/2164 places, 18/2076 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-15
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-15 finished in 508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
[2024-06-01 21:27:11] [INFO ] Flatten gal took : 99 ms
[2024-06-01 21:27:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2024-06-01 21:27:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2164 places, 2076 transitions and 4765 arcs took 17 ms.
Total runtime 351988 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02
Could not compute solution for formula : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-04

BK_STOP 1717277294812

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02
ltl formula formula --ltl=/tmp/1219/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2164 places, 2076 transitions and 4765 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.660 real 0.100 user 0.120 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1219/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1219/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1219/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1219/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-04
ltl formula formula --ltl=/tmp/1219/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2164 places, 2076 transitions and 4765 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.070 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1219/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1219/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1219/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1219/ltl_1_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FamilyReunion-PT-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 r492-smll-171636267000492"
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 ;