fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r083-tall-162048876000940
Last Updated
Jun 28, 2021

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13460.888 3600000.00 12667458.00 483.20 F?FTFFTFTTTFTTFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 77K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 526K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 157K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 591K 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 9.2K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Mar 23 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 40K Mar 23 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 22 18:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 22 18:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 24 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 552K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620709374111

Running Version 0
[2021-05-11 05:02:55] [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-11 05:02:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 05:02:55] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2021-05-11 05:02:55] [INFO ] Transformed 1475 places.
[2021-05-11 05:02:55] [INFO ] Transformed 1234 transitions.
[2021-05-11 05:02:55] [INFO ] Parsed PT model containing 1475 places and 1234 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2021-05-11 05:02:55] [INFO ] Initial state test concluded for 6 properties.
Reduce places removed 10 places and 0 transitions.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 244 out of 1465 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Reduce places removed 45 places and 0 transitions.
Discarding 129 places :
Implicit places reduction removed 129 places
Iterating post reduction 0 with 174 rules applied. Total rules applied 174 place count 1291 transition count 1234
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 260 place count 1205 transition count 1137
Iterating global reduction 1 with 86 rules applied. Total rules applied 346 place count 1205 transition count 1137
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 357 place count 1194 transition count 1137
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 389 place count 1162 transition count 1095
Iterating global reduction 2 with 32 rules applied. Total rules applied 421 place count 1162 transition count 1095
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 2 with 19 rules applied. Total rules applied 440 place count 1153 transition count 1085
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 451 place count 1142 transition count 1074
Iterating global reduction 3 with 11 rules applied. Total rules applied 462 place count 1142 transition count 1074
Applied a total of 462 rules in 339 ms. Remains 1142 /1465 variables (removed 323) and now considering 1074/1234 (removed 160) transitions.
// Phase 1: matrix 1074 rows 1142 cols
[2021-05-11 05:02:56] [INFO ] Computed 153 place invariants in 56 ms
[2021-05-11 05:02:56] [INFO ] Implicit Places using invariants in 458 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 535, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 785, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 841, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053]
Discarding 79 places :
Implicit Place search using SMT only with invariants took 485 ms to find 79 implicit places.
// Phase 1: matrix 1074 rows 1063 cols
[2021-05-11 05:02:56] [INFO ] Computed 74 place invariants in 11 ms
[2021-05-11 05:02:57] [INFO ] Dead Transitions using invariants and state equation in 547 ms returned []
Starting structural reductions, iteration 1 : 1063/1465 places, 1074/1234 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1042 transition count 1053
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1042 transition count 1053
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 1032 transition count 1033
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 1032 transition count 1033
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 1022 transition count 1023
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 1022 transition count 1023
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 1012 transition count 1013
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 1012 transition count 1013
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 1002 transition count 1003
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 1002 transition count 1003
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 992 transition count 993
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 992 transition count 993
Applied a total of 142 rules in 297 ms. Remains 992 /1063 variables (removed 71) and now considering 993/1074 (removed 81) transitions.
// Phase 1: matrix 993 rows 992 cols
[2021-05-11 05:02:57] [INFO ] Computed 74 place invariants in 12 ms
[2021-05-11 05:02:57] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 993 rows 992 cols
[2021-05-11 05:02:57] [INFO ] Computed 74 place invariants in 9 ms
[2021-05-11 05:02:58] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 992/1465 places, 993/1234 transitions.
[2021-05-11 05:02:58] [INFO ] Flatten gal took : 95 ms
[2021-05-11 05:02:58] [INFO ] Flatten gal took : 49 ms
[2021-05-11 05:02:59] [INFO ] Input system was already deterministic with 993 transitions.
Incomplete random walk after 100000 steps, including 154 resets, run finished after 452 ms. (steps per millisecond=221 ) properties (out of 20) seen :18
Running SMT prover for 2 properties.
// Phase 1: matrix 993 rows 992 cols
[2021-05-11 05:02:59] [INFO ] Computed 74 place invariants in 6 ms
[2021-05-11 05:02:59] [INFO ] [Real]Absence check using 0 positive and 74 generalized place invariants in 33 ms returned sat
[2021-05-11 05:02:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 05:02:59] [INFO ] [Real]Absence check using state equation in 237 ms returned unsat
[2021-05-11 05:03:00] [INFO ] [Real]Absence check using 0 positive and 74 generalized place invariants in 34 ms returned sat
[2021-05-11 05:03:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 05:03:00] [INFO ] [Real]Absence check using state equation in 167 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
[2021-05-11 05:03:00] [INFO ] Initial state test concluded for 1 properties.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 992/992 places, 993/993 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 540 transitions
Trivial Post-agglo rules discarded 540 transitions
Performed 540 trivial Post agglomeration. Transition count delta: 540
Iterating post reduction 0 with 544 rules applied. Total rules applied 544 place count 987 transition count 452
Reduce places removed 540 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 546 rules applied. Total rules applied 1090 place count 447 transition count 446
Reduce places removed 4 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 26 rules applied. Total rules applied 1116 place count 443 transition count 424
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1138 place count 421 transition count 424
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 110 Pre rules applied. Total rules applied 1138 place count 421 transition count 314
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 1391 place count 278 transition count 314
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1391 place count 278 transition count 303
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1413 place count 267 transition count 303
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 1440 place count 240 transition count 246
Iterating global reduction 4 with 27 rules applied. Total rules applied 1467 place count 240 transition count 246
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 12 rules applied. Total rules applied 1479 place count 240 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1480 place count 239 transition count 234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1480 place count 239 transition count 232
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1484 place count 237 transition count 232
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1485 place count 236 transition count 221
Iterating global reduction 6 with 1 rules applied. Total rules applied 1486 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 6 with 22 rules applied. Total rules applied 1508 place count 236 transition count 199
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1519 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 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 1565 place count 202 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1566 place count 201 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1567 place count 200 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1568 place count 199 transition count 173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1569 place count 198 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1570 place count 197 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1571 place count 196 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1572 place count 195 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1573 place count 194 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1574 place count 193 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1575 place count 192 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1576 place count 191 transition count 165
Applied a total of 1576 rules in 159 ms. Remains 191 /992 variables (removed 801) and now considering 165/993 (removed 828) transitions.
// Phase 1: matrix 165 rows 191 cols
[2021-05-11 05:03:00] [INFO ] Computed 37 place invariants in 1 ms
[2021-05-11 05:03:00] [INFO ] Implicit Places using invariants in 78 ms returned [0, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 46, 157]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 80 ms to find 14 implicit places.
[2021-05-11 05:03:00] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 165 rows 177 cols
[2021-05-11 05:03:00] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-11 05:03:00] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Starting structural reductions, iteration 1 : 177/992 places, 165/993 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 0 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-11 05:03:00] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-11 05:03:00] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 133 rows 145 cols
[2021-05-11 05:03:00] [INFO ] Computed 23 place invariants in 6 ms
[2021-05-11 05:03:00] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 145/992 places, 133/993 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-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 3471 reset in 411 ms.
Product exploration explored 100000 steps with 3590 reset in 356 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 45 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3624 reset in 296 ms.
Product exploration explored 100000 steps with 3548 reset in 319 ms.
[2021-05-11 05:03:02] [INFO ] Flatten gal took : 10 ms
[2021-05-11 05:03:02] [INFO ] Flatten gal took : 6 ms
[2021-05-11 05:03:02] [INFO ] Time to serialize gal into /tmp/LTL1358054895716321390.gal : 3 ms
[2021-05-11 05:03:02] [INFO ] Time to serialize properties into /tmp/LTL9457069465600431023.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/LTL1358054895716321390.gal, -t, CGAL, -LTL, /tmp/LTL9457069465600431023.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/LTL1358054895716321390.gal -t CGAL -LTL /tmp/LTL9457069465600431023.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((((((((((((((((((((p5_0_0+p5_1_0)+p5_2_0)+p5_3_0)+p5_4_0)+p5_5_0)+p5_6_0)+p5_7_0)+p5_8_0)+p5_9_0)+p5_10_0)+p5_0_1)+p5_1_1)+p5_2_1)+p5_3_1)+p5_4_1)+p5_5_1)+p5_6_1)+p5_7_1)+p5_8_1)+p5_9_1)+p5_10_1)>=2)")||(G("((((((((((((((((((((((p4_0_0+p4_1_0)+p4_2_0)+p4_3_0)+p4_4_0)+p4_5_0)+p4_6_0)+p4_7_0)+p4_8_0)+p4_9_0)+p4_10_0)+p4_0_1)+p4_1_1)+p4_2_1)+p4_3_1)+p4_4_1)+p4_5_1)+p4_6_1)+p4_7_1)+p4_8_1)+p4_9_1)+p4_10_1)<=(((((((((((((((((((((pl0_0_0+pl0_1_0)+pl0_2_0)+pl0_3_0)+pl0_4_0)+pl0_5_0)+pl0_6_0)+pl0_7_0)+pl0_8_0)+pl0_9_0)+pl0_10_0)+pl0_0_1)+pl0_1_1)+pl0_2_1)+pl0_3_1)+pl0_4_1)+pl0_5_1)+pl0_6_1)+pl0_7_1)+pl0_8_1)+pl0_9_1)+pl0_10_1))"))))))
Formula 0 simplified : !GF("((((((((((((((((((((((p5_0_0+p5_1_0)+p5_2_0)+p5_3_0)+p5_4_0)+p5_5_0)+p5_6_0)+p5_7_0)+p5_8_0)+p5_9_0)+p5_10_0)+p5_0_1)+p5_1_1)+p5_2_1)+p5_3_1)+p5_4_1)+p5_5_1)+p5_6_1)+p5_7_1)+p5_8_1)+p5_9_1)+p5_10_1)>=2)" | G"((((((((((((((((((((((p4_0_0+p4_1_0)+p4_2_0)+p4_3_0)+p4_4_0)+p4_5_0)+p4_6_0)+p4_7_0)+p4_8_0)+p4_9_0)+p4_10_0)+p4_0_1)+p4_1_1)+p4_2_1)+p4_3_1)+p4_4_1)+p4_5_1)+p4_6_1)+p4_7_1)+p4_8_1)+p4_9_1)+p4_10_1)<=(((((((((((((((((((((pl0_0_0+pl0_1_0)+pl0_2_0)+pl0_3_0)+pl0_4_0)+pl0_5_0)+pl0_6_0)+pl0_7_0)+pl0_8_0)+pl0_9_0)+pl0_10_0)+pl0_0_1)+pl0_1_1)+pl0_2_1)+pl0_3_1)+pl0_4_1)+pl0_5_1)+pl0_6_1)+pl0_7_1)+pl0_8_1)+pl0_9_1)+pl0_10_1))")
Reverse transition relation is NOT exact ! Due to transitions t861, t862, t863, t864, t865, t866, t867, t868, t869, t870, t871, t872, t873, t874, t875, t876, t877, t878, t879, t880, t881, t882, 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-11 05:03:17] [INFO ] Flatten gal took : 6 ms
[2021-05-11 05:03:17] [INFO ] Applying decomposition
[2021-05-11 05:03:17] [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/graph6348380378328034438.txt, -o, /tmp/graph6348380378328034438.bin, -w, /tmp/graph6348380378328034438.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/graph6348380378328034438.bin, -l, -1, -v, -w, /tmp/graph6348380378328034438.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 05:03:17] [INFO ] Decomposing Gal with order
[2021-05-11 05:03:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 05:03:17] [INFO ] Flatten gal took : 104 ms
[2021-05-11 05:03:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2021-05-11 05:03:18] [INFO ] Time to serialize gal into /tmp/LTL1929995782036408152.gal : 8 ms
[2021-05-11 05:03:18] [INFO ] Time to serialize properties into /tmp/LTL12001548061124611395.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/LTL1929995782036408152.gal, -t, CGAL, -LTL, /tmp/LTL12001548061124611395.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/LTL1929995782036408152.gal -t CGAL -LTL /tmp/LTL12001548061124611395.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((((((((((((((((((((gi1.gi0.gu8.p5_0_0+gi1.gi0.gu8.p5_1_0)+gi1.gi0.gu8.p5_2_0)+gi1.gi0.gu8.p5_3_0)+gi1.gi0.gu8.p5_4_0)+gi1.gi0.gu8.p5_5_0)+gi1.gi0.gu8.p5_6_0)+gi1.gi0.gu8.p5_7_0)+gi1.gi0.gu8.p5_8_0)+gi1.gi0.gu8.p5_9_0)+gi1.gi0.gu8.p5_10_0)+gi1.gi0.gu8.p5_0_1)+gi1.gi0.gu8.p5_1_1)+gi1.gi0.gu8.p5_2_1)+gi1.gi0.gu8.p5_3_1)+gi1.gi0.gu8.p5_4_1)+gi1.gi0.gu8.p5_5_1)+gi1.gi0.gu8.p5_6_1)+gi1.gi0.gu8.p5_7_1)+gi1.gi0.gu8.p5_8_1)+gi1.gi0.gu8.p5_9_1)+gi1.gi0.gu8.p5_10_1)>=2)")||(G("((((((((((((((((((((((gu9.p4_0_0+gu9.p4_1_0)+gu9.p4_2_0)+gu9.p4_3_0)+gu9.p4_4_0)+gu9.p4_5_0)+gu9.p4_6_0)+gu9.p4_7_0)+gu9.p4_8_0)+gu9.p4_9_0)+gu9.p4_10_0)+gu9.p4_0_1)+gu9.p4_1_1)+gu9.p4_2_1)+gu9.p4_3_1)+gu9.p4_4_1)+gu9.p4_5_1)+gu9.p4_6_1)+gu9.p4_7_1)+gu9.p4_8_1)+gu9.p4_9_1)+gu9.p4_10_1)<=(((((((((((((((((((((gu9.pl0_0_0+gu9.pl0_1_0)+gu9.pl0_2_0)+gu9.pl0_3_0)+gu9.pl0_4_0)+gu9.pl0_5_0)+gu9.pl0_6_0)+gu9.pl0_7_0)+gu9.pl0_8_0)+gu9.pl0_9_0)+gu9.pl0_10_0)+gu9.pl0_0_1)+gu9.pl0_1_1)+gu9.pl0_2_1)+gu9.pl0_3_1)+gu9.pl0_4_1)+gu9.pl0_5_1)+gu9.pl0_6_1)+gu9.pl0_7_1)+gu9.pl0_8_1)+gu9.pl0_9_1)+gu9.pl0_10_1))"))))))
Formula 0 simplified : !GF("((((((((((((((((((((((gi1.gi0.gu8.p5_0_0+gi1.gi0.gu8.p5_1_0)+gi1.gi0.gu8.p5_2_0)+gi1.gi0.gu8.p5_3_0)+gi1.gi0.gu8.p5_4_0)+gi1.gi0.gu8.p5_5_0)+gi1.gi0.gu8.p5_6_0)+gi1.gi0.gu8.p5_7_0)+gi1.gi0.gu8.p5_8_0)+gi1.gi0.gu8.p5_9_0)+gi1.gi0.gu8.p5_10_0)+gi1.gi0.gu8.p5_0_1)+gi1.gi0.gu8.p5_1_1)+gi1.gi0.gu8.p5_2_1)+gi1.gi0.gu8.p5_3_1)+gi1.gi0.gu8.p5_4_1)+gi1.gi0.gu8.p5_5_1)+gi1.gi0.gu8.p5_6_1)+gi1.gi0.gu8.p5_7_1)+gi1.gi0.gu8.p5_8_1)+gi1.gi0.gu8.p5_9_1)+gi1.gi0.gu8.p5_10_1)>=2)" | G"((((((((((((((((((((((gu9.p4_0_0+gu9.p4_1_0)+gu9.p4_2_0)+gu9.p4_3_0)+gu9.p4_4_0)+gu9.p4_5_0)+gu9.p4_6_0)+gu9.p4_7_0)+gu9.p4_8_0)+gu9.p4_9_0)+gu9.p4_10_0)+gu9.p4_0_1)+gu9.p4_1_1)+gu9.p4_2_1)+gu9.p4_3_1)+gu9.p4_4_1)+gu9.p4_5_1)+gu9.p4_6_1)+gu9.p4_7_1)+gu9.p4_8_1)+gu9.p4_9_1)+gu9.p4_10_1)<=(((((((((((((((((((((gu9.pl0_0_0+gu9.pl0_1_0)+gu9.pl0_2_0)+gu9.pl0_3_0)+gu9.pl0_4_0)+gu9.pl0_5_0)+gu9.pl0_6_0)+gu9.pl0_7_0)+gu9.pl0_8_0)+gu9.pl0_9_0)+gu9.pl0_10_0)+gu9.pl0_0_1)+gu9.pl0_1_1)+gu9.pl0_2_1)+gu9.pl0_3_1)+gu9.pl0_4_1)+gu9.pl0_5_1)+gu9.pl0_6_1)+gu9.pl0_7_1)+gu9.pl0_8_1)+gu9.pl0_9_1)+gu9.pl0_10_1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16433016196932460498
[2021-05-11 05:03:33] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16433016196932460498
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/ltsmin16433016196932460498]
Compilation finished in 600 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16433016196932460498]
Link finished in 42 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/ltsmin16433016196932460498]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-01 finished in 47851 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 992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 992/992 places, 993/993 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 509 transitions
Trivial Post-agglo rules discarded 509 transitions
Performed 509 trivial Post agglomeration. Transition count delta: 509
Iterating post reduction 0 with 513 rules applied. Total rules applied 513 place count 987 transition count 483
Reduce places removed 509 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 515 rules applied. Total rules applied 1028 place count 478 transition count 477
Reduce places removed 4 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 15 rules applied. Total rules applied 1043 place count 474 transition count 466
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1054 place count 463 transition count 466
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 153 Pre rules applied. Total rules applied 1054 place count 463 transition count 313
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 4 with 361 rules applied. Total rules applied 1415 place count 255 transition count 313
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 1437 place count 255 transition count 291
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1459 place count 233 transition count 291
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1459 place count 233 transition count 280
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 1481 place count 222 transition count 280
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1498 place count 205 transition count 233
Iterating global reduction 6 with 17 rules applied. Total rules applied 1515 place count 205 transition count 233
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1526 place count 205 transition count 222
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1526 place count 205 transition count 211
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 1548 place count 194 transition count 211
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1559 place count 183 transition count 200
Iterating global reduction 7 with 11 rules applied. Total rules applied 1570 place count 183 transition count 200
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 1592 place count 183 transition count 178
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1603 place count 172 transition count 178
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 9 with 48 rules applied. Total rules applied 1651 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 1652 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 1653 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 1654 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 1655 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 1656 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 1657 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 1658 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 1659 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 1660 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 1661 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 1662 place count 137 transition count 143
Applied a total of 1662 rules in 83 ms. Remains 137 /992 variables (removed 855) and now considering 143/993 (removed 850) transitions.
// Phase 1: matrix 143 rows 137 cols
[2021-05-11 05:03:48] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-11 05:03:48] [INFO ] Implicit Places using invariants in 87 ms returned [24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 102, 125]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 96 ms to find 13 implicit places.
[2021-05-11 05:03:48] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 143 rows 124 cols
[2021-05-11 05:03:48] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-11 05:03:48] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Starting structural reductions, iteration 1 : 124/992 places, 143/993 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-11 05:03:48] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-11 05:03:48] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 121 rows 102 cols
[2021-05-11 05:03:48] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-11 05:03:48] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 102/992 places, 121/993 transitions.
Stuttering acceptance computed with spot in 194 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-PT-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 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23)) (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 97 steps with 1 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-02 finished in 604 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 992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 992/992 places, 993/993 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 988 transition count 993
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 52 place count 940 transition count 935
Iterating global reduction 1 with 48 rules applied. Total rules applied 100 place count 940 transition count 935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 940 transition count 934
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 123 place count 918 transition count 902
Iterating global reduction 2 with 22 rules applied. Total rules applied 145 place count 918 transition count 902
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 157 place count 906 transition count 880
Iterating global reduction 2 with 12 rules applied. Total rules applied 169 place count 906 transition count 880
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 191 place count 884 transition count 858
Iterating global reduction 2 with 22 rules applied. Total rules applied 213 place count 884 transition count 858
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 224 place count 884 transition count 847
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 235 place count 873 transition count 836
Iterating global reduction 3 with 11 rules applied. Total rules applied 246 place count 873 transition count 836
Applied a total of 246 rules in 188 ms. Remains 873 /992 variables (removed 119) and now considering 836/993 (removed 157) transitions.
// Phase 1: matrix 836 rows 873 cols
[2021-05-11 05:03:48] [INFO ] Computed 70 place invariants in 5 ms
[2021-05-11 05:03:49] [INFO ] Implicit Places using invariants in 281 ms returned [176, 437]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 283 ms to find 2 implicit places.
// Phase 1: matrix 836 rows 871 cols
[2021-05-11 05:03:49] [INFO ] Computed 68 place invariants in 4 ms
[2021-05-11 05:03:49] [INFO ] Dead Transitions using invariants and state equation in 386 ms returned []
Starting structural reductions, iteration 1 : 871/992 places, 836/993 transitions.
Applied a total of 0 rules in 17 ms. Remains 871 /871 variables (removed 0) and now considering 836/836 (removed 0) transitions.
// Phase 1: matrix 836 rows 871 cols
[2021-05-11 05:03:49] [INFO ] Computed 68 place invariants in 4 ms
[2021-05-11 05:03:50] [INFO ] Dead Transitions using invariants and state equation in 408 ms returned []
Finished structural reductions, in 2 iterations. Remains : 871/992 places, 836/993 transitions.
Stuttering acceptance computed with spot in 174 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-PT-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 s794 s795 s796 s797 s798 s799 s800 s801 s802 s803 s804 s805 s806 s807 s808 s809 s810 s811 s812 s813 s814 s815)), p1:(LEQ (ADD s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s378 s379 s380 s381 s382 s383 s384 s385 s386 s387 s388) (ADD s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447)), p2:(LEQ 1 (ADD s715 s716 s717 s718 s719 s720 s721 s722 s723 s724 s725 s726 s727 s728 s729 s730 s731 s732 s733 s734 s735 s736))], 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 932 ms.
Product exploration explored 100000 steps with 50000 reset in 946 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 201 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 927 ms.
Product exploration explored 100000 steps with 50000 reset in 1008 ms.
Applying partial POR strategy [true, false, false, true, true, true, false, true]
Stuttering acceptance computed with spot in 183 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 246 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 246 rules applied. Total rules applied 246 place count 871 transition count 836
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 247 place count 871 transition count 835
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 300 Pre rules applied. Total rules applied 247 place count 871 transition count 1000
Deduced a syphon composed of 546 places in 0 ms
Iterating global reduction 2 with 300 rules applied. Total rules applied 547 place count 871 transition count 1000
Discarding 290 places :
Symmetric choice reduction at 2 with 290 rule applications. Total rules 837 place count 581 transition count 710
Deduced a syphon composed of 256 places in 0 ms
Iterating global reduction 2 with 290 rules applied. Total rules applied 1127 place count 581 transition count 710
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 324 places in 0 ms
Iterating global reduction 2 with 68 rules applied. Total rules applied 1195 place count 581 transition count 710
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 1253 place count 523 transition count 652
Deduced a syphon composed of 266 places in 1 ms
Iterating global reduction 2 with 58 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 0 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 118 ms. Remains 512 /871 variables (removed 359) and now considering 652/836 (removed 184) transitions.
[2021-05-11 05:03:55] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 652 rows 512 cols
[2021-05-11 05:03:55] [INFO ] Computed 68 place invariants in 7 ms
[2021-05-11 05:03:55] [INFO ] Dead Transitions using invariants and state equation in 397 ms returned []
Finished structural reductions, in 1 iterations. Remains : 512/871 places, 652/836 transitions.
Product exploration explored 100000 steps with 50000 reset in 3123 ms.
Product exploration explored 100000 steps with 50000 reset in 3025 ms.
[2021-05-11 05:04:01] [INFO ] Flatten gal took : 30 ms
[2021-05-11 05:04:01] [INFO ] Flatten gal took : 30 ms
[2021-05-11 05:04:01] [INFO ] Time to serialize gal into /tmp/LTL2959485675934243206.gal : 4 ms
[2021-05-11 05:04:01] [INFO ] Time to serialize properties into /tmp/LTL10065963000620737554.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/LTL2959485675934243206.gal, -t, CGAL, -LTL, /tmp/LTL10065963000620737554.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/LTL2959485675934243206.gal -t CGAL -LTL /tmp/LTL10065963000620737554.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((((((((((((((((((((((pl1_0_0+pl1_1_0)+pl1_2_0)+pl1_3_0)+pl1_4_0)+pl1_5_0)+pl1_6_0)+pl1_7_0)+pl1_8_0)+pl1_9_0)+pl1_10_0)+pl1_0_1)+pl1_1_1)+pl1_2_1)+pl1_3_1)+pl1_4_1)+pl1_5_1)+pl1_6_1)+pl1_7_1)+pl1_8_1)+pl1_9_1)+pl1_10_1)>=3)")U(X("((((((((((((((((((((((ml2_0_0+ml2_1_0)+ml2_2_0)+ml2_3_0)+ml2_4_0)+ml2_5_0)+ml2_6_0)+ml2_7_0)+ml2_8_0)+ml2_9_0)+ml2_10_0)+ml2_0_1)+ml2_1_1)+ml2_2_1)+ml2_3_1)+ml2_4_1)+ml2_5_1)+ml2_6_1)+ml2_7_1)+ml2_8_1)+ml2_9_1)+ml2_10_1)<=((((((((((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_0+pl1_1_0)+pl1_2_0)+pl1_3_0)+pl1_4_0)+pl1_5_0)+pl1_6_0)+pl1_7_0)+pl1_8_0)+pl1_9_0)+pl1_10_0)+pl1_0_1)+pl1_1_1)+pl1_2_1)+pl1_3_1)+pl1_4_1)+pl1_5_1)+pl1_6_1)+pl1_7_1)+pl1_8_1)+pl1_9_1)+pl1_10_1)<3)")&&(G("((((((((((((((((((((((p6_0_0+p6_1_0)+p6_2_0)+p6_3_0)+p6_4_0)+p6_5_0)+p6_6_0)+p6_7_0)+p6_8_0)+p6_9_0)+p6_10_0)+p6_0_1)+p6_1_1)+p6_2_1)+p6_3_1)+p6_4_1)+p6_5_1)+p6_6_1)+p6_7_1)+p6_8_1)+p6_9_1)+p6_10_1)>=1)"))))))
Formula 0 simplified : !(("((((((((((((((((((((((pl1_0_0+pl1_1_0)+pl1_2_0)+pl1_3_0)+pl1_4_0)+pl1_5_0)+pl1_6_0)+pl1_7_0)+pl1_8_0)+pl1_9_0)+pl1_10_0)+pl1_0_1)+pl1_1_1)+pl1_2_1)+pl1_3_1)+pl1_4_1)+pl1_5_1)+pl1_6_1)+pl1_7_1)+pl1_8_1)+pl1_9_1)+pl1_10_1)>=3)" U X"((((((((((((((((((((((ml2_0_0+ml2_1_0)+ml2_2_0)+ml2_3_0)+ml2_4_0)+ml2_5_0)+ml2_6_0)+ml2_7_0)+ml2_8_0)+ml2_9_0)+ml2_10_0)+ml2_0_1)+ml2_1_1)+ml2_2_1)+ml2_3_1)+ml2_4_1)+ml2_5_1)+ml2_6_1)+ml2_7_1)+ml2_8_1)+ml2_9_1)+ml2_10_1)<=((((((((((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_0+pl1_1_0)+pl1_2_0)+pl1_3_0)+pl1_4_0)+pl1_5_0)+pl1_6_0)+pl1_7_0)+pl1_8_0)+pl1_9_0)+pl1_10_0)+pl1_0_1)+pl1_1_1)+pl1_2_1)+pl1_3_1)+pl1_4_1)+pl1_5_1)+pl1_6_1)+pl1_7_1)+pl1_8_1)+pl1_9_1)+pl1_10_1)<3)" & G"((((((((((((((((((((((p6_0_0+p6_1_0)+p6_2_0)+p6_3_0)+p6_4_0)+p6_5_0)+p6_6_0)+p6_7_0)+p6_8_0)+p6_9_0)+p6_10_0)+p6_0_1)+p6_1_1)+p6_2_1)+p6_3_1)+p6_4_1)+p6_5_1)+p6_6_1)+p6_7_1)+p6_8_1)+p6_9_1)+p6_10_1)>=1)"))
Detected timeout of ITS tools.
[2021-05-11 05:04:16] [INFO ] Flatten gal took : 30 ms
[2021-05-11 05:04:16] [INFO ] Applying decomposition
[2021-05-11 05:04:16] [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/graph4053185098365375926.txt, -o, /tmp/graph4053185098365375926.bin, -w, /tmp/graph4053185098365375926.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/graph4053185098365375926.bin, -l, -1, -v, -w, /tmp/graph4053185098365375926.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 05:04:16] [INFO ] Decomposing Gal with order
[2021-05-11 05:04:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 05:04:17] [INFO ] Removed a total of 59 redundant transitions.
[2021-05-11 05:04:17] [INFO ] Flatten gal took : 90 ms
[2021-05-11 05:04:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 11 ms.
[2021-05-11 05:04:17] [INFO ] Time to serialize gal into /tmp/LTL4627835959355805328.gal : 7 ms
[2021-05-11 05:04:17] [INFO ] Time to serialize properties into /tmp/LTL12329524393840029557.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/LTL4627835959355805328.gal, -t, CGAL, -LTL, /tmp/LTL12329524393840029557.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/LTL4627835959355805328.gal -t CGAL -LTL /tmp/LTL12329524393840029557.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((((((((((((((((((((((gu317.pl1_0_0+gu317.pl1_1_0)+gu317.pl1_2_0)+gu317.pl1_3_0)+gu317.pl1_4_0)+gu317.pl1_5_0)+gu317.pl1_6_0)+gu317.pl1_7_0)+gu317.pl1_8_0)+gu317.pl1_9_0)+gu317.pl1_10_0)+gu317.pl1_0_1)+gu317.pl1_1_1)+gu317.pl1_2_1)+gu317.pl1_3_1)+gu317.pl1_4_1)+gu317.pl1_5_1)+gu317.pl1_6_1)+gu317.pl1_7_1)+gu317.pl1_8_1)+gu317.pl1_9_1)+gu317.pl1_10_1)>=3)")U(X("((((((((((((((((((((((gu167.ml2_0_0+gu167.ml2_1_0)+gu167.ml2_2_0)+gu167.ml2_3_0)+gu167.ml2_4_0)+gu167.ml2_5_0)+gu167.ml2_6_0)+gu167.ml2_7_0)+gu167.ml2_8_0)+gu167.ml2_9_0)+gu167.ml2_10_0)+gu167.ml2_0_1)+gu167.ml2_1_1)+gu167.ml2_2_1)+gu167.ml2_3_1)+gu167.ml2_4_1)+gu167.ml2_5_1)+gu167.ml2_6_1)+gu167.ml2_7_1)+gu167.ml2_8_1)+gu167.ml2_9_1)+gu167.ml2_10_1)<=((((((((((gu167.l8_0+gu167.l8_1)+gu167.l8_2)+gu167.l8_3)+gu167.l8_4)+gu167.l8_5)+gu167.l8_6)+gu167.l8_7)+gu167.l8_8)+gu167.l8_9)+gu167.l8_10))")))||(X(("((((((((((((((((((((((gu317.pl1_0_0+gu317.pl1_1_0)+gu317.pl1_2_0)+gu317.pl1_3_0)+gu317.pl1_4_0)+gu317.pl1_5_0)+gu317.pl1_6_0)+gu317.pl1_7_0)+gu317.pl1_8_0)+gu317.pl1_9_0)+gu317.pl1_10_0)+gu317.pl1_0_1)+gu317.pl1_1_1)+gu317.pl1_2_1)+gu317.pl1_3_1)+gu317.pl1_4_1)+gu317.pl1_5_1)+gu317.pl1_6_1)+gu317.pl1_7_1)+gu317.pl1_8_1)+gu317.pl1_9_1)+gu317.pl1_10_1)<3)")&&(G("((((((((((((((((((((((gu303.p6_0_0+gu303.p6_1_0)+gu303.p6_2_0)+gu303.p6_3_0)+gu303.p6_4_0)+gu303.p6_5_0)+gu303.p6_6_0)+gu303.p6_7_0)+gu303.p6_8_0)+gu303.p6_9_0)+gu303.p6_10_0)+gu303.p6_0_1)+gu303.p6_1_1)+gu303.p6_2_1)+gu303.p6_3_1)+gu303.p6_4_1)+gu303.p6_5_1)+gu303.p6_6_1)+gu303.p6_7_1)+gu303.p6_8_1)+gu303.p6_9_1)+gu303.p6_10_1)>=1)"))))))
Formula 0 simplified : !(("((((((((((((((((((((((gu317.pl1_0_0+gu317.pl1_1_0)+gu317.pl1_2_0)+gu317.pl1_3_0)+gu317.pl1_4_0)+gu317.pl1_5_0)+gu317.pl1_6_0)+gu317.pl1_7_0)+gu317.pl1_8_0)+gu317.pl1_9_0)+gu317.pl1_10_0)+gu317.pl1_0_1)+gu317.pl1_1_1)+gu317.pl1_2_1)+gu317.pl1_3_1)+gu317.pl1_4_1)+gu317.pl1_5_1)+gu317.pl1_6_1)+gu317.pl1_7_1)+gu317.pl1_8_1)+gu317.pl1_9_1)+gu317.pl1_10_1)>=3)" U X"((((((((((((((((((((((gu167.ml2_0_0+gu167.ml2_1_0)+gu167.ml2_2_0)+gu167.ml2_3_0)+gu167.ml2_4_0)+gu167.ml2_5_0)+gu167.ml2_6_0)+gu167.ml2_7_0)+gu167.ml2_8_0)+gu167.ml2_9_0)+gu167.ml2_10_0)+gu167.ml2_0_1)+gu167.ml2_1_1)+gu167.ml2_2_1)+gu167.ml2_3_1)+gu167.ml2_4_1)+gu167.ml2_5_1)+gu167.ml2_6_1)+gu167.ml2_7_1)+gu167.ml2_8_1)+gu167.ml2_9_1)+gu167.ml2_10_1)<=((((((((((gu167.l8_0+gu167.l8_1)+gu167.l8_2)+gu167.l8_3)+gu167.l8_4)+gu167.l8_5)+gu167.l8_6)+gu167.l8_7)+gu167.l8_8)+gu167.l8_9)+gu167.l8_10))") | X("((((((((((((((((((((((gu317.pl1_0_0+gu317.pl1_1_0)+gu317.pl1_2_0)+gu317.pl1_3_0)+gu317.pl1_4_0)+gu317.pl1_5_0)+gu317.pl1_6_0)+gu317.pl1_7_0)+gu317.pl1_8_0)+gu317.pl1_9_0)+gu317.pl1_10_0)+gu317.pl1_0_1)+gu317.pl1_1_1)+gu317.pl1_2_1)+gu317.pl1_3_1)+gu317.pl1_4_1)+gu317.pl1_5_1)+gu317.pl1_6_1)+gu317.pl1_7_1)+gu317.pl1_8_1)+gu317.pl1_9_1)+gu317.pl1_10_1)<3)" & G"((((((((((((((((((((((gu303.p6_0_0+gu303.p6_1_0)+gu303.p6_2_0)+gu303.p6_3_0)+gu303.p6_4_0)+gu303.p6_5_0)+gu303.p6_6_0)+gu303.p6_7_0)+gu303.p6_8_0)+gu303.p6_9_0)+gu303.p6_10_0)+gu303.p6_0_1)+gu303.p6_1_1)+gu303.p6_2_1)+gu303.p6_3_1)+gu303.p6_4_1)+gu303.p6_5_1)+gu303.p6_6_1)+gu303.p6_7_1)+gu303.p6_8_1)+gu303.p6_9_1)+gu303.p6_10_1)>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14265468144341541791
[2021-05-11 05:04:32] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14265468144341541791
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/ltsmin14265468144341541791]
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/ltsmin14265468144341541791] 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/ltsmin14265468144341541791] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-03 finished in 44518 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 44 out of 992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 992/992 places, 993/993 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 987 transition count 496
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 502 rules applied. Total rules applied 1002 place count 491 transition count 490
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1006 place count 487 transition count 490
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 1006 place count 487 transition count 336
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 1369 place count 278 transition count 336
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 1391 place count 278 transition count 314
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1413 place count 256 transition count 314
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1413 place count 256 transition count 303
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 1435 place count 245 transition count 303
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1472 place count 208 transition count 246
Iterating global reduction 5 with 37 rules applied. Total rules applied 1509 place count 208 transition count 246
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 1510 place count 208 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1511 place count 207 transition count 245
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 13 Pre rules applied. Total rules applied 1511 place count 207 transition count 232
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1537 place count 194 transition count 232
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1549 place count 182 transition count 210
Iterating global reduction 7 with 12 rules applied. Total rules applied 1561 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 7 with 33 rules applied. Total rules applied 1594 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 1605 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 9 with 68 rules applied. Total rules applied 1673 place count 137 transition count 143
Applied a total of 1673 rules in 40 ms. Remains 137 /992 variables (removed 855) and now considering 143/993 (removed 850) transitions.
// Phase 1: matrix 143 rows 137 cols
[2021-05-11 05:04:33] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-11 05:04:33] [INFO ] Implicit Places using invariants in 54 ms returned [11, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 125]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 55 ms to find 13 implicit places.
[2021-05-11 05:04:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 143 rows 124 cols
[2021-05-11 05:04:33] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-11 05:04:33] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Starting structural reductions, iteration 1 : 124/992 places, 143/993 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 3 ms. Remains 92 /124 variables (removed 32) and now considering 111/143 (removed 32) transitions.
// Phase 1: matrix 111 rows 92 cols
[2021-05-11 05:04:33] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-11 05:04:33] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 111 rows 92 cols
[2021-05-11 05:04:33] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-11 05:04:33] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 92/992 places, 111/993 transitions.
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-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 4 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-04 finished in 313 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(F((p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 992/992 places, 993/993 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 988 transition count 993
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 61 place count 931 transition count 926
Iterating global reduction 1 with 57 rules applied. Total rules applied 118 place count 931 transition count 926
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 141 place count 908 transition count 883
Iterating global reduction 1 with 23 rules applied. Total rules applied 164 place count 908 transition count 883
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 186 place count 886 transition count 861
Iterating global reduction 1 with 22 rules applied. Total rules applied 208 place count 886 transition count 861
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 219 place count 875 transition count 850
Iterating global reduction 1 with 11 rules applied. Total rules applied 230 place count 875 transition count 850
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 241 place count 864 transition count 839
Iterating global reduction 1 with 11 rules applied. Total rules applied 252 place count 864 transition count 839
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 263 place count 853 transition count 828
Iterating global reduction 1 with 11 rules applied. Total rules applied 274 place count 853 transition count 828
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 285 place count 842 transition count 817
Iterating global reduction 1 with 11 rules applied. Total rules applied 296 place count 842 transition count 817
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 307 place count 831 transition count 806
Iterating global reduction 1 with 11 rules applied. Total rules applied 318 place count 831 transition count 806
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 329 place count 820 transition count 795
Iterating global reduction 1 with 11 rules applied. Total rules applied 340 place count 820 transition count 795
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 351 place count 809 transition count 784
Iterating global reduction 1 with 11 rules applied. Total rules applied 362 place count 809 transition count 784
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 373 place count 798 transition count 773
Iterating global reduction 1 with 11 rules applied. Total rules applied 384 place count 798 transition count 773
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 395 place count 787 transition count 762
Iterating global reduction 1 with 11 rules applied. Total rules applied 406 place count 787 transition count 762
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 417 place count 776 transition count 751
Iterating global reduction 1 with 11 rules applied. Total rules applied 428 place count 776 transition count 751
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 439 place count 765 transition count 740
Iterating global reduction 1 with 11 rules applied. Total rules applied 450 place count 765 transition count 740
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 461 place count 754 transition count 729
Iterating global reduction 1 with 11 rules applied. Total rules applied 472 place count 754 transition count 729
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 483 place count 754 transition count 718
Applied a total of 483 rules in 364 ms. Remains 754 /992 variables (removed 238) and now considering 718/993 (removed 275) transitions.
// Phase 1: matrix 718 rows 754 cols
[2021-05-11 05:04:33] [INFO ] Computed 70 place invariants in 4 ms
[2021-05-11 05:04:34] [INFO ] Implicit Places using invariants in 162 ms returned [339, 654]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 163 ms to find 2 implicit places.
// Phase 1: matrix 718 rows 752 cols
[2021-05-11 05:04:34] [INFO ] Computed 68 place invariants in 10 ms
[2021-05-11 05:04:34] [INFO ] Dead Transitions using invariants and state equation in 328 ms returned []
Starting structural reductions, iteration 1 : 752/992 places, 718/993 transitions.
Applied a total of 0 rules in 21 ms. Remains 752 /752 variables (removed 0) and now considering 718/718 (removed 0) transitions.
// Phase 1: matrix 718 rows 752 cols
[2021-05-11 05:04:34] [INFO ] Computed 68 place invariants in 3 ms
[2021-05-11 05:04:34] [INFO ] Dead Transitions using invariants and state equation in 317 ms returned []
Finished structural reductions, in 2 iterations. Remains : 752/992 places, 718/993 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s641), p2:(AND (GT 1 s464) (GT 1 s154)), p1:(GT 1 s154)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 752 ms.
Product exploration explored 100000 steps with 50000 reset in 751 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 752 transition count 718
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 (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (NOT p0), p2, p1]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 721 ms.
Product exploration explored 100000 steps with 50000 reset in 753 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 752 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 752/752 places, 718/718 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 752 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 268 place count 752 transition count 717
Performed 277 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 277 Pre rules applied. Total rules applied 268 place count 752 transition count 860
Deduced a syphon composed of 544 places in 0 ms
Iterating global reduction 2 with 277 rules applied. Total rules applied 545 place count 752 transition count 860
Discarding 352 places :
Symmetric choice reduction at 2 with 352 rule applications. Total rules 897 place count 400 transition count 508
Deduced a syphon composed of 192 places in 0 ms
Iterating global reduction 2 with 352 rules applied. Total rules applied 1249 place count 400 transition count 508
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 1274 place count 400 transition count 508
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 1312 place count 362 transition count 470
Deduced a syphon composed of 179 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 1350 place count 362 transition count 470
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 190 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1361 place count 362 transition count 493
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1372 place count 351 transition count 471
Deduced a syphon composed of 179 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1383 place count 351 transition count 471
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 180 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1384 place count 351 transition count 475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1385 place count 350 transition count 472
Deduced a syphon composed of 179 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1386 place count 350 transition count 472
Deduced a syphon composed of 179 places in 0 ms
Applied a total of 1386 rules in 71 ms. Remains 350 /752 variables (removed 402) and now considering 472/718 (removed 246) transitions.
[2021-05-11 05:04:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 472 rows 350 cols
[2021-05-11 05:04:38] [INFO ] Computed 68 place invariants in 3 ms
[2021-05-11 05:04:38] [INFO ] Dead Transitions using invariants and state equation in 218 ms returned []
Finished structural reductions, in 1 iterations. Remains : 350/752 places, 472/718 transitions.
Product exploration explored 100000 steps with 50000 reset in 2371 ms.
Product exploration explored 100000 steps with 50000 reset in 2321 ms.
[2021-05-11 05:04:43] [INFO ] Flatten gal took : 20 ms
[2021-05-11 05:04:43] [INFO ] Flatten gal took : 19 ms
[2021-05-11 05:04:43] [INFO ] Time to serialize gal into /tmp/LTL13136824098062355994.gal : 3 ms
[2021-05-11 05:04:43] [INFO ] Time to serialize properties into /tmp/LTL6372436714151593223.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/LTL13136824098062355994.gal, -t, CGAL, -LTL, /tmp/LTL6372436714151593223.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/LTL13136824098062355994.gal -t CGAL -LTL /tmp/LTL6372436714151593223.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p7_0>=3)"))||(X(F(("(c4_0<1)")U(("((cl0_10_1<1)&&(c4_0<1))")||(G("(c4_0<1)"))))))))
Formula 0 simplified : !(F"(p7_0>=3)" | XF("(c4_0<1)" U ("((cl0_10_1<1)&&(c4_0<1))" | G"(c4_0<1)")))
Detected timeout of ITS tools.
[2021-05-11 05:04:58] [INFO ] Flatten gal took : 18 ms
[2021-05-11 05:04:58] [INFO ] Applying decomposition
[2021-05-11 05:04:58] [INFO ] Flatten gal took : 17 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/graph17381143297247123882.txt, -o, /tmp/graph17381143297247123882.bin, -w, /tmp/graph17381143297247123882.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/graph17381143297247123882.bin, -l, -1, -v, -w, /tmp/graph17381143297247123882.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 05:04:58] [INFO ] Decomposing Gal with order
[2021-05-11 05:04:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 05:04:58] [INFO ] Removed a total of 98 redundant transitions.
[2021-05-11 05:04:58] [INFO ] Flatten gal took : 37 ms
[2021-05-11 05:04:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-11 05:04:58] [INFO ] Time to serialize gal into /tmp/LTL14026368584846981872.gal : 9 ms
[2021-05-11 05:04:58] [INFO ] Time to serialize properties into /tmp/LTL2105309737153253217.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/LTL14026368584846981872.gal, -t, CGAL, -LTL, /tmp/LTL2105309737153253217.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14026368584846981872.gal -t CGAL -LTL /tmp/LTL2105309737153253217.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(i23.u237.p7_0>=3)"))||(X(F(("(i1.u90.c4_0<1)")U(("((i21.i2.i1.u201.cl0_10_1<1)&&(i1.u90.c4_0<1))")||(G("(i1.u90.c4_0<1)"))))))))
Formula 0 simplified : !(F"(i23.u237.p7_0>=3)" | XF("(i1.u90.c4_0<1)" U ("((i21.i2.i1.u201.cl0_10_1<1)&&(i1.u90.c4_0<1))" | G"(i1.u90.c4_0<1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2320063613344596749
[2021-05-11 05:05:13] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2320063613344596749
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/ltsmin2320063613344596749]
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/ltsmin2320063613344596749] 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/ltsmin2320063613344596749] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-10 finished in 41083 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 992/992 places, 993/993 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 554 transitions
Trivial Post-agglo rules discarded 554 transitions
Performed 554 trivial Post agglomeration. Transition count delta: 554
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 989 transition count 438
Reduce places removed 554 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 560 rules applied. Total rules applied 1116 place count 435 transition count 432
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 1122 place count 431 transition count 430
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1124 place count 429 transition count 430
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 156 Pre rules applied. Total rules applied 1124 place count 429 transition count 274
Deduced a syphon composed of 156 places in 0 ms
Ensure Unique test removed 57 places
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 4 with 369 rules applied. Total rules applied 1493 place count 216 transition count 274
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 1515 place count 216 transition count 252
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1537 place count 194 transition count 252
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1537 place count 194 transition count 241
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 1559 place count 183 transition count 241
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 1597 place count 145 transition count 173
Iterating global reduction 6 with 38 rules applied. Total rules applied 1635 place count 145 transition count 173
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 11 rules applied. Total rules applied 1646 place count 145 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1647 place count 144 transition count 162
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 13 Pre rules applied. Total rules applied 1647 place count 144 transition count 149
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1673 place count 131 transition count 149
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1685 place count 119 transition count 127
Iterating global reduction 8 with 12 rules applied. Total rules applied 1697 place count 119 transition count 127
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 8 with 43 rules applied. Total rules applied 1740 place count 119 transition count 84
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 22 rules applied. Total rules applied 1762 place count 98 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1763 place count 97 transition count 83
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 11 with 46 rules applied. Total rules applied 1809 place count 74 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1810 place count 73 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1811 place count 72 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1812 place count 71 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1813 place count 70 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1814 place count 69 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1815 place count 68 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1816 place count 67 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1817 place count 66 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1818 place count 65 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1819 place count 64 transition count 50
Applied a total of 1819 rules in 33 ms. Remains 64 /992 variables (removed 928) and now considering 50/993 (removed 943) transitions.
// Phase 1: matrix 50 rows 64 cols
[2021-05-11 05:05:14] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-11 05:05:14] [INFO ] Implicit Places using invariants in 85 ms returned [1, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 49, 52]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 86 ms to find 14 implicit places.
[2021-05-11 05:05:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2021-05-11 05:05:14] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-11 05:05:14] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 50/992 places, 50/993 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 49 transition count 29
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 29 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 28 transition count 28
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 42 place count 28 transition count 17
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 64 place count 17 transition count 17
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 73 place count 8 transition count 8
Iterating global reduction 3 with 9 rules applied. Total rules applied 82 place count 8 transition count 8
Applied a total of 82 rules in 3 ms. Remains 8 /50 variables (removed 42) and now considering 8/50 (removed 42) transitions.
// Phase 1: matrix 8 rows 8 cols
[2021-05-11 05:05:14] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-11 05:05:14] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-11 05:05:14] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-11 05:05:14] [INFO ] Implicit Places using invariants and state equation in 34 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 57 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 7/992 places, 8/993 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-11 05:05:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 7 cols
[2021-05-11 05:05:14] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-11 05:05:14] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 3 iterations. Remains : 7/992 places, 8/993 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-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:(GT s3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-11 finished in 348 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 992/992 places, 993/993 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 988 transition count 435
Reduce places removed 557 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 563 rules applied. Total rules applied 1123 place count 431 transition count 429
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 1128 place count 427 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1129 place count 426 transition count 428
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 154 Pre rules applied. Total rules applied 1129 place count 426 transition count 274
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 1492 place count 217 transition count 274
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 1514 place count 217 transition count 252
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1536 place count 195 transition count 252
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1536 place count 195 transition count 241
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 1558 place count 184 transition count 241
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 1595 place count 147 transition count 174
Iterating global reduction 6 with 37 rules applied. Total rules applied 1632 place count 147 transition count 174
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 10 rules applied. Total rules applied 1642 place count 147 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1643 place count 146 transition count 164
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 1643 place count 146 transition count 152
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1667 place count 134 transition count 152
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1679 place count 122 transition count 130
Iterating global reduction 8 with 12 rules applied. Total rules applied 1691 place count 122 transition count 130
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 8 with 44 rules applied. Total rules applied 1735 place count 122 transition count 86
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1757 place count 100 transition count 86
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 10 with 51 rules applied. Total rules applied 1808 place count 74 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1809 place count 73 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1810 place count 72 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1811 place count 71 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1812 place count 70 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1813 place count 69 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1814 place count 68 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1815 place count 67 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1816 place count 66 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1817 place count 65 transition count 52
Applied a total of 1817 rules in 52 ms. Remains 65 /992 variables (removed 927) and now considering 52/993 (removed 941) transitions.
// Phase 1: matrix 52 rows 65 cols
[2021-05-11 05:05:15] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-11 05:05:15] [INFO ] Implicit Places using invariants in 99 ms returned [3, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 51, 53]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 100 ms to find 14 implicit places.
[2021-05-11 05:05:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 52 rows 51 cols
[2021-05-11 05:05:15] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-11 05:05:15] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 51/992 places, 52/993 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 50 transition count 30
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 29 transition count 30
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 42 place count 29 transition count 19
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 64 place count 18 transition count 19
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 74 place count 8 transition count 9
Iterating global reduction 2 with 10 rules applied. Total rules applied 84 place count 8 transition count 9
Applied a total of 84 rules in 4 ms. Remains 8 /51 variables (removed 43) and now considering 9/52 (removed 43) transitions.
// Phase 1: matrix 9 rows 8 cols
[2021-05-11 05:05:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-11 05:05:15] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-05-11 05:05:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-11 05:05:15] [INFO ] Implicit Places using invariants and state equation in 9 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 102 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 7/992 places, 9/993 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 8/9 (removed 1) transitions.
[2021-05-11 05:05:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2021-05-11 05:05:15] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-11 05:05:15] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 3 iterations. Remains : 6/992 places, 8/993 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s3 s5)], 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-14 finished in 371 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin387232729523118694
[2021-05-11 05:05:15] [INFO ] Computing symmetric may disable matrix : 993 transitions.
[2021-05-11 05:05:15] [INFO ] Applying decomposition
[2021-05-11 05:05:15] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-11 05:05:15] [INFO ] Computing symmetric may enable matrix : 993 transitions.
[2021-05-11 05:05:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-11 05:05:15] [INFO ] Flatten gal took : 24 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/graph9862254795259205580.txt, -o, /tmp/graph9862254795259205580.bin, -w, /tmp/graph9862254795259205580.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/graph9862254795259205580.bin, -l, -1, -v, -w, /tmp/graph9862254795259205580.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 05:05:15] [INFO ] Decomposing Gal with order
[2021-05-11 05:05:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 05:05:15] [INFO ] Removed a total of 193 redundant transitions.
[2021-05-11 05:05:15] [INFO ] Flatten gal took : 130 ms
[2021-05-11 05:05:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 43 ms.
[2021-05-11 05:05:15] [INFO ] Computing Do-Not-Accords matrix : 993 transitions.
[2021-05-11 05:05:15] [INFO ] Computation of Completed DNA matrix. took 93 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-11 05:05:15] [INFO ] Built C files in 516ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin387232729523118694
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/ltsmin387232729523118694]
[2021-05-11 05:05:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality9248577766041112473.gal : 30 ms
[2021-05-11 05:05:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality1502183345167081828.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/LTLCardinality9248577766041112473.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1502183345167081828.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/LTLCardinality9248577766041112473.gal -t CGAL -LTL /tmp/LTLCardinality1502183345167081828.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((G(F(("((((((((((((((((((((((gu271.p5_0_0+gu271.p5_1_0)+gu271.p5_2_0)+gu271.p5_3_0)+gu271.p5_4_0)+gu271.p5_5_0)+gu271.p5_6_0)+gu271.p5_7_0)+gu271.p5_8_0)+gu271.p5_9_0)+gu271.p5_10_0)+gu271.p5_0_1)+gu271.p5_1_1)+gu271.p5_2_1)+gu271.p5_3_1)+gu271.p5_4_1)+gu271.p5_5_1)+gu271.p5_6_1)+gu271.p5_7_1)+gu271.p5_8_1)+gu271.p5_9_1)+gu271.p5_10_1)>=2)")||(G("((((((((((((((((((((((gu272.p4_0_0+gu272.p4_1_0)+gu272.p4_2_0)+gu272.p4_3_0)+gu272.p4_4_0)+gu272.p4_5_0)+gu272.p4_6_0)+gu272.p4_7_0)+gu272.p4_8_0)+gu272.p4_9_0)+gu272.p4_10_0)+gu272.p4_0_1)+gu272.p4_1_1)+gu272.p4_2_1)+gu272.p4_3_1)+gu272.p4_4_1)+gu272.p4_5_1)+gu272.p4_6_1)+gu272.p4_7_1)+gu272.p4_8_1)+gu272.p4_9_1)+gu272.p4_10_1)<=(((((((((((((((((((((gu272.pl0_0_0+gu272.pl0_1_0)+gu272.pl0_2_0)+gu272.pl0_3_0)+gu272.pl0_4_0)+gu272.pl0_5_0)+gu272.pl0_6_0)+gu272.pl0_7_0)+gu272.pl0_8_0)+gu272.pl0_9_0)+gu272.pl0_10_0)+gu272.pl0_0_1)+gu272.pl0_1_1)+gu272.pl0_2_1)+gu272.pl0_3_1)+gu272.pl0_4_1)+gu272.pl0_5_1)+gu272.pl0_6_1)+gu272.pl0_7_1)+gu272.pl0_8_1)+gu272.pl0_9_1)+gu272.pl0_10_1))"))))))
Formula 0 simplified : !GF("((((((((((((((((((((((gu271.p5_0_0+gu271.p5_1_0)+gu271.p5_2_0)+gu271.p5_3_0)+gu271.p5_4_0)+gu271.p5_5_0)+gu271.p5_6_0)+gu271.p5_7_0)+gu271.p5_8_0)+gu271.p5_9_0)+gu271.p5_10_0)+gu271.p5_0_1)+gu271.p5_1_1)+gu271.p5_2_1)+gu271.p5_3_1)+gu271.p5_4_1)+gu271.p5_5_1)+gu271.p5_6_1)+gu271.p5_7_1)+gu271.p5_8_1)+gu271.p5_9_1)+gu271.p5_10_1)>=2)" | G"((((((((((((((((((((((gu272.p4_0_0+gu272.p4_1_0)+gu272.p4_2_0)+gu272.p4_3_0)+gu272.p4_4_0)+gu272.p4_5_0)+gu272.p4_6_0)+gu272.p4_7_0)+gu272.p4_8_0)+gu272.p4_9_0)+gu272.p4_10_0)+gu272.p4_0_1)+gu272.p4_1_1)+gu272.p4_2_1)+gu272.p4_3_1)+gu272.p4_4_1)+gu272.p4_5_1)+gu272.p4_6_1)+gu272.p4_7_1)+gu272.p4_8_1)+gu272.p4_9_1)+gu272.p4_10_1)<=(((((((((((((((((((((gu272.pl0_0_0+gu272.pl0_1_0)+gu272.pl0_2_0)+gu272.pl0_3_0)+gu272.pl0_4_0)+gu272.pl0_5_0)+gu272.pl0_6_0)+gu272.pl0_7_0)+gu272.pl0_8_0)+gu272.pl0_9_0)+gu272.pl0_10_0)+gu272.pl0_0_1)+gu272.pl0_1_1)+gu272.pl0_2_1)+gu272.pl0_3_1)+gu272.pl0_4_1)+gu272.pl0_5_1)+gu272.pl0_6_1)+gu272.pl0_7_1)+gu272.pl0_8_1)+gu272.pl0_9_1)+gu272.pl0_10_1))")
Compilation finished in 7615 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin387232729523118694]
Link finished in 60 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/ltsmin387232729523118694]
WARNING : LTSmin timed out (>450 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/ltsmin387232729523118694]
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/ltsmin387232729523118694]
LTSmin run took 492 ms.
FORMULA FamilyReunion-PT-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, (<>((LTLAPp5==true))||X(<>(((LTLAPp6==true) U ((LTLAPp7==true)||[]((LTLAPp6==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin387232729523118694]
LTSmin run took 404 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 3600 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/ltsmin387232729523118694]
Detected timeout of ITS tools.
[2021-05-11 05:26:02] [INFO ] Flatten gal took : 92 ms
[2021-05-11 05:26:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality10471280428090999163.gal : 20 ms
[2021-05-11 05:26:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality3607334873947765307.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/LTLCardinality10471280428090999163.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3607334873947765307.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/LTLCardinality10471280428090999163.gal -t CGAL -LTL /tmp/LTLCardinality3607334873947765307.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((((((((((((((((((((p5_0_0+p5_1_0)+p5_2_0)+p5_3_0)+p5_4_0)+p5_5_0)+p5_6_0)+p5_7_0)+p5_8_0)+p5_9_0)+p5_10_0)+p5_0_1)+p5_1_1)+p5_2_1)+p5_3_1)+p5_4_1)+p5_5_1)+p5_6_1)+p5_7_1)+p5_8_1)+p5_9_1)+p5_10_1)>=2)")||(G("((((((((((((((((((((((p4_0_0+p4_1_0)+p4_2_0)+p4_3_0)+p4_4_0)+p4_5_0)+p4_6_0)+p4_7_0)+p4_8_0)+p4_9_0)+p4_10_0)+p4_0_1)+p4_1_1)+p4_2_1)+p4_3_1)+p4_4_1)+p4_5_1)+p4_6_1)+p4_7_1)+p4_8_1)+p4_9_1)+p4_10_1)<=(((((((((((((((((((((pl0_0_0+pl0_1_0)+pl0_2_0)+pl0_3_0)+pl0_4_0)+pl0_5_0)+pl0_6_0)+pl0_7_0)+pl0_8_0)+pl0_9_0)+pl0_10_0)+pl0_0_1)+pl0_1_1)+pl0_2_1)+pl0_3_1)+pl0_4_1)+pl0_5_1)+pl0_6_1)+pl0_7_1)+pl0_8_1)+pl0_9_1)+pl0_10_1))"))))))
Formula 0 simplified : !GF("((((((((((((((((((((((p5_0_0+p5_1_0)+p5_2_0)+p5_3_0)+p5_4_0)+p5_5_0)+p5_6_0)+p5_7_0)+p5_8_0)+p5_9_0)+p5_10_0)+p5_0_1)+p5_1_1)+p5_2_1)+p5_3_1)+p5_4_1)+p5_5_1)+p5_6_1)+p5_7_1)+p5_8_1)+p5_9_1)+p5_10_1)>=2)" | G"((((((((((((((((((((((p4_0_0+p4_1_0)+p4_2_0)+p4_3_0)+p4_4_0)+p4_5_0)+p4_6_0)+p4_7_0)+p4_8_0)+p4_9_0)+p4_10_0)+p4_0_1)+p4_1_1)+p4_2_1)+p4_3_1)+p4_4_1)+p4_5_1)+p4_6_1)+p4_7_1)+p4_8_1)+p4_9_1)+p4_10_1)<=(((((((((((((((((((((pl0_0_0+pl0_1_0)+pl0_2_0)+pl0_3_0)+pl0_4_0)+pl0_5_0)+pl0_6_0)+pl0_7_0)+pl0_8_0)+pl0_9_0)+pl0_10_0)+pl0_0_1)+pl0_1_1)+pl0_2_1)+pl0_3_1)+pl0_4_1)+pl0_5_1)+pl0_6_1)+pl0_7_1)+pl0_8_1)+pl0_9_1)+pl0_10_1))")
Detected timeout of ITS tools.
[2021-05-11 05:46:49] [INFO ] Flatten gal took : 88 ms
[2021-05-11 05:46:49] [INFO ] Input system was already deterministic with 993 transitions.
[2021-05-11 05:46:49] [INFO ] Transformed 992 places.
[2021-05-11 05:46:50] [INFO ] Transformed 993 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
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-11 05:46:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality3107931462461009346.gal : 9 ms
[2021-05-11 05:46:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality8478479827116916220.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/LTLCardinality3107931462461009346.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8478479827116916220.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/LTLCardinality3107931462461009346.gal -t CGAL -LTL /tmp/LTLCardinality8478479827116916220.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((((((((((((((((((((((p5_0_0+p5_1_0)+p5_2_0)+p5_3_0)+p5_4_0)+p5_5_0)+p5_6_0)+p5_7_0)+p5_8_0)+p5_9_0)+p5_10_0)+p5_0_1)+p5_1_1)+p5_2_1)+p5_3_1)+p5_4_1)+p5_5_1)+p5_6_1)+p5_7_1)+p5_8_1)+p5_9_1)+p5_10_1)>=2)")||(G("((((((((((((((((((((((p4_0_0+p4_1_0)+p4_2_0)+p4_3_0)+p4_4_0)+p4_5_0)+p4_6_0)+p4_7_0)+p4_8_0)+p4_9_0)+p4_10_0)+p4_0_1)+p4_1_1)+p4_2_1)+p4_3_1)+p4_4_1)+p4_5_1)+p4_6_1)+p4_7_1)+p4_8_1)+p4_9_1)+p4_10_1)<=(((((((((((((((((((((pl0_0_0+pl0_1_0)+pl0_2_0)+pl0_3_0)+pl0_4_0)+pl0_5_0)+pl0_6_0)+pl0_7_0)+pl0_8_0)+pl0_9_0)+pl0_10_0)+pl0_0_1)+pl0_1_1)+pl0_2_1)+pl0_3_1)+pl0_4_1)+pl0_5_1)+pl0_6_1)+pl0_7_1)+pl0_8_1)+pl0_9_1)+pl0_10_1))"))))))
Formula 0 simplified : !GF("((((((((((((((((((((((p5_0_0+p5_1_0)+p5_2_0)+p5_3_0)+p5_4_0)+p5_5_0)+p5_6_0)+p5_7_0)+p5_8_0)+p5_9_0)+p5_10_0)+p5_0_1)+p5_1_1)+p5_2_1)+p5_3_1)+p5_4_1)+p5_5_1)+p5_6_1)+p5_7_1)+p5_8_1)+p5_9_1)+p5_10_1)>=2)" | G"((((((((((((((((((((((p4_0_0+p4_1_0)+p4_2_0)+p4_3_0)+p4_4_0)+p4_5_0)+p4_6_0)+p4_7_0)+p4_8_0)+p4_9_0)+p4_10_0)+p4_0_1)+p4_1_1)+p4_2_1)+p4_3_1)+p4_4_1)+p4_5_1)+p4_6_1)+p4_7_1)+p4_8_1)+p4_9_1)+p4_10_1)<=(((((((((((((((((((((pl0_0_0+pl0_1_0)+pl0_2_0)+pl0_3_0)+pl0_4_0)+pl0_5_0)+pl0_6_0)+pl0_7_0)+pl0_8_0)+pl0_9_0)+pl0_10_0)+pl0_0_1)+pl0_1_1)+pl0_2_1)+pl0_3_1)+pl0_4_1)+pl0_5_1)+pl0_6_1)+pl0_7_1)+pl0_8_1)+pl0_9_1)+pl0_10_1))")

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-PT-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-PT-L00010M0001C001P001G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048876000940"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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