Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 22 18:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 18:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 24 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 134K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620675136213

Running Version 0
[2021-05-10 19:32:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-10 19:32:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 19:32:17] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-10 19:32:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-10 19:32:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 651 ms
[2021-05-10 19:32:18] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2021-05-10 19:32:18] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 19:32:18] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions in 5 ms.
[2021-05-10 19:32:18] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_6401851638930342161.dot
[2021-05-10 19:32:18] [INFO ] Initial state test concluded for 1 properties.
Reduce places removed 5 places and 0 transitions.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100007 steps, including 140 resets, run finished after 94 ms. (steps per millisecond=1063 ) properties (out of 22) seen :21
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 99 cols
[2021-05-10 19:32:18] [INFO ] Computed 33 place invariants in 16 ms
[2021-05-10 19:32:18] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2021-05-10 19:32:18] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-10 19:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:32:18] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-10 19:32:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 19:32:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-10 19:32:18] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2021-05-10 19:32:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 19:32:18] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-10 19:32:19] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-10 19:32:19] [INFO ] Added : 55 causal constraints over 11 iterations in 99 ms. Result :sat
[2021-05-10 19:32:19] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-10 19:32:19] [INFO ] Flatten gal took : 29 ms
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 19:32:19] [INFO ] Flatten gal took : 8 ms
[2021-05-10 19:32:19] [INFO ] Unfolded HLPN to a Petri net with 1486 places and 1234 transitions in 18 ms.
[2021-05-10 19:32:19] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_15823135750845540278.dot
Deduced a syphon composed of 11 places in 15 ms
Reduce places removed 21 places and 0 transitions.
Support contains 402 out of 1465 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Reduce places removed 41 places and 0 transitions.
Discarding 132 places :
Implicit places reduction removed 132 places
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 1292 transition count 1234
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 260 place count 1205 transition count 1136
Iterating global reduction 1 with 87 rules applied. Total rules applied 347 place count 1205 transition count 1136
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 358 place count 1194 transition count 1136
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 380 place count 1172 transition count 1104
Iterating global reduction 2 with 22 rules applied. Total rules applied 402 place count 1172 transition count 1104
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 413 place count 1161 transition count 1093
Iterating global reduction 2 with 11 rules applied. Total rules applied 424 place count 1161 transition count 1093
Applied a total of 424 rules in 267 ms. Remains 1161 /1465 variables (removed 304) and now considering 1093/1234 (removed 141) transitions.
// Phase 1: matrix 1093 rows 1161 cols
[2021-05-10 19:32:19] [INFO ] Computed 161 place invariants in 43 ms
[2021-05-10 19:32:19] [INFO ] Implicit Places using invariants in 392 ms returned [66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 554, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 1029, 1030, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1038, 1039]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 405 ms to find 89 implicit places.
// Phase 1: matrix 1093 rows 1072 cols
[2021-05-10 19:32:19] [INFO ] Computed 72 place invariants in 17 ms
[2021-05-10 19:32:20] [INFO ] Dead Transitions using invariants and state equation in 575 ms returned []
Starting structural reductions, iteration 1 : 1072/1465 places, 1093/1234 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1051 transition count 1072
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1051 transition count 1072
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 1041 transition count 1052
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 1041 transition count 1052
Applied a total of 62 rules in 102 ms. Remains 1041 /1072 variables (removed 31) and now considering 1052/1093 (removed 41) transitions.
// Phase 1: matrix 1052 rows 1041 cols
[2021-05-10 19:32:20] [INFO ] Computed 72 place invariants in 8 ms
[2021-05-10 19:32:20] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 1052 rows 1041 cols
[2021-05-10 19:32:20] [INFO ] Computed 72 place invariants in 10 ms
[2021-05-10 19:32:21] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1041/1465 places, 1052/1234 transitions.
[2021-05-10 19:32:21] [INFO ] Flatten gal took : 61 ms
[2021-05-10 19:32:21] [INFO ] Flatten gal took : 52 ms
[2021-05-10 19:32:21] [INFO ] Input system was already deterministic with 1052 transitions.
Incomplete random walk after 100000 steps, including 154 resets, run finished after 413 ms. (steps per millisecond=242 ) properties (out of 19) seen :18
Running SMT prover for 1 properties.
// Phase 1: matrix 1052 rows 1041 cols
[2021-05-10 19:32:22] [INFO ] Computed 72 place invariants in 7 ms
[2021-05-10 19:32:22] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2021-05-10 19:32:22] [INFO ] [Real]Absence check using 2 positive and 70 generalized place invariants in 14 ms returned sat
[2021-05-10 19:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 19:32:22] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2021-05-10 19:32:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 19:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2021-05-10 19:32:22] [INFO ] [Nat]Absence check using 2 positive and 70 generalized place invariants in 15 ms returned sat
[2021-05-10 19:32:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 19:32:23] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2021-05-10 19:32:23] [INFO ] Computed and/alt/rep : 971/1148/971 causal constraints (skipped 70 transitions) in 79 ms.
[2021-05-10 19:32:27] [INFO ] Added : 373 causal constraints over 75 iterations in 3862 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 66 out of 1041 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1041/1041 places, 1052/1052 transitions.
Graph (complete) has 1381 edges and 1041 vertex of which 1037 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 563 transitions
Trivial Post-agglo rules discarded 563 transitions
Performed 563 trivial Post agglomeration. Transition count delta: 563
Iterating post reduction 0 with 563 rules applied. Total rules applied 564 place count 1036 transition count 488
Reduce places removed 563 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 598 rules applied. Total rules applied 1162 place count 473 transition count 453
Reduce places removed 23 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 45 rules applied. Total rules applied 1207 place count 450 transition count 431
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1229 place count 428 transition count 431
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 110 Pre rules applied. Total rules applied 1229 place count 428 transition count 321
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 33 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 4 with 253 rules applied. Total rules applied 1482 place count 285 transition count 321
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1482 place count 285 transition count 310
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1504 place count 274 transition count 310
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 1530 place count 248 transition count 254
Iterating global reduction 4 with 26 rules applied. Total rules applied 1556 place count 248 transition count 254
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1567 place count 248 transition count 243
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1567 place count 248 transition count 232
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1589 place count 237 transition count 232
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1590 place count 236 transition count 221
Iterating global reduction 5 with 1 rules applied. Total rules applied 1591 place count 236 transition count 221
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 22 rules applied. Total rules applied 1613 place count 236 transition count 199
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1624 place count 225 transition count 199
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 1670 place count 202 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1671 place count 201 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1672 place count 200 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1673 place count 199 transition count 173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1674 place count 198 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1675 place count 197 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1676 place count 196 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1677 place count 195 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1678 place count 194 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1679 place count 193 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1680 place count 192 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1681 place count 191 transition count 165
Applied a total of 1681 rules in 138 ms. Remains 191 /1041 variables (removed 850) and now considering 165/1052 (removed 887) transitions.
// Phase 1: matrix 165 rows 191 cols
[2021-05-10 19:32:27] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-10 19:32:27] [INFO ] Implicit Places using invariants in 76 ms returned [11, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 46, 179]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 77 ms to find 14 implicit places.
[2021-05-10 19:32:27] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 165 rows 177 cols
[2021-05-10 19:32:27] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-10 19:32:27] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Starting structural reductions, iteration 1 : 177/1041 places, 165/1052 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 177 transition count 154
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 166 transition count 154
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 166 transition count 143
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 155 transition count 143
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 54 place count 145 transition count 133
Iterating global reduction 2 with 10 rules applied. Total rules applied 64 place count 145 transition count 133
Applied a total of 64 rules in 10 ms. Remains 145 /177 variables (removed 32) and now considering 133/165 (removed 32) transitions.
// Phase 1: matrix 133 rows 145 cols
[2021-05-10 19:32:27] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-10 19:32:27] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 133 rows 145 cols
[2021-05-10 19:32:27] [INFO ] Computed 23 place invariants in 5 ms
[2021-05-10 19:32:27] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 145/1041 places, 133/1052 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99) (ADD s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143)), p0:(LEQ 2 (ADD s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3651 reset in 541 ms.
Product exploration explored 100000 steps with 3567 reset in 357 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 145 transition count 133
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), p1, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3635 reset in 298 ms.
Product exploration explored 100000 steps with 3631 reset in 317 ms.
[2021-05-10 19:32:29] [INFO ] Flatten gal took : 7 ms
[2021-05-10 19:32:29] [INFO ] Flatten gal took : 5 ms
[2021-05-10 19:32:29] [INFO ] Time to serialize gal into /tmp/LTL5423611037967092043.gal : 2 ms
[2021-05-10 19:32:29] [INFO ] Time to serialize properties into /tmp/LTL1660878907008486014.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5423611037967092043.gal, -t, CGAL, -LTL, /tmp/LTL1660878907008486014.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5423611037967092043.gal -t CGAL -LTL /tmp/LTL1660878907008486014.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((((((((((((((((((((p5_0+p5_1)+p5_2)+p5_3)+p5_4)+p5_5)+p5_6)+p5_7)+p5_8)+p5_9)+p5_10)+p5_11)+p5_12)+p5_13)+p5_14)+p5_15)+p5_16)+p5_17)+p5_18)+p5_19)+p5_20)+p5_21)>=2)")||(G("((((((((((((((((((((((p4_0+p4_1)+p4_2)+p4_3)+p4_4)+p4_5)+p4_6)+p4_7)+p4_8)+p4_9)+p4_10)+p4_11)+p4_12)+p4_13)+p4_14)+p4_15)+p4_16)+p4_17)+p4_18)+p4_19)+p4_20)+p4_21)<=(((((((((((((((((((((pl0_0+pl0_1)+pl0_2)+pl0_3)+pl0_4)+pl0_5)+pl0_6)+pl0_7)+pl0_8)+pl0_9)+pl0_10)+pl0_11)+pl0_12)+pl0_13)+pl0_14)+pl0_15)+pl0_16)+pl0_17)+pl0_18)+pl0_19)+pl0_20)+pl0_21))"))))))
Formula 0 simplified : !GF("((((((((((((((((((((((p5_0+p5_1)+p5_2)+p5_3)+p5_4)+p5_5)+p5_6)+p5_7)+p5_8)+p5_9)+p5_10)+p5_11)+p5_12)+p5_13)+p5_14)+p5_15)+p5_16)+p5_17)+p5_18)+p5_19)+p5_20)+p5_21)>=2)" | G"((((((((((((((((((((((p4_0+p4_1)+p4_2)+p4_3)+p4_4)+p4_5)+p4_6)+p4_7)+p4_8)+p4_9)+p4_10)+p4_11)+p4_12)+p4_13)+p4_14)+p4_15)+p4_16)+p4_17)+p4_18)+p4_19)+p4_20)+p4_21)<=(((((((((((((((((((((pl0_0+pl0_1)+pl0_2)+pl0_3)+pl0_4)+pl0_5)+pl0_6)+pl0_7)+pl0_8)+pl0_9)+pl0_10)+pl0_11)+pl0_12)+pl0_13)+pl0_14)+pl0_15)+pl0_16)+pl0_17)+pl0_18)+pl0_19)+pl0_20)+pl0_21))")
Reverse transition relation is NOT exact ! Due to transitions t920, t921, t922, t923, t924, t925, t926, t927, t928, t929, t930, t931, t932, t933, t934, t935, t936, t937, t938, t939, t940, t941, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/111/22/133
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2021-05-10 19:32:44] [INFO ] Flatten gal took : 5 ms
[2021-05-10 19:32:44] [INFO ] Applying decomposition
[2021-05-10 19:32:44] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16664534145335066218.txt, -o, /tmp/graph16664534145335066218.bin, -w, /tmp/graph16664534145335066218.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16664534145335066218.bin, -l, -1, -v, -w, /tmp/graph16664534145335066218.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:32:44] [INFO ] Decomposing Gal with order
[2021-05-10 19:32:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:32:44] [INFO ] Flatten gal took : 42 ms
[2021-05-10 19:32:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-10 19:32:44] [INFO ] Time to serialize gal into /tmp/LTL8876667928270676173.gal : 3 ms
[2021-05-10 19:32:44] [INFO ] Time to serialize properties into /tmp/LTL12326507326548031594.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8876667928270676173.gal, -t, CGAL, -LTL, /tmp/LTL12326507326548031594.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8876667928270676173.gal -t CGAL -LTL /tmp/LTL12326507326548031594.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((((((((((((((((((((gi1.gu6.p5_0+gi1.gu6.p5_1)+gi1.gu6.p5_2)+gi1.gu6.p5_3)+gi1.gu6.p5_4)+gi1.gu6.p5_5)+gi1.gu6.p5_6)+gi1.gu6.p5_7)+gi1.gu6.p5_8)+gi1.gu6.p5_9)+gi1.gu6.p5_10)+gi1.gu6.p5_11)+gi1.gu6.p5_12)+gi1.gu6.p5_13)+gi1.gu6.p5_14)+gi1.gu6.p5_15)+gi1.gu6.p5_16)+gi1.gu6.p5_17)+gi1.gu6.p5_18)+gi1.gu6.p5_19)+gi1.gu6.p5_20)+gi1.gu6.p5_21)>=2)")||(G("((((((((((((((((((((((gu7.p4_0+gu7.p4_1)+gu7.p4_2)+gu7.p4_3)+gu7.p4_4)+gu7.p4_5)+gu7.p4_6)+gu7.p4_7)+gu7.p4_8)+gu7.p4_9)+gu7.p4_10)+gu7.p4_11)+gu7.p4_12)+gu7.p4_13)+gu7.p4_14)+gu7.p4_15)+gu7.p4_16)+gu7.p4_17)+gu7.p4_18)+gu7.p4_19)+gu7.p4_20)+gu7.p4_21)<=(((((((((((((((((((((gu7.pl0_0+gu7.pl0_1)+gu7.pl0_2)+gu7.pl0_3)+gu7.pl0_4)+gu7.pl0_5)+gu7.pl0_6)+gu7.pl0_7)+gu7.pl0_8)+gu7.pl0_9)+gu7.pl0_10)+gu7.pl0_11)+gu7.pl0_12)+gu7.pl0_13)+gu7.pl0_14)+gu7.pl0_15)+gu7.pl0_16)+gu7.pl0_17)+gu7.pl0_18)+gu7.pl0_19)+gu7.pl0_20)+gu7.pl0_21))"))))))
Formula 0 simplified : !GF("((((((((((((((((((((((gi1.gu6.p5_0+gi1.gu6.p5_1)+gi1.gu6.p5_2)+gi1.gu6.p5_3)+gi1.gu6.p5_4)+gi1.gu6.p5_5)+gi1.gu6.p5_6)+gi1.gu6.p5_7)+gi1.gu6.p5_8)+gi1.gu6.p5_9)+gi1.gu6.p5_10)+gi1.gu6.p5_11)+gi1.gu6.p5_12)+gi1.gu6.p5_13)+gi1.gu6.p5_14)+gi1.gu6.p5_15)+gi1.gu6.p5_16)+gi1.gu6.p5_17)+gi1.gu6.p5_18)+gi1.gu6.p5_19)+gi1.gu6.p5_20)+gi1.gu6.p5_21)>=2)" | G"((((((((((((((((((((((gu7.p4_0+gu7.p4_1)+gu7.p4_2)+gu7.p4_3)+gu7.p4_4)+gu7.p4_5)+gu7.p4_6)+gu7.p4_7)+gu7.p4_8)+gu7.p4_9)+gu7.p4_10)+gu7.p4_11)+gu7.p4_12)+gu7.p4_13)+gu7.p4_14)+gu7.p4_15)+gu7.p4_16)+gu7.p4_17)+gu7.p4_18)+gu7.p4_19)+gu7.p4_20)+gu7.p4_21)<=(((((((((((((((((((((gu7.pl0_0+gu7.pl0_1)+gu7.pl0_2)+gu7.pl0_3)+gu7.pl0_4)+gu7.pl0_5)+gu7.pl0_6)+gu7.pl0_7)+gu7.pl0_8)+gu7.pl0_9)+gu7.pl0_10)+gu7.pl0_11)+gu7.pl0_12)+gu7.pl0_13)+gu7.pl0_14)+gu7.pl0_15)+gu7.pl0_16)+gu7.pl0_17)+gu7.pl0_18)+gu7.pl0_19)+gu7.pl0_20)+gu7.pl0_21))")
Reverse transition relation is NOT exact ! Due to transitions gu7.t920, gu7.t921, gu7.t922, gu7.t923, gu7.t924, gu7.t925, gu7.t926, gu7.t927, gu7.t928, gu7.t929, gu7.t930, gu7.t931, gu7.t932, gu7.t933, gu7.t934, gu7.t935, gu7.t936, gu7.t937, gu7.t938, gu7.t939, gu7.t940, gu7.t941, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/111/22/133
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4604968027457282711
[2021-05-10 19:32:59] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4604968027457282711
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4604968027457282711]
Compilation finished in 595 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4604968027457282711]
Link finished in 41 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4604968027457282711]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-01 finished in 47640 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0) U (p1||(p2 U (p3||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 55 out of 1041 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1041/1041 places, 1052/1052 transitions.
Graph (complete) has 1381 edges and 1041 vertex of which 1037 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 530 transitions
Trivial Post-agglo rules discarded 530 transitions
Performed 530 trivial Post agglomeration. Transition count delta: 530
Iterating post reduction 0 with 530 rules applied. Total rules applied 531 place count 1036 transition count 521
Reduce places removed 530 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 565 rules applied. Total rules applied 1096 place count 506 transition count 486
Reduce places removed 23 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 34 rules applied. Total rules applied 1130 place count 483 transition count 475
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1141 place count 472 transition count 475
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 154 Pre rules applied. Total rules applied 1141 place count 472 transition count 321
Deduced a syphon composed of 154 places in 1 ms
Ensure Unique test removed 55 places
Reduce places removed 209 places and 0 transitions.
Iterating global reduction 4 with 363 rules applied. Total rules applied 1504 place count 263 transition count 321
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 22 rules applied. Total rules applied 1526 place count 263 transition count 299
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1548 place count 241 transition count 299
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1548 place count 241 transition count 288
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1570 place count 230 transition count 288
Discarding 26 places :
Symmetric choice reduction at 6 with 26 rule applications. Total rules 1596 place count 204 transition count 232
Iterating global reduction 6 with 26 rules applied. Total rules applied 1622 place count 204 transition count 232
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1633 place count 204 transition count 221
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1633 place count 204 transition count 210
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1655 place count 193 transition count 210
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1666 place count 182 transition count 199
Iterating global reduction 7 with 11 rules applied. Total rules applied 1677 place count 182 transition count 199
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 22 rules applied. Total rules applied 1699 place count 182 transition count 177
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1710 place count 171 transition count 177
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 1756 place count 148 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1757 place count 147 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1758 place count 146 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1759 place count 145 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1760 place count 144 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1761 place count 143 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1762 place count 142 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1763 place count 141 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1764 place count 140 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1765 place count 139 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1766 place count 138 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1767 place count 137 transition count 143
Applied a total of 1767 rules in 113 ms. Remains 137 /1041 variables (removed 904) and now considering 143/1052 (removed 909) transitions.
// Phase 1: matrix 143 rows 137 cols
[2021-05-10 19:33:15] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-10 19:33:15] [INFO ] Implicit Places using invariants in 65 ms returned [46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 124, 136]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 65 ms to find 13 implicit places.
[2021-05-10 19:33:15] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 143 rows 124 cols
[2021-05-10 19:33:15] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 19:33:15] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Starting structural reductions, iteration 1 : 124/1041 places, 143/1052 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 124 transition count 132
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 113 transition count 132
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 102 transition count 121
Applied a total of 44 rules in 4 ms. Remains 102 /124 variables (removed 22) and now considering 121/143 (removed 22) transitions.
// Phase 1: matrix 121 rows 102 cols
[2021-05-10 19:33:15] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 19:33:15] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 121 rows 102 cols
[2021-05-10 19:33:15] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-10 19:33:15] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 102/1041 places, 121/1052 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p0), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-02 automaton TGBA [mat=[[{ cond=(OR p1 p3 p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GT 3 (ADD s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67)), p3:(AND (GT (ADD s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67) (ADD s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101)) (GT 1 (ADD s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78))), p2:(GT 1 (ADD s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78)), p0:(AND (LEQ 2 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)) (OR (GT 1 (ADD s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78)) (LEQ 3 (ADD s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 52 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-02 finished in 509 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U X(p1))||X((!p0&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 77 out of 1041 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1041/1041 places, 1052/1052 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1037 transition count 1052
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 61 place count 980 transition count 985
Iterating global reduction 1 with 57 rules applied. Total rules applied 118 place count 980 transition count 985
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 129 place count 980 transition count 974
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 151 place count 958 transition count 942
Iterating global reduction 2 with 22 rules applied. Total rules applied 173 place count 958 transition count 942
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 195 place count 936 transition count 910
Iterating global reduction 2 with 22 rules applied. Total rules applied 217 place count 936 transition count 910
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 249 place count 904 transition count 878
Iterating global reduction 2 with 32 rules applied. Total rules applied 281 place count 904 transition count 878
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 292 place count 904 transition count 867
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 313 place count 883 transition count 846
Iterating global reduction 3 with 21 rules applied. Total rules applied 334 place count 883 transition count 846
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 344 place count 873 transition count 836
Iterating global reduction 3 with 10 rules applied. Total rules applied 354 place count 873 transition count 836
Applied a total of 354 rules in 157 ms. Remains 873 /1041 variables (removed 168) and now considering 836/1052 (removed 216) transitions.
// Phase 1: matrix 836 rows 873 cols
[2021-05-10 19:33:15] [INFO ] Computed 70 place invariants in 6 ms
[2021-05-10 19:33:15] [INFO ] Implicit Places using invariants in 201 ms returned [187, 441]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 202 ms to find 2 implicit places.
// Phase 1: matrix 836 rows 871 cols
[2021-05-10 19:33:15] [INFO ] Computed 68 place invariants in 9 ms
[2021-05-10 19:33:16] [INFO ] Dead Transitions using invariants and state equation in 347 ms returned []
Starting structural reductions, iteration 1 : 871/1041 places, 836/1052 transitions.
Applied a total of 0 rules in 20 ms. Remains 871 /871 variables (removed 0) and now considering 836/836 (removed 0) transitions.
// Phase 1: matrix 836 rows 871 cols
[2021-05-10 19:33:16] [INFO ] Computed 68 place invariants in 6 ms
[2021-05-10 19:33:16] [INFO ] Dead Transitions using invariants and state equation in 357 ms returned []
Finished structural reductions, in 2 iterations. Remains : 871/1041 places, 836/1052 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}], [{ cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}]], initial=1, aps=[p0:(LEQ 3 (ADD s750 s751 s752 s753 s754 s755 s756 s757 s758 s759 s760 s761 s762 s763 s764 s765 s766 s767 s768 s769 s770 s771)), p1:(LEQ (ADD s333 s334 s335 s336 s337 s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354) (ADD s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414)), p2:(LEQ 1 (ADD s671 s672 s673 s674 s675 s676 s677 s678 s679 s680 s681 s682 s683 s684 s685 s686 s687 s688 s689 s690 s691 s692))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 765 ms.
Product exploration explored 100000 steps with 50000 reset in 762 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 871 transition count 836
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G p1)), (F (G (NOT p2))), (NOT p0), p1, (NOT p2)]
Stuttering acceptance computed with spot in 170 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 845 ms.
Product exploration explored 100000 steps with 50000 reset in 870 ms.
Applying partial POR strategy [true, false, false, true, true, true, false, true]
Stuttering acceptance computed with spot in 189 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1)]
Support contains 77 out of 871 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 871/871 places, 836/836 transitions.
Performed 245 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 871 transition count 836
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 247 place count 871 transition count 835
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 311 Pre rules applied. Total rules applied 247 place count 871 transition count 1000
Deduced a syphon composed of 557 places in 0 ms
Iterating global reduction 2 with 311 rules applied. Total rules applied 558 place count 871 transition count 1000
Discarding 312 places :
Symmetric choice reduction at 2 with 312 rule applications. Total rules 870 place count 559 transition count 688
Deduced a syphon composed of 245 places in 0 ms
Iterating global reduction 2 with 312 rules applied. Total rules applied 1182 place count 559 transition count 688
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 302 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 1239 place count 559 transition count 688
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1275 place count 523 transition count 652
Deduced a syphon composed of 266 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 1311 place count 523 transition count 652
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 277 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1322 place count 523 transition count 674
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1333 place count 512 transition count 652
Deduced a syphon composed of 266 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1344 place count 512 transition count 652
Deduced a syphon composed of 266 places in 0 ms
Applied a total of 1344 rules in 111 ms. Remains 512 /871 variables (removed 359) and now considering 652/836 (removed 184) transitions.
[2021-05-10 19:33:21] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 652 rows 512 cols
[2021-05-10 19:33:21] [INFO ] Computed 68 place invariants in 5 ms
[2021-05-10 19:33:21] [INFO ] Dead Transitions using invariants and state equation in 312 ms returned []
Finished structural reductions, in 1 iterations. Remains : 512/871 places, 652/836 transitions.
Product exploration explored 100000 steps with 50000 reset in 2977 ms.
Product exploration explored 100000 steps with 50000 reset in 2945 ms.
[2021-05-10 19:33:27] [INFO ] Flatten gal took : 47 ms
[2021-05-10 19:33:27] [INFO ] Flatten gal took : 30 ms
[2021-05-10 19:33:27] [INFO ] Time to serialize gal into /tmp/LTL15279230422326200107.gal : 3 ms
[2021-05-10 19:33:27] [INFO ] Time to serialize properties into /tmp/LTL4703442340910082794.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15279230422326200107.gal, -t, CGAL, -LTL, /tmp/LTL4703442340910082794.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15279230422326200107.gal -t CGAL -LTL /tmp/LTL4703442340910082794.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((((((((((((((((((((((pl1_0+pl1_1)+pl1_2)+pl1_3)+pl1_4)+pl1_5)+pl1_6)+pl1_7)+pl1_8)+pl1_9)+pl1_10)+pl1_11)+pl1_12)+pl1_13)+pl1_14)+pl1_15)+pl1_16)+pl1_17)+pl1_18)+pl1_19)+pl1_20)+pl1_21)>=3)")U(X("((((((((((((((((((((((ml2_0+ml2_1)+ml2_2)+ml2_3)+ml2_4)+ml2_5)+ml2_6)+ml2_7)+ml2_8)+ml2_9)+ml2_10)+ml2_11)+ml2_12)+ml2_13)+ml2_14)+ml2_15)+ml2_16)+ml2_17)+ml2_18)+ml2_19)+ml2_20)+ml2_21)<=((((((((((l8_0+l8_1)+l8_2)+l8_3)+l8_4)+l8_5)+l8_6)+l8_7)+l8_8)+l8_9)+l8_10))")))||(X(("((((((((((((((((((((((pl1_0+pl1_1)+pl1_2)+pl1_3)+pl1_4)+pl1_5)+pl1_6)+pl1_7)+pl1_8)+pl1_9)+pl1_10)+pl1_11)+pl1_12)+pl1_13)+pl1_14)+pl1_15)+pl1_16)+pl1_17)+pl1_18)+pl1_19)+pl1_20)+pl1_21)<3)")&&(G("((((((((((((((((((((((p6_0+p6_1)+p6_2)+p6_3)+p6_4)+p6_5)+p6_6)+p6_7)+p6_8)+p6_9)+p6_10)+p6_11)+p6_12)+p6_13)+p6_14)+p6_15)+p6_16)+p6_17)+p6_18)+p6_19)+p6_20)+p6_21)>=1)"))))))
Formula 0 simplified : !(("((((((((((((((((((((((pl1_0+pl1_1)+pl1_2)+pl1_3)+pl1_4)+pl1_5)+pl1_6)+pl1_7)+pl1_8)+pl1_9)+pl1_10)+pl1_11)+pl1_12)+pl1_13)+pl1_14)+pl1_15)+pl1_16)+pl1_17)+pl1_18)+pl1_19)+pl1_20)+pl1_21)>=3)" U X"((((((((((((((((((((((ml2_0+ml2_1)+ml2_2)+ml2_3)+ml2_4)+ml2_5)+ml2_6)+ml2_7)+ml2_8)+ml2_9)+ml2_10)+ml2_11)+ml2_12)+ml2_13)+ml2_14)+ml2_15)+ml2_16)+ml2_17)+ml2_18)+ml2_19)+ml2_20)+ml2_21)<=((((((((((l8_0+l8_1)+l8_2)+l8_3)+l8_4)+l8_5)+l8_6)+l8_7)+l8_8)+l8_9)+l8_10))") | X("((((((((((((((((((((((pl1_0+pl1_1)+pl1_2)+pl1_3)+pl1_4)+pl1_5)+pl1_6)+pl1_7)+pl1_8)+pl1_9)+pl1_10)+pl1_11)+pl1_12)+pl1_13)+pl1_14)+pl1_15)+pl1_16)+pl1_17)+pl1_18)+pl1_19)+pl1_20)+pl1_21)<3)" & G"((((((((((((((((((((((p6_0+p6_1)+p6_2)+p6_3)+p6_4)+p6_5)+p6_6)+p6_7)+p6_8)+p6_9)+p6_10)+p6_11)+p6_12)+p6_13)+p6_14)+p6_15)+p6_16)+p6_17)+p6_18)+p6_19)+p6_20)+p6_21)>=1)"))
Detected timeout of ITS tools.
[2021-05-10 19:33:42] [INFO ] Flatten gal took : 32 ms
[2021-05-10 19:33:42] [INFO ] Applying decomposition
[2021-05-10 19:33:42] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9466814255909272964.txt, -o, /tmp/graph9466814255909272964.bin, -w, /tmp/graph9466814255909272964.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9466814255909272964.bin, -l, -1, -v, -w, /tmp/graph9466814255909272964.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:33:42] [INFO ] Decomposing Gal with order
[2021-05-10 19:33:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:33:42] [INFO ] Removed a total of 57 redundant transitions.
[2021-05-10 19:33:42] [INFO ] Flatten gal took : 79 ms
[2021-05-10 19:33:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 9 ms.
[2021-05-10 19:33:42] [INFO ] Time to serialize gal into /tmp/LTL12946786856269808059.gal : 8 ms
[2021-05-10 19:33:42] [INFO ] Time to serialize properties into /tmp/LTL5141292587870309218.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12946786856269808059.gal, -t, CGAL, -LTL, /tmp/LTL5141292587870309218.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12946786856269808059.gal -t CGAL -LTL /tmp/LTL5141292587870309218.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((((((((((((((((((((((gu294.pl1_0+gu294.pl1_1)+gu294.pl1_2)+gu294.pl1_3)+gu294.pl1_4)+gu294.pl1_5)+gu294.pl1_6)+gu294.pl1_7)+gu294.pl1_8)+gu294.pl1_9)+gu294.pl1_10)+gu294.pl1_11)+gu294.pl1_12)+gu294.pl1_13)+gu294.pl1_14)+gu294.pl1_15)+gu294.pl1_16)+gu294.pl1_17)+gu294.pl1_18)+gu294.pl1_19)+gu294.pl1_20)+gu294.pl1_21)>=3)")U(X("((((((((((((((((((((((gu150.ml2_0+gu150.ml2_1)+gu150.ml2_2)+gu150.ml2_3)+gu150.ml2_4)+gu150.ml2_5)+gu150.ml2_6)+gu150.ml2_7)+gu150.ml2_8)+gu150.ml2_9)+gu150.ml2_10)+gu150.ml2_11)+gu150.ml2_12)+gu150.ml2_13)+gu150.ml2_14)+gu150.ml2_15)+gu150.ml2_16)+gu150.ml2_17)+gu150.ml2_18)+gu150.ml2_19)+gu150.ml2_20)+gu150.ml2_21)<=((((((((((gu150.l8_0+gu150.l8_1)+gu150.l8_2)+gu150.l8_3)+gu150.l8_4)+gu150.l8_5)+gu150.l8_6)+gu150.l8_7)+gu150.l8_8)+gu150.l8_9)+gu150.l8_10))")))||(X(("((((((((((((((((((((((gu294.pl1_0+gu294.pl1_1)+gu294.pl1_2)+gu294.pl1_3)+gu294.pl1_4)+gu294.pl1_5)+gu294.pl1_6)+gu294.pl1_7)+gu294.pl1_8)+gu294.pl1_9)+gu294.pl1_10)+gu294.pl1_11)+gu294.pl1_12)+gu294.pl1_13)+gu294.pl1_14)+gu294.pl1_15)+gu294.pl1_16)+gu294.pl1_17)+gu294.pl1_18)+gu294.pl1_19)+gu294.pl1_20)+gu294.pl1_21)<3)")&&(G("((((((((((((((((((((((gi35.gu279.p6_0+gi35.gu279.p6_1)+gi35.gu279.p6_2)+gi35.gu279.p6_3)+gi35.gu279.p6_4)+gi35.gu279.p6_5)+gi35.gu279.p6_6)+gi35.gu279.p6_7)+gi35.gu279.p6_8)+gi35.gu279.p6_9)+gi35.gu279.p6_10)+gi35.gu279.p6_11)+gi35.gu279.p6_12)+gi35.gu279.p6_13)+gi35.gu279.p6_14)+gi35.gu279.p6_15)+gi35.gu279.p6_16)+gi35.gu279.p6_17)+gi35.gu279.p6_18)+gi35.gu279.p6_19)+gi35.gu279.p6_20)+gi35.gu279.p6_21)>=1)"))))))
Formula 0 simplified : !(("((((((((((((((((((((((gu294.pl1_0+gu294.pl1_1)+gu294.pl1_2)+gu294.pl1_3)+gu294.pl1_4)+gu294.pl1_5)+gu294.pl1_6)+gu294.pl1_7)+gu294.pl1_8)+gu294.pl1_9)+gu294.pl1_10)+gu294.pl1_11)+gu294.pl1_12)+gu294.pl1_13)+gu294.pl1_14)+gu294.pl1_15)+gu294.pl1_16)+gu294.pl1_17)+gu294.pl1_18)+gu294.pl1_19)+gu294.pl1_20)+gu294.pl1_21)>=3)" U X"((((((((((((((((((((((gu150.ml2_0+gu150.ml2_1)+gu150.ml2_2)+gu150.ml2_3)+gu150.ml2_4)+gu150.ml2_5)+gu150.ml2_6)+gu150.ml2_7)+gu150.ml2_8)+gu150.ml2_9)+gu150.ml2_10)+gu150.ml2_11)+gu150.ml2_12)+gu150.ml2_13)+gu150.ml2_14)+gu150.ml2_15)+gu150.ml2_16)+gu150.ml2_17)+gu150.ml2_18)+gu150.ml2_19)+gu150.ml2_20)+gu150.ml2_21)<=((((((((((gu150.l8_0+gu150.l8_1)+gu150.l8_2)+gu150.l8_3)+gu150.l8_4)+gu150.l8_5)+gu150.l8_6)+gu150.l8_7)+gu150.l8_8)+gu150.l8_9)+gu150.l8_10))") | X("((((((((((((((((((((((gu294.pl1_0+gu294.pl1_1)+gu294.pl1_2)+gu294.pl1_3)+gu294.pl1_4)+gu294.pl1_5)+gu294.pl1_6)+gu294.pl1_7)+gu294.pl1_8)+gu294.pl1_9)+gu294.pl1_10)+gu294.pl1_11)+gu294.pl1_12)+gu294.pl1_13)+gu294.pl1_14)+gu294.pl1_15)+gu294.pl1_16)+gu294.pl1_17)+gu294.pl1_18)+gu294.pl1_19)+gu294.pl1_20)+gu294.pl1_21)<3)" & G"((((((((((((((((((((((gi35.gu279.p6_0+gi35.gu279.p6_1)+gi35.gu279.p6_2)+gi35.gu279.p6_3)+gi35.gu279.p6_4)+gi35.gu279.p6_5)+gi35.gu279.p6_6)+gi35.gu279.p6_7)+gi35.gu279.p6_8)+gi35.gu279.p6_9)+gi35.gu279.p6_10)+gi35.gu279.p6_11)+gi35.gu279.p6_12)+gi35.gu279.p6_13)+gi35.gu279.p6_14)+gi35.gu279.p6_15)+gi35.gu279.p6_16)+gi35.gu279.p6_17)+gi35.gu279.p6_18)+gi35.gu279.p6_19)+gi35.gu279.p6_20)+gi35.gu279.p6_21)>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7947518101678169393
[2021-05-10 19:33:57] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7947518101678169393
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7947518101678169393]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7947518101678169393] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7947518101678169393] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-03 finished in 43469 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 44 out of 1041 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1041/1041 places, 1052/1052 transitions.
Graph (complete) has 1381 edges and 1041 vertex of which 1037 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 519 transitions
Trivial Post-agglo rules discarded 519 transitions
Performed 519 trivial Post agglomeration. Transition count delta: 519
Iterating post reduction 0 with 519 rules applied. Total rules applied 520 place count 1036 transition count 532
Reduce places removed 519 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 554 rules applied. Total rules applied 1074 place count 517 transition count 497
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 1097 place count 494 transition count 497
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 1097 place count 494 transition count 343
Deduced a syphon composed of 154 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 209 places and 0 transitions.
Iterating global reduction 3 with 363 rules applied. Total rules applied 1460 place count 285 transition count 343
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 1482 place count 285 transition count 321
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1504 place count 263 transition count 321
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1504 place count 263 transition count 310
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1526 place count 252 transition count 310
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 1562 place count 216 transition count 254
Iterating global reduction 5 with 36 rules applied. Total rules applied 1598 place count 216 transition count 254
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 22 Pre rules applied. Total rules applied 1598 place count 216 transition count 232
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 1642 place count 194 transition count 232
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1654 place count 182 transition count 210
Iterating global reduction 5 with 12 rules applied. Total rules applied 1666 place count 182 transition count 210
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 33 rules applied. Total rules applied 1699 place count 182 transition count 177
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1710 place count 171 transition count 177
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 1778 place count 137 transition count 143
Applied a total of 1778 rules in 37 ms. Remains 137 /1041 variables (removed 904) and now considering 143/1052 (removed 909) transitions.
// Phase 1: matrix 143 rows 137 cols
[2021-05-10 19:33:58] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-10 19:33:59] [INFO ] Implicit Places using invariants in 56 ms returned [22, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 136]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 56 ms to find 13 implicit places.
[2021-05-10 19:33:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 143 rows 124 cols
[2021-05-10 19:33:59] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 19:33:59] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Starting structural reductions, iteration 1 : 124/1041 places, 143/1052 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 124 transition count 132
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 113 transition count 132
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 113 transition count 121
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 102 transition count 121
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 54 place count 92 transition count 111
Iterating global reduction 2 with 10 rules applied. Total rules applied 64 place count 92 transition count 111
Applied a total of 64 rules in 5 ms. Remains 92 /124 variables (removed 32) and now considering 111/143 (removed 32) transitions.
// Phase 1: matrix 111 rows 92 cols
[2021-05-10 19:33:59] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 19:33:59] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 111 rows 92 cols
[2021-05-10 19:33:59] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 19:33:59] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 92/1041 places, 111/1052 transitions.
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55) (ADD s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-04 finished in 318 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 55 out of 1041 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1041/1041 places, 1052/1052 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1037 transition count 1052
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 61 place count 980 transition count 985
Iterating global reduction 1 with 57 rules applied. Total rules applied 118 place count 980 transition count 985
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 129 place count 980 transition count 974
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 140 place count 969 transition count 953
Iterating global reduction 2 with 11 rules applied. Total rules applied 151 place count 969 transition count 953
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 172 place count 948 transition count 932
Iterating global reduction 2 with 21 rules applied. Total rules applied 193 place count 948 transition count 932
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 214 place count 927 transition count 911
Iterating global reduction 2 with 21 rules applied. Total rules applied 235 place count 927 transition count 911
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 256 place count 906 transition count 890
Iterating global reduction 2 with 21 rules applied. Total rules applied 277 place count 906 transition count 890
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 298 place count 885 transition count 869
Iterating global reduction 2 with 21 rules applied. Total rules applied 319 place count 885 transition count 869
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 330 place count 874 transition count 858
Iterating global reduction 2 with 11 rules applied. Total rules applied 341 place count 874 transition count 858
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 352 place count 863 transition count 847
Iterating global reduction 2 with 11 rules applied. Total rules applied 363 place count 863 transition count 847
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 374 place count 852 transition count 836
Iterating global reduction 2 with 11 rules applied. Total rules applied 385 place count 852 transition count 836
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 396 place count 841 transition count 825
Iterating global reduction 2 with 11 rules applied. Total rules applied 407 place count 841 transition count 825
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 418 place count 830 transition count 814
Iterating global reduction 2 with 11 rules applied. Total rules applied 429 place count 830 transition count 814
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 440 place count 819 transition count 803
Iterating global reduction 2 with 11 rules applied. Total rules applied 451 place count 819 transition count 803
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 462 place count 808 transition count 792
Iterating global reduction 2 with 11 rules applied. Total rules applied 473 place count 808 transition count 792
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 484 place count 797 transition count 781
Iterating global reduction 2 with 11 rules applied. Total rules applied 495 place count 797 transition count 781
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 506 place count 786 transition count 770
Iterating global reduction 2 with 11 rules applied. Total rules applied 517 place count 786 transition count 770
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 528 place count 786 transition count 759
Applied a total of 528 rules in 353 ms. Remains 786 /1041 variables (removed 255) and now considering 759/1052 (removed 293) transitions.
// Phase 1: matrix 759 rows 786 cols
[2021-05-10 19:33:59] [INFO ] Computed 70 place invariants in 4 ms
[2021-05-10 19:33:59] [INFO ] Implicit Places using invariants in 134 ms returned [354]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
// Phase 1: matrix 759 rows 785 cols
[2021-05-10 19:33:59] [INFO ] Computed 69 place invariants in 5 ms
[2021-05-10 19:34:00] [INFO ] Dead Transitions using invariants and state equation in 343 ms returned []
Starting structural reductions, iteration 1 : 785/1041 places, 759/1052 transitions.
Applied a total of 0 rules in 23 ms. Remains 785 /785 variables (removed 0) and now considering 759/759 (removed 0) transitions.
// Phase 1: matrix 759 rows 785 cols
[2021-05-10 19:34:00] [INFO ] Computed 69 place invariants in 4 ms
[2021-05-10 19:34:00] [INFO ] Dead Transitions using invariants and state equation in 322 ms returned []
Finished structural reductions, in 2 iterations. Remains : 785/1041 places, 759/1052 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT (ADD s664 s665 s666 s667 s668 s669 s670 s671 s672 s673 s674 s675 s676 s677 s678 s679 s680 s681 s682 s683 s684 s685) (ADD s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153)) (GT 3 (ADD s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-08 finished in 1248 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p1||G(p2))&&p0)))], workingDir=/home/mcc/execution]
Support contains 37 out of 1041 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1041/1041 places, 1052/1052 transitions.
Graph (complete) has 1381 edges and 1041 vertex of which 1039 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 541 transitions
Trivial Post-agglo rules discarded 541 transitions
Performed 541 trivial Post agglomeration. Transition count delta: 541
Iterating post reduction 0 with 541 rules applied. Total rules applied 542 place count 1038 transition count 510
Reduce places removed 541 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 576 rules applied. Total rules applied 1118 place count 497 transition count 475
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 1141 place count 474 transition count 475
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 142 Pre rules applied. Total rules applied 1141 place count 474 transition count 333
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 33 places
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 317 rules applied. Total rules applied 1458 place count 299 transition count 333
Discarding 22 places :
Implicit places reduction removed 22 places
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 3 with 44 rules applied. Total rules applied 1502 place count 277 transition count 311
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1524 place count 255 transition count 311
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1524 place count 255 transition count 300
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1546 place count 244 transition count 300
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1570 place count 220 transition count 256
Iterating global reduction 5 with 24 rules applied. Total rules applied 1594 place count 220 transition count 256
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1605 place count 220 transition count 245
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 1605 place count 220 transition count 223
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1649 place count 198 transition count 223
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1661 place count 186 transition count 201
Iterating global reduction 6 with 12 rules applied. Total rules applied 1673 place count 186 transition count 201
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 22 rules applied. Total rules applied 1695 place count 186 transition count 179
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1706 place count 175 transition count 179
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 1774 place count 141 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1775 place count 140 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1776 place count 139 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1777 place count 138 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1778 place count 137 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1779 place count 136 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1780 place count 135 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1781 place count 134 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1782 place count 133 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1783 place count 132 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1784 place count 131 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1785 place count 130 transition count 134
Applied a total of 1785 rules in 65 ms. Remains 130 /1041 variables (removed 911) and now considering 134/1052 (removed 918) transitions.
// Phase 1: matrix 134 rows 130 cols
[2021-05-10 19:34:00] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-10 19:34:00] [INFO ] Implicit Places using invariants in 70 ms returned [11, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 69, 129]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 72 ms to find 14 implicit places.
[2021-05-10 19:34:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 134 rows 116 cols
[2021-05-10 19:34:00] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 19:34:00] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Starting structural reductions, iteration 1 : 116/1041 places, 134/1052 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 116 transition count 123
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 105 transition count 123
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 105 transition count 112
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 94 transition count 112
Applied a total of 44 rules in 4 ms. Remains 94 /116 variables (removed 22) and now considering 112/134 (removed 22) transitions.
// Phase 1: matrix 112 rows 94 cols
[2021-05-10 19:34:00] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 19:34:00] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 112 rows 94 cols
[2021-05-10 19:34:00] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 19:34:00] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 94/1041 places, 112/1052 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-09 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GT (ADD s0 s1) (ADD s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23)) (GT 2 (ADD s81 s82))), p1:(GT 2 (ADD s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78)), p2:(LEQ 2 (ADD s81 s82))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-09 finished in 371 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 55 out of 1041 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1041/1041 places, 1052/1052 transitions.
Graph (complete) has 1381 edges and 1041 vertex of which 1037 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 508 transitions
Trivial Post-agglo rules discarded 508 transitions
Performed 508 trivial Post agglomeration. Transition count delta: 508
Iterating post reduction 0 with 508 rules applied. Total rules applied 509 place count 1036 transition count 543
Reduce places removed 508 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 543 rules applied. Total rules applied 1052 place count 528 transition count 508
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 1075 place count 505 transition count 508
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 143 Pre rules applied. Total rules applied 1075 place count 505 transition count 365
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 341 rules applied. Total rules applied 1416 place count 307 transition count 365
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 1438 place count 307 transition count 343
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1460 place count 285 transition count 343
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1460 place count 285 transition count 332
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1482 place count 274 transition count 332
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1519 place count 237 transition count 265
Iterating global reduction 5 with 37 rules applied. Total rules applied 1556 place count 237 transition count 265
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1556 place count 237 transition count 254
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1578 place count 226 transition count 254
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 1600 place count 204 transition count 232
Iterating global reduction 5 with 22 rules applied. Total rules applied 1622 place count 204 transition count 232
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 22 rules applied. Total rules applied 1644 place count 204 transition count 210
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1655 place count 193 transition count 210
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1656 place count 192 transition count 199
Iterating global reduction 7 with 1 rules applied. Total rules applied 1657 place count 192 transition count 199
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 22 rules applied. Total rules applied 1679 place count 192 transition count 177
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1690 place count 181 transition count 177
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1714 place count 169 transition count 165
Applied a total of 1714 rules in 38 ms. Remains 169 /1041 variables (removed 872) and now considering 165/1052 (removed 887) transitions.
// Phase 1: matrix 165 rows 169 cols
[2021-05-10 19:34:00] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-10 19:34:00] [INFO ] Implicit Places using invariants in 64 ms returned [44, 156, 168]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
[2021-05-10 19:34:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 165 rows 166 cols
[2021-05-10 19:34:00] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-10 19:34:01] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Starting structural reductions, iteration 1 : 166/1041 places, 165/1052 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 166 transition count 154
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 155 transition count 154
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 22 place count 155 transition count 132
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 66 place count 133 transition count 132
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 77 place count 122 transition count 132
Applied a total of 77 rules in 4 ms. Remains 122 /166 variables (removed 44) and now considering 132/165 (removed 33) transitions.
// Phase 1: matrix 132 rows 122 cols
[2021-05-10 19:34:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 19:34:01] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 132 rows 122 cols
[2021-05-10 19:34:01] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 19:34:01] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 122/1041 places, 132/1052 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT (ADD s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110) (ADD s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43)), p1:(AND (GT (ADD s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21)) (GT (ADD s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110) (ADD s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-10 finished in 392 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 33 out of 1041 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1041/1041 places, 1052/1052 transitions.
Graph (complete) has 1381 edges and 1041 vertex of which 1037 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 552 transitions
Trivial Post-agglo rules discarded 552 transitions
Performed 552 trivial Post agglomeration. Transition count delta: 552
Iterating post reduction 0 with 552 rules applied. Total rules applied 553 place count 1036 transition count 499
Reduce places removed 552 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 587 rules applied. Total rules applied 1140 place count 484 transition count 464
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 1163 place count 461 transition count 464
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 1163 place count 461 transition count 332
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 33 places
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 297 rules applied. Total rules applied 1460 place count 296 transition count 332
Discarding 22 places :
Implicit places reduction removed 22 places
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 3 with 44 rules applied. Total rules applied 1504 place count 274 transition count 310
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1526 place count 252 transition count 310
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1526 place count 252 transition count 299
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1548 place count 241 transition count 299
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1585 place count 204 transition count 232
Iterating global reduction 5 with 37 rules applied. Total rules applied 1622 place count 204 transition count 232
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1633 place count 204 transition count 221
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 1633 place count 204 transition count 199
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1677 place count 182 transition count 199
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1689 place count 170 transition count 177
Iterating global reduction 6 with 12 rules applied. Total rules applied 1701 place count 170 transition count 177
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 22 rules applied. Total rules applied 1723 place count 170 transition count 155
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1734 place count 159 transition count 155
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 1780 place count 136 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1781 place count 135 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1782 place count 134 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1783 place count 133 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1784 place count 132 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1785 place count 131 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1786 place count 130 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1787 place count 129 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1788 place count 128 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1789 place count 127 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1790 place count 126 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1791 place count 125 transition count 121
Applied a total of 1791 rules in 48 ms. Remains 125 /1041 variables (removed 916) and now considering 121/1052 (removed 931) transitions.
// Phase 1: matrix 121 rows 125 cols
[2021-05-10 19:34:01] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-10 19:34:01] [INFO ] Implicit Places using invariants in 62 ms returned [11, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 46, 124]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 63 ms to find 14 implicit places.
[2021-05-10 19:34:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 121 rows 111 cols
[2021-05-10 19:34:01] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 19:34:01] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Starting structural reductions, iteration 1 : 111/1041 places, 121/1052 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 110 transition count 109
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 99 transition count 109
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 22 place count 99 transition count 88
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 64 place count 78 transition count 88
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 74 place count 68 transition count 78
Iterating global reduction 2 with 10 rules applied. Total rules applied 84 place count 68 transition count 78
Applied a total of 84 rules in 4 ms. Remains 68 /111 variables (removed 43) and now considering 78/121 (removed 43) transitions.
// Phase 1: matrix 78 rows 68 cols
[2021-05-10 19:34:01] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 19:34:01] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 78 rows 68 cols
[2021-05-10 19:34:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 19:34:01] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 68/1041 places, 78/1052 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 3 (ADD s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66)) (GT 2 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2127 reset in 316 ms.
Product exploration explored 100000 steps with 2127 reset in 269 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 78
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-11 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-11 finished in 958 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 57 out of 1041 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1041/1041 places, 1052/1052 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1039 transition count 1052
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 48 place count 993 transition count 996
Iterating global reduction 1 with 46 rules applied. Total rules applied 94 place count 993 transition count 996
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 106 place count 981 transition count 964
Iterating global reduction 1 with 12 rules applied. Total rules applied 118 place count 981 transition count 964
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 150 place count 949 transition count 932
Iterating global reduction 1 with 32 rules applied. Total rules applied 182 place count 949 transition count 932
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 203 place count 928 transition count 911
Iterating global reduction 1 with 21 rules applied. Total rules applied 224 place count 928 transition count 911
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 234 place count 918 transition count 901
Iterating global reduction 1 with 10 rules applied. Total rules applied 244 place count 918 transition count 901
Applied a total of 244 rules in 125 ms. Remains 918 /1041 variables (removed 123) and now considering 901/1052 (removed 151) transitions.
// Phase 1: matrix 901 rows 918 cols
[2021-05-10 19:34:02] [INFO ] Computed 71 place invariants in 5 ms
[2021-05-10 19:34:02] [INFO ] Implicit Places using invariants in 181 ms returned [507, 785]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 182 ms to find 2 implicit places.
// Phase 1: matrix 901 rows 916 cols
[2021-05-10 19:34:02] [INFO ] Computed 69 place invariants in 4 ms
[2021-05-10 19:34:02] [INFO ] Dead Transitions using invariants and state equation in 442 ms returned []
Starting structural reductions, iteration 1 : 916/1041 places, 901/1052 transitions.
Applied a total of 0 rules in 25 ms. Remains 916 /916 variables (removed 0) and now considering 901/901 (removed 0) transitions.
// Phase 1: matrix 901 rows 916 cols
[2021-05-10 19:34:03] [INFO ] Computed 69 place invariants in 6 ms
[2021-05-10 19:34:03] [INFO ] Dead Transitions using invariants and state equation in 454 ms returned []
Finished structural reductions, in 2 iterations. Remains : 916/1041 places, 901/1052 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ 3 (ADD s595 s596)) (OR (LEQ 3 (ADD s332 s333 s334 s335 s336 s337 s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353)) (LEQ (ADD s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43) (ADD s423 s424 s425 s426 s427 s428 s429 s430 s431 s432 s433 s434 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 395 reset in 204 ms.
Product exploration explored 100000 steps with 395 reset in 250 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 916 transition count 901
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 393 reset in 188 ms.
Product exploration explored 100000 steps with 393 reset in 203 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Support contains 57 out of 916 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 916/916 places, 901/901 transitions.
Performed 267 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 267 rules applied. Total rules applied 267 place count 916 transition count 901
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 269 place count 916 transition count 900
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 311 Pre rules applied. Total rules applied 269 place count 916 transition count 1065
Deduced a syphon composed of 579 places in 0 ms
Iterating global reduction 2 with 311 rules applied. Total rules applied 580 place count 916 transition count 1065
Discarding 336 places :
Symmetric choice reduction at 2 with 336 rule applications. Total rules 916 place count 580 transition count 729
Deduced a syphon composed of 243 places in 0 ms
Iterating global reduction 2 with 336 rules applied. Total rules applied 1252 place count 580 transition count 729
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 310 places in 0 ms
Iterating global reduction 2 with 67 rules applied. Total rules applied 1319 place count 580 transition count 740
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 1375 place count 524 transition count 684
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 1431 place count 524 transition count 684
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 276 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 1453 place count 524 transition count 750
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1475 place count 502 transition count 706
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 1497 place count 502 transition count 706
Deduced a syphon composed of 254 places in 0 ms
Applied a total of 1497 rules in 68 ms. Remains 502 /916 variables (removed 414) and now considering 706/901 (removed 195) transitions.
[2021-05-10 19:34:04] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 706 rows 502 cols
[2021-05-10 19:34:04] [INFO ] Computed 69 place invariants in 7 ms
[2021-05-10 19:34:05] [INFO ] Dead Transitions using invariants and state equation in 320 ms returned []
Finished structural reductions, in 1 iterations. Remains : 502/916 places, 706/901 transitions.
Product exploration explored 100000 steps with 3586 reset in 506 ms.
Product exploration explored 100000 steps with 3586 reset in 465 ms.
[2021-05-10 19:34:06] [INFO ] Flatten gal took : 24 ms
[2021-05-10 19:34:06] [INFO ] Flatten gal took : 23 ms
[2021-05-10 19:34:06] [INFO ] Time to serialize gal into /tmp/LTL17367147308226563511.gal : 3 ms
[2021-05-10 19:34:06] [INFO ] Time to serialize properties into /tmp/LTL13050798778033115985.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17367147308226563511.gal, -t, CGAL, -LTL, /tmp/LTL13050798778033115985.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17367147308226563511.gal -t CGAL -LTL /tmp/LTL13050798778033115985.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((c1_0+c1_1)>=3)&&(((((((((((((((((((((((c6_0+c6_1)+c6_2)+c6_3)+c6_4)+c6_5)+c6_6)+c6_7)+c6_8)+c6_9)+c6_10)+c6_11)+c6_12)+c6_13)+c6_14)+c6_15)+c6_16)+c6_17)+c6_18)+c6_19)+c6_20)+c6_21)>=3)||(((((((((((l30_0+l30_1)+l30_2)+l30_3)+l30_4)+l30_5)+l30_6)+l30_7)+l30_8)+l30_9)+l30_10)<=(((((((((((((((((((((lm3_0+lm3_1)+lm3_2)+lm3_3)+lm3_4)+lm3_5)+lm3_6)+lm3_7)+lm3_8)+lm3_9)+lm3_10)+lm3_11)+lm3_12)+lm3_13)+lm3_14)+lm3_15)+lm3_16)+lm3_17)+lm3_18)+lm3_19)+lm3_20)+lm3_21))))"))))
Formula 0 simplified : !XF"(((c1_0+c1_1)>=3)&&(((((((((((((((((((((((c6_0+c6_1)+c6_2)+c6_3)+c6_4)+c6_5)+c6_6)+c6_7)+c6_8)+c6_9)+c6_10)+c6_11)+c6_12)+c6_13)+c6_14)+c6_15)+c6_16)+c6_17)+c6_18)+c6_19)+c6_20)+c6_21)>=3)||(((((((((((l30_0+l30_1)+l30_2)+l30_3)+l30_4)+l30_5)+l30_6)+l30_7)+l30_8)+l30_9)+l30_10)<=(((((((((((((((((((((lm3_0+lm3_1)+lm3_2)+lm3_3)+lm3_4)+lm3_5)+lm3_6)+lm3_7)+lm3_8)+lm3_9)+lm3_10)+lm3_11)+lm3_12)+lm3_13)+lm3_14)+lm3_15)+lm3_16)+lm3_17)+lm3_18)+lm3_19)+lm3_20)+lm3_21))))"
Detected timeout of ITS tools.
[2021-05-10 19:34:21] [INFO ] Flatten gal took : 23 ms
[2021-05-10 19:34:21] [INFO ] Applying decomposition
[2021-05-10 19:34:21] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8583627484383295614.txt, -o, /tmp/graph8583627484383295614.bin, -w, /tmp/graph8583627484383295614.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8583627484383295614.bin, -l, -1, -v, -w, /tmp/graph8583627484383295614.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:34:21] [INFO ] Decomposing Gal with order
[2021-05-10 19:34:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:34:21] [INFO ] Removed a total of 120 redundant transitions.
[2021-05-10 19:34:21] [INFO ] Flatten gal took : 51 ms
[2021-05-10 19:34:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 6 ms.
[2021-05-10 19:34:21] [INFO ] Time to serialize gal into /tmp/LTL4148358591810397172.gal : 6 ms
[2021-05-10 19:34:21] [INFO ] Time to serialize properties into /tmp/LTL2892957749402135570.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4148358591810397172.gal, -t, CGAL, -LTL, /tmp/LTL2892957749402135570.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4148358591810397172.gal -t CGAL -LTL /tmp/LTL2892957749402135570.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((gi14.gi0.gi5.gi1.gu231.c1_0+gi14.gi0.gi5.gi1.gu231.c1_1)>=3)&&(((((((((((((((((((((((gu149.c6_0+gu149.c6_1)+gu149.c6_2)+gu149.c6_3)+gu149.c6_4)+gu149.c6_5)+gu149.c6_6)+gu149.c6_7)+gu149.c6_8)+gu149.c6_9)+gu149.c6_10)+gu149.c6_11)+gu149.c6_12)+gu149.c6_13)+gu149.c6_14)+gu149.c6_15)+gu149.c6_16)+gu149.c6_17)+gu149.c6_18)+gu149.c6_19)+gu149.c6_20)+gu149.c6_21)>=3)||(((((((((((gu20.l30_0+gu20.l30_1)+gu20.l30_2)+gu20.l30_3)+gu20.l30_4)+gu20.l30_5)+gu20.l30_6)+gu20.l30_7)+gu20.l30_8)+gu20.l30_9)+gu20.l30_10)<=(((((((((((((((((((((gu20.lm3_0+gu20.lm3_1)+gu20.lm3_2)+gu20.lm3_3)+gu20.lm3_4)+gu20.lm3_5)+gu20.lm3_6)+gu20.lm3_7)+gu20.lm3_8)+gu20.lm3_9)+gu20.lm3_10)+gu20.lm3_11)+gu20.lm3_12)+gu20.lm3_13)+gu20.lm3_14)+gu20.lm3_15)+gu20.lm3_16)+gu20.lm3_17)+gu20.lm3_18)+gu20.lm3_19)+gu20.lm3_20)+gu20.lm3_21))))"))))
Formula 0 simplified : !XF"(((gi14.gi0.gi5.gi1.gu231.c1_0+gi14.gi0.gi5.gi1.gu231.c1_1)>=3)&&(((((((((((((((((((((((gu149.c6_0+gu149.c6_1)+gu149.c6_2)+gu149.c6_3)+gu149.c6_4)+gu149.c6_5)+gu149.c6_6)+gu149.c6_7)+gu149.c6_8)+gu149.c6_9)+gu149.c6_10)+gu149.c6_11)+gu149.c6_12)+gu149.c6_13)+gu149.c6_14)+gu149.c6_15)+gu149.c6_16)+gu149.c6_17)+gu149.c6_18)+gu149.c6_19)+gu149.c6_20)+gu149.c6_21)>=3)||(((((((((((gu20.l30_0+gu20.l30_1)+gu20.l30_2)+gu20.l30_3)+gu20.l30_4)+gu20.l30_5)+gu20.l30_6)+gu20.l30_7)+gu20.l30_8)+gu20.l30_9)+gu20.l30_10)<=(((((((((((((((((((((gu20.lm3_0+gu20.lm3_1)+gu20.lm3_2)+gu20.lm3_3)+gu20.lm3_4)+gu20.lm3_5)+gu20.lm3_6)+gu20.lm3_7)+gu20.lm3_8)+gu20.lm3_9)+gu20.lm3_10)+gu20.lm3_11)+gu20.lm3_12)+gu20.lm3_13)+gu20.lm3_14)+gu20.lm3_15)+gu20.lm3_16)+gu20.lm3_17)+gu20.lm3_18)+gu20.lm3_19)+gu20.lm3_20)+gu20.lm3_21))))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7077998746642415989
[2021-05-10 19:34:36] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7077998746642415989
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7077998746642415989]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7077998746642415989] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7077998746642415989] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-13 finished in 35405 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 22 out of 1041 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1041/1041 places, 1052/1052 transitions.
Graph (complete) has 1381 edges and 1041 vertex of which 1037 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 519 transitions
Trivial Post-agglo rules discarded 519 transitions
Performed 519 trivial Post agglomeration. Transition count delta: 519
Iterating post reduction 0 with 519 rules applied. Total rules applied 520 place count 1036 transition count 532
Reduce places removed 519 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 554 rules applied. Total rules applied 1074 place count 517 transition count 497
Reduce places removed 23 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 45 rules applied. Total rules applied 1119 place count 494 transition count 475
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1141 place count 472 transition count 475
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 154 Pre rules applied. Total rules applied 1141 place count 472 transition count 321
Deduced a syphon composed of 154 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 209 places and 0 transitions.
Iterating global reduction 4 with 363 rules applied. Total rules applied 1504 place count 263 transition count 321
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 22 rules applied. Total rules applied 1526 place count 263 transition count 299
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1548 place count 241 transition count 299
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1548 place count 241 transition count 288
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1570 place count 230 transition count 288
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 1607 place count 193 transition count 221
Iterating global reduction 6 with 37 rules applied. Total rules applied 1644 place count 193 transition count 221
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 1644 place count 193 transition count 199
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1688 place count 171 transition count 199
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1700 place count 159 transition count 177
Iterating global reduction 6 with 12 rules applied. Total rules applied 1712 place count 159 transition count 177
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 6 with 44 rules applied. Total rules applied 1756 place count 159 transition count 133
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1778 place count 137 transition count 133
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 1824 place count 114 transition count 110
Applied a total of 1824 rules in 24 ms. Remains 114 /1041 variables (removed 927) and now considering 110/1052 (removed 942) transitions.
// Phase 1: matrix 110 rows 114 cols
[2021-05-10 19:34:37] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-10 19:34:37] [INFO ] Implicit Places using invariants in 56 ms returned [22, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 101, 113]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 57 ms to find 14 implicit places.
[2021-05-10 19:34:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 110 rows 100 cols
[2021-05-10 19:34:37] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 19:34:37] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Starting structural reductions, iteration 1 : 100/1041 places, 110/1052 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 100 transition count 88
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 78 transition count 88
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 44 place count 78 transition count 77
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 66 place count 67 transition count 77
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 76 place count 57 transition count 67
Iterating global reduction 2 with 10 rules applied. Total rules applied 86 place count 57 transition count 67
Applied a total of 86 rules in 2 ms. Remains 57 /100 variables (removed 43) and now considering 67/110 (removed 43) transitions.
// Phase 1: matrix 67 rows 57 cols
[2021-05-10 19:34:37] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 19:34:37] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 67 rows 57 cols
[2021-05-10 19:34:37] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-10 19:34:37] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 57/1041 places, 67/1052 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9445 reset in 184 ms.
Product exploration explored 100000 steps with 9477 reset in 202 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 57 transition count 67
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9447 reset in 183 ms.
Product exploration explored 100000 steps with 9538 reset in 201 ms.
[2021-05-10 19:34:38] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:34:38] [INFO ] Flatten gal took : 2 ms
[2021-05-10 19:34:38] [INFO ] Time to serialize gal into /tmp/LTL14204165658844141027.gal : 1 ms
[2021-05-10 19:34:38] [INFO ] Time to serialize properties into /tmp/LTL8305365501204025029.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14204165658844141027.gal, -t, CGAL, -LTL, /tmp/LTL8305365501204025029.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14204165658844141027.gal -t CGAL -LTL /tmp/LTL8305365501204025029.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((((((((((((((((((((((m5_0+m5_1)+m5_2)+m5_3)+m5_4)+m5_5)+m5_6)+m5_7)+m5_8)+m5_9)+m5_10)+m5_11)+m5_12)+m5_13)+m5_14)+m5_15)+m5_16)+m5_17)+m5_18)+m5_19)+m5_20)+m5_21)>=2)")))
Formula 0 simplified : !F"((((((((((((((((((((((m5_0+m5_1)+m5_2)+m5_3)+m5_4)+m5_5)+m5_6)+m5_7)+m5_8)+m5_9)+m5_10)+m5_11)+m5_12)+m5_13)+m5_14)+m5_15)+m5_16)+m5_17)+m5_18)+m5_19)+m5_20)+m5_21)>=2)"
Reverse transition relation is NOT exact ! Due to transitions t385.t407.t462.t495.t517, t396.t418.t473.t506.t528, t386.t408.t463.t496.t518, t397.t419.t474.t507.t529, t387.t409.t464.t497.t519, t398.t420.t475.t508.t530, t388.t410.t465.t498.t520, t399.t421.t476.t509.t531, t389.t411.t466.t499.t521, t400.t422.t477.t510.t532, t390.t412.t467.t500.t522, t401.t423.t478.t511.t533, t391.t413.t468.t501.t523, t402.t424.t479.t512.t534, t392.t414.t469.t502.t524, t403.t425.t480.t513.t535, t393.t415.t470.t503.t525, t404.t426.t481.t514.t536, t394.t416.t471.t504.t526, t405.t427.t482.t515.t537, t395.t417.t472.t505.t527, t406.t428.t483.t516.t538, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/45/22/67
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
114 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.14884,53212,1,0,292,230762,160,200,1539,249487,501
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-15 finished in 2487 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5212215448098159613
[2021-05-10 19:34:40] [INFO ] Computing symmetric may disable matrix : 1052 transitions.
[2021-05-10 19:34:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 19:34:40] [INFO ] Computing symmetric may enable matrix : 1052 transitions.
[2021-05-10 19:34:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 19:34:40] [INFO ] Applying decomposition
[2021-05-10 19:34:40] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10005292381105241551.txt, -o, /tmp/graph10005292381105241551.bin, -w, /tmp/graph10005292381105241551.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10005292381105241551.bin, -l, -1, -v, -w, /tmp/graph10005292381105241551.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 19:34:40] [INFO ] Decomposing Gal with order
[2021-05-10 19:34:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:34:40] [INFO ] Computing Do-Not-Accords matrix : 1052 transitions.
[2021-05-10 19:34:40] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 19:34:40] [INFO ] Built C files in 229ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5212215448098159613
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5212215448098159613]
[2021-05-10 19:34:40] [INFO ] Removed a total of 213 redundant transitions.
[2021-05-10 19:34:40] [INFO ] Flatten gal took : 161 ms
[2021-05-10 19:34:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 22 ms.
[2021-05-10 19:34:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality3500236175920110873.gal : 15 ms
[2021-05-10 19:34:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality16647998595224946303.ltl : 5507 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality3500236175920110873.gal, -t, CGAL, -LTL, /tmp/LTLCardinality16647998595224946303.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality3500236175920110873.gal -t CGAL -LTL /tmp/LTLCardinality16647998595224946303.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((G(F(("((((((((((((((((((((((gu237.p5_0+gu237.p5_1)+gu237.p5_2)+gu237.p5_3)+gu237.p5_4)+gu237.p5_5)+gu237.p5_6)+gu237.p5_7)+gu237.p5_8)+gu237.p5_9)+gu237.p5_10)+gu237.p5_11)+gu237.p5_12)+gu237.p5_13)+gu237.p5_14)+gu237.p5_15)+gu237.p5_16)+gu237.p5_17)+gu237.p5_18)+gu237.p5_19)+gu237.p5_20)+gu237.p5_21)>=2)")||(G("((((((((((((((((((((((gu238.p4_0+gu238.p4_1)+gu238.p4_2)+gu238.p4_3)+gu238.p4_4)+gu238.p4_5)+gu238.p4_6)+gu238.p4_7)+gu238.p4_8)+gu238.p4_9)+gu238.p4_10)+gu238.p4_11)+gu238.p4_12)+gu238.p4_13)+gu238.p4_14)+gu238.p4_15)+gu238.p4_16)+gu238.p4_17)+gu238.p4_18)+gu238.p4_19)+gu238.p4_20)+gu238.p4_21)<=(((((((((((((((((((((gu238.pl0_0+gu238.pl0_1)+gu238.pl0_2)+gu238.pl0_3)+gu238.pl0_4)+gu238.pl0_5)+gu238.pl0_6)+gu238.pl0_7)+gu238.pl0_8)+gu238.pl0_9)+gu238.pl0_10)+gu238.pl0_11)+gu238.pl0_12)+gu238.pl0_13)+gu238.pl0_14)+gu238.pl0_15)+gu238.pl0_16)+gu238.pl0_17)+gu238.pl0_18)+gu238.pl0_19)+gu238.pl0_20)+gu238.pl0_21))"))))))
Formula 0 simplified : !GF("((((((((((((((((((((((gu237.p5_0+gu237.p5_1)+gu237.p5_2)+gu237.p5_3)+gu237.p5_4)+gu237.p5_5)+gu237.p5_6)+gu237.p5_7)+gu237.p5_8)+gu237.p5_9)+gu237.p5_10)+gu237.p5_11)+gu237.p5_12)+gu237.p5_13)+gu237.p5_14)+gu237.p5_15)+gu237.p5_16)+gu237.p5_17)+gu237.p5_18)+gu237.p5_19)+gu237.p5_20)+gu237.p5_21)>=2)" | G"((((((((((((((((((((((gu238.p4_0+gu238.p4_1)+gu238.p4_2)+gu238.p4_3)+gu238.p4_4)+gu238.p4_5)+gu238.p4_6)+gu238.p4_7)+gu238.p4_8)+gu238.p4_9)+gu238.p4_10)+gu238.p4_11)+gu238.p4_12)+gu238.p4_13)+gu238.p4_14)+gu238.p4_15)+gu238.p4_16)+gu238.p4_17)+gu238.p4_18)+gu238.p4_19)+gu238.p4_20)+gu238.p4_21)<=(((((((((((((((((((((gu238.pl0_0+gu238.pl0_1)+gu238.pl0_2)+gu238.pl0_3)+gu238.pl0_4)+gu238.pl0_5)+gu238.pl0_6)+gu238.pl0_7)+gu238.pl0_8)+gu238.pl0_9)+gu238.pl0_10)+gu238.pl0_11)+gu238.pl0_12)+gu238.pl0_13)+gu238.pl0_14)+gu238.pl0_15)+gu238.pl0_16)+gu238.pl0_17)+gu238.pl0_18)+gu238.pl0_19)+gu238.pl0_20)+gu238.pl0_21))")
Compilation finished in 8511 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5212215448098159613]
Link finished in 67 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5212215448098159613]
WARNING : LTSmin timed out (>360 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5212215448098159613]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (((LTLAPp2==true) U X((LTLAPp3==true)))||X((!(LTLAPp2==true)&&[]((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5212215448098159613]
LTSmin run took 645 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp5==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5212215448098159613]
WARNING : LTSmin timed out (>360 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp5==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5212215448098159613]
Retrying LTSmin with larger timeout 2880 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5212215448098159613]
Detected timeout of ITS tools.
[2021-05-10 19:55:34] [INFO ] Applying decomposition
[2021-05-10 19:55:34] [INFO ] Flatten gal took : 90 ms
[2021-05-10 19:55:34] [INFO ] Decomposing Gal with order
[2021-05-10 19:55:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 19:55:34] [INFO ] Removed a total of 335 redundant transitions.
[2021-05-10 19:55:34] [INFO ] Flatten gal took : 156 ms
[2021-05-10 19:55:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2021-05-10 19:55:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality2572768416695177729.gal : 17 ms
[2021-05-10 19:55:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality2326343603454814951.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality2572768416695177729.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2326343603454814951.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality2572768416695177729.gal -t CGAL -LTL /tmp/LTLCardinality2326343603454814951.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((G(F(("((((((((((((((((((((((gLxP0.p5_0+gLxP1.p5_1)+gLxP2.p5_2)+gLxP3.p5_3)+gLxP4.p5_4)+gLxP5.p5_5)+gLxP6.p5_6)+gLxP7.p5_7)+gLxP8.p5_8)+gLxP9.p5_9)+gLxP10.p5_10)+gLxP11.p5_11)+gLxP12.p5_12)+gLxP13.p5_13)+gLxP14.p5_14)+gLxP15.p5_15)+gLxP16.p5_16)+gLxP17.p5_17)+gLxP18.p5_18)+gLxP19.p5_19)+gLxP20.p5_20)+gLxP21.p5_21)>=2)")||(G("((((((((((((((((((((((gLxP0.p4_0+gLxP1.p4_1)+gLxP2.p4_2)+gLxP3.p4_3)+gLxP4.p4_4)+gLxP5.p4_5)+gLxP6.p4_6)+gLxP7.p4_7)+gLxP8.p4_8)+gLxP9.p4_9)+gLxP10.p4_10)+gLxP11.p4_11)+gLxP12.p4_12)+gLxP13.p4_13)+gLxP14.p4_14)+gLxP15.p4_15)+gLxP16.p4_16)+gLxP17.p4_17)+gLxP18.p4_18)+gLxP19.p4_19)+gLxP20.p4_20)+gLxP21.p4_21)<=(((((((((((((((((((((gLxP0.pl0_0+gLxP1.pl0_1)+gLxP2.pl0_2)+gLxP3.pl0_3)+gLxP4.pl0_4)+gLxP5.pl0_5)+gLxP6.pl0_6)+gLxP7.pl0_7)+gLxP8.pl0_8)+gLxP9.pl0_9)+gLxP10.pl0_10)+gLxP11.pl0_11)+gLxP12.pl0_12)+gLxP13.pl0_13)+gLxP14.pl0_14)+gLxP15.pl0_15)+gLxP16.pl0_16)+gLxP17.pl0_17)+gLxP18.pl0_18)+gLxP19.pl0_19)+gLxP20.pl0_20)+gLxP21.pl0_21))"))))))
Formula 0 simplified : !GF("((((((((((((((((((((((gLxP0.p5_0+gLxP1.p5_1)+gLxP2.p5_2)+gLxP3.p5_3)+gLxP4.p5_4)+gLxP5.p5_5)+gLxP6.p5_6)+gLxP7.p5_7)+gLxP8.p5_8)+gLxP9.p5_9)+gLxP10.p5_10)+gLxP11.p5_11)+gLxP12.p5_12)+gLxP13.p5_13)+gLxP14.p5_14)+gLxP15.p5_15)+gLxP16.p5_16)+gLxP17.p5_17)+gLxP18.p5_18)+gLxP19.p5_19)+gLxP20.p5_20)+gLxP21.p5_21)>=2)" | G"((((((((((((((((((((((gLxP0.p4_0+gLxP1.p4_1)+gLxP2.p4_2)+gLxP3.p4_3)+gLxP4.p4_4)+gLxP5.p4_5)+gLxP6.p4_6)+gLxP7.p4_7)+gLxP8.p4_8)+gLxP9.p4_9)+gLxP10.p4_10)+gLxP11.p4_11)+gLxP12.p4_12)+gLxP13.p4_13)+gLxP14.p4_14)+gLxP15.p4_15)+gLxP16.p4_16)+gLxP17.p4_17)+gLxP18.p4_18)+gLxP19.p4_19)+gLxP20.p4_20)+gLxP21.p4_21)<=(((((((((((((((((((((gLxP0.pl0_0+gLxP1.pl0_1)+gLxP2.pl0_2)+gLxP3.pl0_3)+gLxP4.pl0_4)+gLxP5.pl0_5)+gLxP6.pl0_6)+gLxP7.pl0_7)+gLxP8.pl0_8)+gLxP9.pl0_9)+gLxP10.pl0_10)+gLxP11.pl0_11)+gLxP12.pl0_12)+gLxP13.pl0_13)+gLxP14.pl0_14)+gLxP15.pl0_15)+gLxP16.pl0_16)+gLxP17.pl0_17)+gLxP18.pl0_18)+gLxP19.pl0_19)+gLxP20.pl0_20)+gLxP21.pl0_21))")
Detected timeout of ITS tools.
[2021-05-10 20:16:22] [INFO ] Flatten gal took : 125 ms
[2021-05-10 20:16:22] [INFO ] Input system was already deterministic with 1052 transitions.
[2021-05-10 20:16:22] [INFO ] Transformed 1041 places.
[2021-05-10 20:16:22] [INFO ] Transformed 1052 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-10 20:16:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality4621074831654175515.gal : 12 ms
[2021-05-10 20:16:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality4626400363817736485.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality4621074831654175515.gal, -t, CGAL, -LTL, /tmp/LTLCardinality4626400363817736485.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality4621074831654175515.gal -t CGAL -LTL /tmp/LTLCardinality4626400363817736485.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((((((((((((((((((((((p5_0+p5_1)+p5_2)+p5_3)+p5_4)+p5_5)+p5_6)+p5_7)+p5_8)+p5_9)+p5_10)+p5_11)+p5_12)+p5_13)+p5_14)+p5_15)+p5_16)+p5_17)+p5_18)+p5_19)+p5_20)+p5_21)>=2)")||(G("((((((((((((((((((((((p4_0+p4_1)+p4_2)+p4_3)+p4_4)+p4_5)+p4_6)+p4_7)+p4_8)+p4_9)+p4_10)+p4_11)+p4_12)+p4_13)+p4_14)+p4_15)+p4_16)+p4_17)+p4_18)+p4_19)+p4_20)+p4_21)<=(((((((((((((((((((((pl0_0+pl0_1)+pl0_2)+pl0_3)+pl0_4)+pl0_5)+pl0_6)+pl0_7)+pl0_8)+pl0_9)+pl0_10)+pl0_11)+pl0_12)+pl0_13)+pl0_14)+pl0_15)+pl0_16)+pl0_17)+pl0_18)+pl0_19)+pl0_20)+pl0_21))"))))))
Formula 0 simplified : !GF("((((((((((((((((((((((p5_0+p5_1)+p5_2)+p5_3)+p5_4)+p5_5)+p5_6)+p5_7)+p5_8)+p5_9)+p5_10)+p5_11)+p5_12)+p5_13)+p5_14)+p5_15)+p5_16)+p5_17)+p5_18)+p5_19)+p5_20)+p5_21)>=2)" | G"((((((((((((((((((((((p4_0+p4_1)+p4_2)+p4_3)+p4_4)+p4_5)+p4_6)+p4_7)+p4_8)+p4_9)+p4_10)+p4_11)+p4_12)+p4_13)+p4_14)+p4_15)+p4_16)+p4_17)+p4_18)+p4_19)+p4_20)+p4_21)<=(((((((((((((((((((((pl0_0+pl0_1)+pl0_2)+pl0_3)+pl0_4)+pl0_5)+pl0_6)+pl0_7)+pl0_8)+pl0_9)+pl0_10)+pl0_11)+pl0_12)+pl0_13)+pl0_14)+pl0_15)+pl0_16)+pl0_17)+pl0_18)+pl0_19)+pl0_20)+pl0_21))")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-L00010M0001C001P001G001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875900844"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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