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-162048876000941.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048876000941
=====================================================================

--------------------
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 1620709379033

Running Version 0
[2021-05-11 05:03:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-11 05:03:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 05:03:00] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2021-05-11 05:03:00] [INFO ] Transformed 1475 places.
[2021-05-11 05:03:00] [INFO ] Transformed 1234 transitions.
[2021-05-11 05:03:00] [INFO ] Parsed PT model containing 1475 places and 1234 transitions in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-11 05:03:00] [INFO ] Initial state test concluded for 3 properties.
Reduce places removed 10 places and 0 transitions.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 380 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 107 places :
Implicit places reduction removed 107 places
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 1313 transition count 1234
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 239 place count 1226 transition count 1136
Iterating global reduction 1 with 87 rules applied. Total rules applied 326 place count 1226 transition count 1136
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 336 place count 1216 transition count 1136
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 368 place count 1184 transition count 1094
Iterating global reduction 2 with 32 rules applied. Total rules applied 400 place count 1184 transition count 1094
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 2 with 20 rules applied. Total rules applied 420 place count 1174 transition count 1084
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 431 place count 1163 transition count 1073
Iterating global reduction 3 with 11 rules applied. Total rules applied 442 place count 1163 transition count 1073
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 443 place count 1162 transition count 1062
Iterating global reduction 3 with 1 rules applied. Total rules applied 444 place count 1162 transition count 1062
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 455 place count 1151 transition count 1062
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 465 place count 1141 transition count 1052
Iterating global reduction 4 with 10 rules applied. Total rules applied 475 place count 1141 transition count 1052
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 485 place count 1131 transition count 1042
Iterating global reduction 4 with 10 rules applied. Total rules applied 495 place count 1131 transition count 1042
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 505 place count 1121 transition count 1032
Iterating global reduction 4 with 10 rules applied. Total rules applied 515 place count 1121 transition count 1032
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 525 place count 1111 transition count 1022
Iterating global reduction 4 with 10 rules applied. Total rules applied 535 place count 1111 transition count 1022
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 545 place count 1101 transition count 1012
Iterating global reduction 4 with 10 rules applied. Total rules applied 555 place count 1101 transition count 1012
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 564 place count 1092 transition count 1003
Iterating global reduction 4 with 9 rules applied. Total rules applied 573 place count 1092 transition count 1003
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 582 place count 1083 transition count 994
Iterating global reduction 4 with 9 rules applied. Total rules applied 591 place count 1083 transition count 994
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 598 place count 1076 transition count 987
Iterating global reduction 4 with 7 rules applied. Total rules applied 605 place count 1076 transition count 987
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 612 place count 1069 transition count 980
Iterating global reduction 4 with 7 rules applied. Total rules applied 619 place count 1069 transition count 980
Applied a total of 619 rules in 694 ms. Remains 1069 /1465 variables (removed 396) and now considering 980/1234 (removed 254) transitions.
// Phase 1: matrix 980 rows 1069 cols
[2021-05-11 05:03:01] [INFO ] Computed 164 place invariants in 56 ms
[2021-05-11 05:03:02] [INFO ] Implicit Places using invariants in 413 ms returned [367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 517, 575, 664, 769, 770, 771, 772, 774, 775, 776, 777, 778, 779]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 440 ms to find 24 implicit places.
// Phase 1: matrix 980 rows 1045 cols
[2021-05-11 05:03:02] [INFO ] Computed 140 place invariants in 30 ms
[2021-05-11 05:03:02] [INFO ] Dead Transitions using invariants and state equation in 603 ms returned []
Starting structural reductions, iteration 1 : 1045/1465 places, 980/1234 transitions.
Applied a total of 0 rules in 16 ms. Remains 1045 /1045 variables (removed 0) and now considering 980/980 (removed 0) transitions.
// Phase 1: matrix 980 rows 1045 cols
[2021-05-11 05:03:02] [INFO ] Computed 140 place invariants in 21 ms
[2021-05-11 05:03:03] [INFO ] Dead Transitions using invariants and state equation in 492 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1045/1465 places, 980/1234 transitions.
[2021-05-11 05:03:03] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-11 05:03:03] [INFO ] Flatten gal took : 97 ms
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 05:03:03] [INFO ] Flatten gal took : 55 ms
[2021-05-11 05:03:03] [INFO ] Input system was already deterministic with 980 transitions.
Finished random walk after 3345 steps, including 5 resets, run visited all 24 properties in 33 ms. (steps per millisecond=101 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 35 out of 1045 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1045/1045 places, 980/980 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 25 places :
Implicit places reduction removed 25 places
Drop transitions removed 432 transitions
Trivial Post-agglo rules discarded 432 transitions
Performed 432 trivial Post agglomeration. Transition count delta: 432
Iterating post reduction 0 with 457 rules applied. Total rules applied 457 place count 1019 transition count 547
Reduce places removed 432 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 454 rules applied. Total rules applied 911 place count 587 transition count 525
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 933 place count 565 transition count 525
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 933 place count 565 transition count 405
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 295 rules applied. Total rules applied 1228 place count 390 transition count 405
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 33 rules applied. Total rules applied 1261 place count 390 transition count 372
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 1294 place count 357 transition count 372
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1329 place count 322 transition count 337
Iterating global reduction 5 with 35 rules applied. Total rules applied 1364 place count 322 transition count 337
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 70 rules applied. Total rules applied 1434 place count 311 transition count 278
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 6 with 47 rules applied. Total rules applied 1481 place count 264 transition count 278
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1481 place count 264 transition count 267
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 1504 place count 252 transition count 267
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1505 place count 251 transition count 256
Iterating global reduction 7 with 1 rules applied. Total rules applied 1506 place count 251 transition count 256
Discarding 11 places :
Implicit places reduction removed 11 places
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 1528 place count 240 transition count 245
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1539 place count 229 transition count 245
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 1539 place count 229 transition count 234
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1561 place count 218 transition count 234
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1572 place count 207 transition count 223
Iterating global reduction 9 with 11 rules applied. Total rules applied 1583 place count 207 transition count 223
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1594 place count 207 transition count 212
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 10 with 84 rules applied. Total rules applied 1678 place count 159 transition count 176
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 1689 place count 148 transition count 165
Iterating global reduction 10 with 11 rules applied. Total rules applied 1700 place count 148 transition count 165
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1711 place count 148 transition count 154
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 11 Pre rules applied. Total rules applied 1711 place count 148 transition count 143
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 11 with 33 rules applied. Total rules applied 1744 place count 126 transition count 143
Discarding 10 places :
Symmetric choice reduction at 11 with 10 rule applications. Total rules 1754 place count 116 transition count 133
Iterating global reduction 11 with 10 rules applied. Total rules applied 1764 place count 116 transition count 133
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1788 place count 104 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1789 place count 103 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1790 place count 102 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1791 place count 101 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1792 place count 100 transition count 117
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1793 place count 99 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1794 place count 98 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1795 place count 97 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1796 place count 96 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1797 place count 95 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1798 place count 94 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1799 place count 93 transition count 110
Applied a total of 1799 rules in 161 ms. Remains 93 /1045 variables (removed 952) and now considering 110/980 (removed 870) transitions.
// Phase 1: matrix 110 rows 93 cols
[2021-05-11 05:03:03] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-11 05:03:04] [INFO ] Implicit Places using invariants in 54 ms returned [13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 81]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 55 ms to find 12 implicit places.
[2021-05-11 05:03:04] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 110 rows 81 cols
[2021-05-11 05:03:04] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-11 05:03:04] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Starting structural reductions, iteration 1 : 81/1045 places, 110/980 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2021-05-11 05:03:04] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 110 rows 81 cols
[2021-05-11 05:03:04] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-11 05:03:04] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/1045 places, 110/980 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s67 1) (GEQ s68 1)) (AND (GEQ s67 1) (GEQ s69 1)) (AND (GEQ s57 1) (GEQ s68 1)) (AND (GEQ s57 1) (GEQ s69 1)) (AND (GEQ s64 1) (GEQ s68 1)) (AND (GEQ s64 1) (GEQ s69 1)) (AND (GEQ s58 1) (GEQ s68 1)) (AND (GEQ s58 1) (GEQ s69 1)) (AND (GEQ s60 1) (GEQ s68 1)) (AND (GEQ s60 1) (GEQ s69 1)) (AND (GEQ s62 1) (GEQ s68 1)) (AND (GEQ s62 1) (GEQ s69 1)) (AND (GEQ s61 1) (GEQ s69 1)) (AND (GEQ s66 1) (GEQ s68 1)) (AND (GEQ s66 1) (GEQ s69 1)) (AND (GEQ s59 1) (GEQ s68 1)) (AND (GEQ s59 1) (GEQ s69 1)) (AND (GEQ s65 1) (GEQ s68 1)) (AND (GEQ s65 1) (GEQ s69 1)) (AND (GEQ s63 1) (GEQ s68 1)) (AND (GEQ s63 1) (GEQ s69 1)) (AND (GEQ s61 1) (GEQ s68 1))), p1:(OR (GEQ s53 1) (GEQ s54 1) (GEQ s55 1) (GEQ s56 1) (GEQ s45 1) (GEQ s46 1) (GEQ s47 1) (GEQ s48 1) (GEQ s49 1) (GEQ s50 1) (GEQ s51 1) (GEQ s52 1) (GEQ s37 1) (GEQ s38 1) (GEQ s39 1) (GEQ s40 1) (GEQ s41 1) (GEQ s42 1) (GEQ s43 1) (GEQ s44 1) (GEQ s35 1) (GEQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4845 reset in 447 ms.
Product exploration explored 100000 steps with 4852 reset in 384 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 81 transition count 110
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G (NOT p1))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4847 reset in 299 ms.
Product exploration explored 100000 steps with 4836 reset in 313 ms.
[2021-05-11 05:03:06] [INFO ] Flatten gal took : 5 ms
[2021-05-11 05:03:06] [INFO ] Flatten gal took : 5 ms
[2021-05-11 05:03:06] [INFO ] Time to serialize gal into /tmp/LTL1741387568873536913.gal : 64 ms
[2021-05-11 05:03:06] [INFO ] Time to serialize properties into /tmp/LTL10162939516662787198.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/LTL1741387568873536913.gal, -t, CGAL, -LTL, /tmp/LTL10162939516662787198.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/LTL1741387568873536913.gal -t CGAL -LTL /tmp/LTL10162939516662787198.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((((((((((((((cg0_10>=1)&&(g0_0>=1))||((cg0_10>=1)&&(g0_1>=1)))||((cg0_0>=1)&&(g0_0>=1)))||((cg0_0>=1)&&(g0_1>=1)))||((cg0_7>=1)&&(g0_0>=1)))||((cg0_7>=1)&&(g0_1>=1)))||((cg0_1>=1)&&(g0_0>=1)))||((cg0_1>=1)&&(g0_1>=1)))||((cg0_3>=1)&&(g0_0>=1)))||((cg0_3>=1)&&(g0_1>=1)))||((cg0_5>=1)&&(g0_0>=1)))||((cg0_5>=1)&&(g0_1>=1)))||((cg0_4>=1)&&(g0_1>=1)))||((cg0_9>=1)&&(g0_0>=1)))||((cg0_9>=1)&&(g0_1>=1)))||((cg0_2>=1)&&(g0_0>=1)))||((cg0_2>=1)&&(g0_1>=1)))||((cg0_8>=1)&&(g0_0>=1)))||((cg0_8>=1)&&(g0_1>=1)))||((cg0_6>=1)&&(g0_0>=1)))||((cg0_6>=1)&&(g0_1>=1)))||((cg0_4>=1)&&(g0_0>=1)))"))||(G("((((((((((((((((((((((c6_7_1>=1)||(c6_8_1>=1))||(c6_9_1>=1))||(c6_10_1>=1))||(c6_10_0>=1))||(c6_0_1>=1))||(c6_1_1>=1))||(c6_2_1>=1))||(c6_3_1>=1))||(c6_4_1>=1))||(c6_5_1>=1))||(c6_6_1>=1))||(c6_2_0>=1))||(c6_3_0>=1))||(c6_4_0>=1))||(c6_5_0>=1))||(c6_6_0>=1))||(c6_7_0>=1))||(c6_8_0>=1))||(c6_9_0>=1))||(c6_0_0>=1))||(c6_1_0>=1))"))))
Formula 0 simplified : !(F"(((((((((((((((((((((((cg0_10>=1)&&(g0_0>=1))||((cg0_10>=1)&&(g0_1>=1)))||((cg0_0>=1)&&(g0_0>=1)))||((cg0_0>=1)&&(g0_1>=1)))||((cg0_7>=1)&&(g0_0>=1)))||((cg0_7>=1)&&(g0_1>=1)))||((cg0_1>=1)&&(g0_0>=1)))||((cg0_1>=1)&&(g0_1>=1)))||((cg0_3>=1)&&(g0_0>=1)))||((cg0_3>=1)&&(g0_1>=1)))||((cg0_5>=1)&&(g0_0>=1)))||((cg0_5>=1)&&(g0_1>=1)))||((cg0_4>=1)&&(g0_1>=1)))||((cg0_9>=1)&&(g0_0>=1)))||((cg0_9>=1)&&(g0_1>=1)))||((cg0_2>=1)&&(g0_0>=1)))||((cg0_2>=1)&&(g0_1>=1)))||((cg0_8>=1)&&(g0_0>=1)))||((cg0_8>=1)&&(g0_1>=1)))||((cg0_6>=1)&&(g0_0>=1)))||((cg0_6>=1)&&(g0_1>=1)))||((cg0_4>=1)&&(g0_0>=1)))" | G"((((((((((((((((((((((c6_7_1>=1)||(c6_8_1>=1))||(c6_9_1>=1))||(c6_10_1>=1))||(c6_10_0>=1))||(c6_0_1>=1))||(c6_1_1>=1))||(c6_2_1>=1))||(c6_3_1>=1))||(c6_4_1>=1))||(c6_5_1>=1))||(c6_6_1>=1))||(c6_2_0>=1))||(c6_3_0>=1))||(c6_4_0>=1))||(c6_5_0>=1))||(c6_6_0>=1))||(c6_7_0>=1))||(c6_8_0>=1))||(c6_9_0>=1))||(c6_0_0>=1))||(c6_1_0>=1))")
Detected timeout of ITS tools.
[2021-05-11 05:03:21] [INFO ] Flatten gal took : 5 ms
[2021-05-11 05:03:21] [INFO ] Applying decomposition
[2021-05-11 05:03:21] [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/graph8801524004109995360.txt, -o, /tmp/graph8801524004109995360.bin, -w, /tmp/graph8801524004109995360.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/graph8801524004109995360.bin, -l, -1, -v, -w, /tmp/graph8801524004109995360.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 05:03:21] [INFO ] Decomposing Gal with order
[2021-05-11 05:03:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 05:03:21] [INFO ] Removed a total of 76 redundant transitions.
[2021-05-11 05:03:21] [INFO ] Flatten gal took : 31 ms
[2021-05-11 05:03:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-11 05:03:21] [INFO ] Time to serialize gal into /tmp/LTL15963659014168222238.gal : 3 ms
[2021-05-11 05:03:21] [INFO ] Time to serialize properties into /tmp/LTL11489989460344647264.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/LTL15963659014168222238.gal, -t, CGAL, -LTL, /tmp/LTL11489989460344647264.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/LTL15963659014168222238.gal -t CGAL -LTL /tmp/LTL11489989460344647264.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((((((((((((((u8.cg0_10>=1)&&(u11.g0_0>=1))||((u8.cg0_10>=1)&&(u12.g0_1>=1)))||((u10.cg0_0>=1)&&(u11.g0_0>=1)))||((u10.cg0_0>=1)&&(u12.g0_1>=1)))||((u5.cg0_7>=1)&&(u11.g0_0>=1)))||((u5.cg0_7>=1)&&(u12.g0_1>=1)))||((u1.cg0_1>=1)&&(u11.g0_0>=1)))||((u1.cg0_1>=1)&&(u12.g0_1>=1)))||((u3.cg0_3>=1)&&(u11.g0_0>=1)))||((u3.cg0_3>=1)&&(u12.g0_1>=1)))||((u4.cg0_5>=1)&&(u11.g0_0>=1)))||((u4.cg0_5>=1)&&(u12.g0_1>=1)))||((u9.cg0_4>=1)&&(u12.g0_1>=1)))||((u7.cg0_9>=1)&&(u11.g0_0>=1)))||((u7.cg0_9>=1)&&(u12.g0_1>=1)))||((u2.cg0_2>=1)&&(u11.g0_0>=1)))||((u2.cg0_2>=1)&&(u12.g0_1>=1)))||((u6.cg0_8>=1)&&(u11.g0_0>=1)))||((u6.cg0_8>=1)&&(u12.g0_1>=1)))||((u0.cg0_6>=1)&&(u11.g0_0>=1)))||((u0.cg0_6>=1)&&(u12.g0_1>=1)))||((u9.cg0_4>=1)&&(u11.g0_0>=1)))"))||(G("((((((((((((((((((((((u5.c6_7_1>=1)||(u6.c6_8_1>=1))||(u7.c6_9_1>=1))||(u8.c6_10_1>=1))||(u8.c6_10_0>=1))||(u10.c6_0_1>=1))||(u1.c6_1_1>=1))||(u2.c6_2_1>=1))||(u3.c6_3_1>=1))||(u9.c6_4_1>=1))||(u4.c6_5_1>=1))||(u0.c6_6_1>=1))||(u2.c6_2_0>=1))||(u3.c6_3_0>=1))||(u9.c6_4_0>=1))||(u4.c6_5_0>=1))||(u0.c6_6_0>=1))||(u5.c6_7_0>=1))||(u6.c6_8_0>=1))||(u7.c6_9_0>=1))||(u10.c6_0_0>=1))||(u1.c6_1_0>=1))"))))
Formula 0 simplified : !(F"(((((((((((((((((((((((u8.cg0_10>=1)&&(u11.g0_0>=1))||((u8.cg0_10>=1)&&(u12.g0_1>=1)))||((u10.cg0_0>=1)&&(u11.g0_0>=1)))||((u10.cg0_0>=1)&&(u12.g0_1>=1)))||((u5.cg0_7>=1)&&(u11.g0_0>=1)))||((u5.cg0_7>=1)&&(u12.g0_1>=1)))||((u1.cg0_1>=1)&&(u11.g0_0>=1)))||((u1.cg0_1>=1)&&(u12.g0_1>=1)))||((u3.cg0_3>=1)&&(u11.g0_0>=1)))||((u3.cg0_3>=1)&&(u12.g0_1>=1)))||((u4.cg0_5>=1)&&(u11.g0_0>=1)))||((u4.cg0_5>=1)&&(u12.g0_1>=1)))||((u9.cg0_4>=1)&&(u12.g0_1>=1)))||((u7.cg0_9>=1)&&(u11.g0_0>=1)))||((u7.cg0_9>=1)&&(u12.g0_1>=1)))||((u2.cg0_2>=1)&&(u11.g0_0>=1)))||((u2.cg0_2>=1)&&(u12.g0_1>=1)))||((u6.cg0_8>=1)&&(u11.g0_0>=1)))||((u6.cg0_8>=1)&&(u12.g0_1>=1)))||((u0.cg0_6>=1)&&(u11.g0_0>=1)))||((u0.cg0_6>=1)&&(u12.g0_1>=1)))||((u9.cg0_4>=1)&&(u11.g0_0>=1)))" | G"((((((((((((((((((((((u5.c6_7_1>=1)||(u6.c6_8_1>=1))||(u7.c6_9_1>=1))||(u8.c6_10_1>=1))||(u8.c6_10_0>=1))||(u10.c6_0_1>=1))||(u1.c6_1_1>=1))||(u2.c6_2_1>=1))||(u3.c6_3_1>=1))||(u9.c6_4_1>=1))||(u4.c6_5_1>=1))||(u0.c6_6_1>=1))||(u2.c6_2_0>=1))||(u3.c6_3_0>=1))||(u9.c6_4_0>=1))||(u4.c6_5_0>=1))||(u0.c6_6_0>=1))||(u5.c6_7_0>=1))||(u6.c6_8_0>=1))||(u7.c6_9_0>=1))||(u10.c6_0_0>=1))||(u1.c6_1_0>=1))")
Reverse transition relation is NOT exact ! Due to transitions t388_t410_t272_t444_t479_t501_t556_t589_t590, t399_t421_t272_t444_t479_t501_t556_t589_t590, t389_t411_t273_t445_t479_t501_t556_t589_t590, t400_t422_t273_t445_t479_t501_t556_t589_t590, t390_t412_t274_t446_t479_t501_t556_t589_t590, t401_t423_t274_t446_t479_t501_t556_t589_t590, t391_t413_t275_t447_t479_t501_t556_t589_t590, t402_t424_t275_t447_t479_t501_t556_t589_t590, t392_t414_t276_t448_t479_t501_t556_t589_t590, t403_t425_t276_t448_t479_t501_t556_t589_t590, t393_t415_t277_t449_t479_t501_t556_t589_t590, t404_t426_t277_t449_t479_t501_t556_t589_t590, t394_t416_t278_t450_t479_t501_t556_t589_t590, t405_t427_t278_t450_t479_t501_t556_t589_t590, t395_t417_t279_t451_t479_t501_t556_t589_t590, t406_t428_t279_t451_t479_t501_t556_t589_t590, t396_t418_t280_t452_t479_t501_t556_t589_t590, t407_t429_t280_t452_t479_t501_t556_t589_t590, t397_t419_t281_t453_t479_t501_t556_t589_t590, t408_t430_t281_t453_t479_t501_t556_t589_t590, t398_t420_t282_t454_t479_t501_t556_t589_t590, t409_t431_t282_t454_t479_t501_t556_t589_t590, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/88/22/110
Computing Next relation with stutter on 55 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
90 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.909857,44912,1,0,57081,7525,888,56719,306,66923,90963
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-01 finished in 18595 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((((p0 U G(p1)) U p2) U p0)||X(p2)))], workingDir=/home/mcc/execution]
Support contains 99 out of 1045 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1045/1045 places, 980/980 transitions.
Discarding 25 places :
Implicit places reduction removed 25 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1020 transition count 980
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 71 place count 974 transition count 934
Iterating global reduction 1 with 46 rules applied. Total rules applied 117 place count 974 transition count 934
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 130 place count 961 transition count 911
Iterating global reduction 1 with 13 rules applied. Total rules applied 143 place count 961 transition count 911
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 145 place count 960 transition count 910
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 956 transition count 906
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 956 transition count 906
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 157 place count 952 transition count 902
Iterating global reduction 2 with 4 rules applied. Total rules applied 161 place count 952 transition count 902
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 163 place count 950 transition count 900
Iterating global reduction 2 with 2 rules applied. Total rules applied 165 place count 950 transition count 900
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 167 place count 948 transition count 898
Iterating global reduction 2 with 2 rules applied. Total rules applied 169 place count 948 transition count 898
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 947 transition count 897
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 947 transition count 897
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 946 transition count 896
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 946 transition count 896
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 945 transition count 895
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 945 transition count 895
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 944 transition count 894
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 944 transition count 894
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 178 place count 943 transition count 893
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 943 transition count 893
Applied a total of 179 rules in 555 ms. Remains 943 /1045 variables (removed 102) and now considering 893/980 (removed 87) transitions.
// Phase 1: matrix 893 rows 943 cols
[2021-05-11 05:03:22] [INFO ] Computed 114 place invariants in 8 ms
[2021-05-11 05:03:23] [INFO ] Implicit Places using invariants in 219 ms returned [110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 654]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 221 ms to find 23 implicit places.
// Phase 1: matrix 893 rows 920 cols
[2021-05-11 05:03:23] [INFO ] Computed 91 place invariants in 4 ms
[2021-05-11 05:03:23] [INFO ] Dead Transitions using invariants and state equation in 424 ms returned []
Starting structural reductions, iteration 1 : 920/1045 places, 893/980 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 899 transition count 872
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 899 transition count 872
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 889 transition count 852
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 889 transition count 852
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 879 transition count 842
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 879 transition count 842
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 869 transition count 832
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 869 transition count 832
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 859 transition count 822
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 859 transition count 822
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 849 transition count 812
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 849 transition count 812
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 839 transition count 802
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 839 transition count 802
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 829 transition count 792
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 829 transition count 792
Applied a total of 182 rules in 185 ms. Remains 829 /920 variables (removed 91) and now considering 792/893 (removed 101) transitions.
// Phase 1: matrix 792 rows 829 cols
[2021-05-11 05:03:23] [INFO ] Computed 91 place invariants in 4 ms
[2021-05-11 05:03:23] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 792 rows 829 cols
[2021-05-11 05:03:23] [INFO ] Computed 91 place invariants in 5 ms
[2021-05-11 05:03:24] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 829/1045 places, 792/980 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-03 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 7}, { cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 8}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}, { cond=(AND p2 p1), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 6}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(OR (AND (GEQ s736 1) (GEQ s758 1)) (AND (GEQ s734 1) (GEQ s767 1)) (AND (GEQ s737 1) (GEQ s770 1)) (AND (GEQ s740 1) (GEQ s773 1)) (AND (GEQ s732 1) (GEQ s765 1)) (AND (GEQ s736 1) (GEQ s769 1)) (AND (GEQ s731 1) (GEQ s753 1)) (AND (GEQ s733 1) (GEQ s755 1)) (AND (GEQ s735 1) (GEQ s757 1)) (AND (GEQ s737 1) (GEQ s759 1)) (AND (GEQ s739 1) (GEQ s761 1)) (AND (GEQ s732 1) (GEQ s754 1)) (AND (GEQ s740 1) (GEQ s762 1)) (AND (GEQ s730 1) (GEQ s763 1)) (AND (GEQ s733 1) (GEQ s766 1)) (AND (GEQ s738 1) (GEQ s771 1)) (AND (GEQ s734 1) (GEQ s756 1)) (AND (GEQ s738 1) (GEQ s760 1)) (AND (GEQ s739 1) (GEQ s772 1)) (AND (GEQ s731 1) (GEQ s764 1)) (AND (GEQ s735 1) (GEQ s768 1)) (AND (GEQ s730 1) (GEQ s752 1))), p2:(OR (AND (GEQ s247 1) (GEQ s293 1)) (AND (GEQ s262 1) (GEQ s297 1)) (AND (GEQ s257 1) (GEQ s292 1)) (AND (GEQ s259 1) (GEQ s294 1)) (AND (GEQ s264 1) (GEQ s299 1)) (AND (GEQ s265 1) (GEQ s300 1)) (AND (GEQ s244 1) (GEQ s290 1)) (AND (GEQ s246 1) (GEQ s292 1)) (AND (GEQ s248 1) (GEQ s294 1)) (AND (GEQ s250 1) (GEQ s296 1)) (AND (GEQ s252 1) (GEQ s298 1)) (AND (GEQ s254 1) (GEQ s300 1)) (AND (GEQ s258 1) (GEQ s293 1)) (AND (GEQ s251 1) (GEQ s297 1)) (AND (GEQ s255 1) (GEQ s290 1)) (AND (GEQ s261 1) (GEQ s296 1)) (AND (GEQ s263 1) (GEQ s298 1)) (AND (GEQ s245 1) (GEQ s291 1)) (AND (GEQ s256 1) (GEQ s291 1)) (AND (GEQ s249 1) (GEQ s295 1)) (AND (GEQ s260 1) (GEQ s295 1)) (AND (GEQ s253 1) (GEQ s299 1))), p1:(OR (AND (GEQ s78 1) (GEQ s133 1)) (AND (GEQ s83 1) (GEQ s138 1)) (AND (GEQ s86 1) (GEQ s141 1)) (AND (GEQ s85 1) (GEQ s129 1)) (AND (GEQ s87 1) (GEQ s131 1)) (AND (GEQ s77 1) (GEQ s121 1)) (AND (GEQ s79 1) (GEQ s123 1)) (AND (GEQ s80 1) (GEQ s124 1)) (AND (GEQ s82 1) (GEQ s126 1)) (AND (GEQ s77 1) (GEQ s132 1)) (AND (GEQ s81 1) (GEQ s136 1)) (AND (GEQ s85 1) (GEQ s140 1)) (AND (GEQ s79 1) (GEQ s134 1)) (AND (GEQ s82 1) (GEQ s137 1)) (AND (GEQ s87 1) (GEQ s142 1)) (AND (GEQ s84 1) (GEQ s128 1)) (AND (GEQ s86 1) (GEQ s130 1)) (AND (GEQ s78 1) (GEQ s122 1)) (AND (GEQ s81 1) (GEQ s125 1)) (AND (GEQ s83 1) (GEQ s127 1)) (AND (GEQ s80 1) (GEQ s135 1)) (AND (GEQ s84 1) (GEQ s139 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-03 finished in 2394 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 33 out of 1045 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1045/1045 places, 980/980 transitions.
Discarding 25 places :
Implicit places reduction removed 25 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1020 transition count 980
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 71 place count 974 transition count 934
Iterating global reduction 1 with 46 rules applied. Total rules applied 117 place count 974 transition count 934
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 142 place count 949 transition count 889
Iterating global reduction 1 with 25 rules applied. Total rules applied 167 place count 949 transition count 889
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 180 place count 937 transition count 888
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 203 place count 914 transition count 855
Iterating global reduction 2 with 23 rules applied. Total rules applied 226 place count 914 transition count 855
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 248 place count 892 transition count 833
Iterating global reduction 2 with 22 rules applied. Total rules applied 270 place count 892 transition count 833
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 284 place count 885 transition count 826
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 288 place count 881 transition count 822
Iterating global reduction 3 with 4 rules applied. Total rules applied 292 place count 881 transition count 822
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 296 place count 877 transition count 818
Iterating global reduction 3 with 4 rules applied. Total rules applied 300 place count 877 transition count 818
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 304 place count 875 transition count 816
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 306 place count 873 transition count 814
Iterating global reduction 4 with 2 rules applied. Total rules applied 308 place count 873 transition count 814
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 310 place count 871 transition count 812
Iterating global reduction 4 with 2 rules applied. Total rules applied 312 place count 871 transition count 812
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 314 place count 870 transition count 811
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 315 place count 869 transition count 810
Iterating global reduction 5 with 1 rules applied. Total rules applied 316 place count 869 transition count 810
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 317 place count 868 transition count 809
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 868 transition count 809
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 319 place count 867 transition count 808
Iterating global reduction 5 with 1 rules applied. Total rules applied 320 place count 867 transition count 808
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 321 place count 866 transition count 807
Iterating global reduction 5 with 1 rules applied. Total rules applied 322 place count 866 transition count 807
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 323 place count 865 transition count 806
Iterating global reduction 5 with 1 rules applied. Total rules applied 324 place count 865 transition count 806
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 326 place count 864 transition count 805
Applied a total of 326 rules in 630 ms. Remains 864 /1045 variables (removed 181) and now considering 805/980 (removed 175) transitions.
// Phase 1: matrix 805 rows 864 cols
[2021-05-11 05:03:25] [INFO ] Computed 92 place invariants in 4 ms
[2021-05-11 05:03:25] [INFO ] Implicit Places using invariants in 227 ms returned [176, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 620, 764]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 232 ms to find 14 implicit places.
// Phase 1: matrix 805 rows 850 cols
[2021-05-11 05:03:25] [INFO ] Computed 78 place invariants in 3 ms
[2021-05-11 05:03:25] [INFO ] Dead Transitions using invariants and state equation in 338 ms returned []
Starting structural reductions, iteration 1 : 850/1045 places, 805/980 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 829 transition count 784
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 829 transition count 784
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 819 transition count 764
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 819 transition count 764
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 809 transition count 754
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 809 transition count 754
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 799 transition count 744
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 799 transition count 744
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 789 transition count 734
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 789 transition count 734
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 779 transition count 724
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 779 transition count 724
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 769 transition count 714
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 769 transition count 714
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 759 transition count 704
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 759 transition count 704
Applied a total of 182 rules in 148 ms. Remains 759 /850 variables (removed 91) and now considering 704/805 (removed 101) transitions.
// Phase 1: matrix 704 rows 759 cols
[2021-05-11 05:03:26] [INFO ] Computed 78 place invariants in 4 ms
[2021-05-11 05:03:26] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 704 rows 759 cols
[2021-05-11 05:03:26] [INFO ] Computed 78 place invariants in 4 ms
[2021-05-11 05:03:26] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 759/1045 places, 704/980 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s90 1) (LT s167 1)) (OR (LT s89 1) (LT s155 1)) (OR (LT s92 1) (LT s158 1)) (OR (LT s97 1) (LT s163 1)) (OR (LT s90 1) (LT s156 1)) (OR (LT s94 1) (LT s160 1)) (OR (LT s98 1) (LT s164 1)) (OR (LT s89 1) (LT s166 1)) (OR (LT s91 1) (LT s168 1)) (OR (LT s93 1) (LT s170 1)) (OR (LT s95 1) (LT s172 1)) (OR (LT s97 1) (LT s174 1)) (OR (LT s94 1) (LT s171 1)) (OR (LT s88 1) (LT s154 1)) (OR (LT s93 1) (LT s159 1)) (OR (LT s96 1) (LT s162 1)) (OR (LT s88 1) (LT s165 1)) (OR (LT s92 1) (LT s169 1)) (OR (LT s96 1) (LT s173 1)) (OR (LT s91 1) (LT s157 1)) (OR (LT s95 1) (LT s161 1)) (OR (LT s98 1) (LT s175 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 446 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-04 finished in 2093 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0) U (G(F(p2))||p1))))], workingDir=/home/mcc/execution]
Support contains 77 out of 1045 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1045/1045 places, 980/980 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 369 transitions
Trivial Post-agglo rules discarded 369 transitions
Performed 369 trivial Post agglomeration. Transition count delta: 369
Iterating post reduction 0 with 372 rules applied. Total rules applied 372 place count 1041 transition count 610
Reduce places removed 369 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 388 rules applied. Total rules applied 760 place count 672 transition count 591
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 779 place count 653 transition count 591
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 779 place count 653 transition count 469
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 299 rules applied. Total rules applied 1078 place count 476 transition count 469
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 33 rules applied. Total rules applied 1111 place count 476 transition count 436
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 1144 place count 443 transition count 436
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 1180 place count 407 transition count 390
Iterating global reduction 5 with 36 rules applied. Total rules applied 1216 place count 407 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 5 with 37 rules applied. Total rules applied 1253 place count 406 transition count 354
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 36 rules applied. Total rules applied 1289 place count 371 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1290 place count 370 transition count 353
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 1290 place count 370 transition count 342
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1312 place count 359 transition count 342
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1314 place count 357 transition count 320
Iterating global reduction 8 with 2 rules applied. Total rules applied 1316 place count 357 transition count 320
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
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 55 rules applied. Total rules applied 1371 place count 335 transition count 287
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1393 place count 313 transition count 287
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 11 Pre rules applied. Total rules applied 1393 place count 313 transition count 276
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1415 place count 302 transition count 276
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 1426 place count 291 transition count 265
Iterating global reduction 10 with 11 rules applied. Total rules applied 1437 place count 291 transition count 265
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 10 with 21 rules applied. Total rules applied 1458 place count 291 transition count 244
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1468 place count 281 transition count 244
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 12 with 73 rules applied. Total rules applied 1541 place count 244 transition count 208
Discarding 11 places :
Symmetric choice reduction at 12 with 11 rule applications. Total rules 1552 place count 233 transition count 197
Ensure Unique test removed 11 places
Iterating global reduction 12 with 22 rules applied. Total rules applied 1574 place count 222 transition count 197
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 12 with 22 rules applied. Total rules applied 1596 place count 222 transition count 175
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 13 with 11 rules applied. Total rules applied 1607 place count 211 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1608 place count 210 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1609 place count 209 transition count 173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1610 place count 208 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1611 place count 207 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1612 place count 206 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1613 place count 205 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1614 place count 204 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1615 place count 203 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1616 place count 202 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1617 place count 201 transition count 165
Applied a total of 1617 rules in 92 ms. Remains 201 /1045 variables (removed 844) and now considering 165/980 (removed 815) transitions.
// Phase 1: matrix 165 rows 201 cols
[2021-05-11 05:03:26] [INFO ] Computed 47 place invariants in 1 ms
[2021-05-11 05:03:27] [INFO ] Implicit Places using invariants in 87 ms returned [11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 110, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 189]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 89 ms to find 24 implicit places.
[2021-05-11 05:03:27] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 165 rows 177 cols
[2021-05-11 05:03:27] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-11 05:03:27] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Starting structural reductions, iteration 1 : 177/1045 places, 165/980 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.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 22 rules applied. Total rules applied 33 place count 166 transition count 143
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 44 place count 155 transition count 143
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 44 place count 155 transition count 121
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 88 place count 133 transition count 121
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 98 place count 123 transition count 111
Iterating global reduction 3 with 10 rules applied. Total rules applied 108 place count 123 transition count 111
Applied a total of 108 rules in 7 ms. Remains 123 /177 variables (removed 54) and now considering 111/165 (removed 54) transitions.
// Phase 1: matrix 111 rows 123 cols
[2021-05-11 05:03:27] [INFO ] Computed 23 place invariants in 0 ms
[2021-05-11 05:03:27] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 111 rows 123 cols
[2021-05-11 05:03:27] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-11 05:03:27] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 123/1045 places, 111/980 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-05 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s59 1) (GEQ s81 1)) (AND (GEQ s57 1) (GEQ s79 1)) (AND (GEQ s71 1) (GEQ s93 1)) (AND (GEQ s73 1) (GEQ s95 1)) (AND (GEQ s75 1) (GEQ s97 1)) (AND (GEQ s67 1) (GEQ s89 1)) (AND (GEQ s69 1) (GEQ s91 1)) (AND (GEQ s61 1) (GEQ s83 1)) (AND (GEQ s63 1) (GEQ s85 1)) (AND (GEQ s65 1) (GEQ s87 1)) (AND (GEQ s55 1) (GEQ s77 1)) (AND (GEQ s56 1) (GEQ s78 1)) (AND (GEQ s58 1) (GEQ s80 1)) (AND (GEQ s60 1) (GEQ s82 1)) (AND (GEQ s70 1) (GEQ s92 1)) (AND (GEQ s72 1) (GEQ s94 1)) (AND (GEQ s74 1) (GEQ s96 1)) (AND (GEQ s76 1) (GEQ s98 1)) (AND (GEQ s66 1) (GEQ s88 1)) (AND (GEQ s68 1) (GEQ s90 1)) (AND (GEQ s62 1) (GEQ s84 1)) (AND (GEQ s64 1) (GEQ s86 1))), p0:(OR (GEQ s118 1) (GEQ s117 1) (GEQ s120 1) (GEQ s119 1) (GEQ s114 1) (GEQ s113 1) (GEQ s116 1) (GEQ s115 1) (GEQ s112 1) (GEQ s122 1) (GEQ s121 1)), p2:(OR (AND (OR (AND (GEQ s59 1) (GEQ s81 1)) (AND (GEQ s57 1) (GEQ s79 1)) (AND (GEQ s71 1) (GEQ s93 1)) (AND (GEQ s73 1) (GEQ s95 1)) (AND (GEQ s75 1) (GEQ s97 1)) (AND (GEQ s67 1) (GEQ s89 1)) (AND (GEQ s69 1) (GEQ s91 1)) (AND (GEQ s61 1) (GEQ s83 1)) (AND (GEQ s63 1) (GEQ s85 1)) (AND (GEQ s65 1) (GEQ s87 1)) (AND (GEQ s55 1) (GEQ s77 1)) (AND (GEQ s56 1) (GEQ s78 1)) (AND (GEQ s58 1) (GEQ s80 1)) (AND (GEQ s60 1) (GEQ s82 1)) (AND (GEQ s70 1) (GEQ s92 1)) (AND (GEQ s72 1) (GEQ s94 1)) (AND (GEQ s74 1) (GEQ s96 1)) (AND (GEQ s76 1) (GEQ s98 1)) (AND (GEQ s66 1) (GEQ s88 1)) (AND (GEQ s68 1) (GEQ s90 1)) (AND (GEQ s62 1) (GEQ s84 1)) (AND (GEQ s64 1) (GEQ s86 1))) (OR (GEQ s18 1) (GEQ s17 1) (GEQ s20 1) (GEQ s19 1) (GEQ s22 1) (GEQ s21 1) (GEQ s24 1) (GEQ s23 1) (GEQ s27 1) (GEQ s25 1) (GEQ s28 1) (GEQ s26 1) (GEQ s31 1) (GEQ s32 1) (GEQ s29 1) (GEQ s30 1) (GEQ s12 1) (GEQ s11 1) (GEQ s14 1) (GEQ s13 1) (GEQ s16 1) (GEQ s15 1))) (AND (GEQ s59 1) (GEQ s81 1)) (AND (GEQ s57 1) (GEQ s79 1)) (AND (GEQ s71 1) (GEQ s93 1)) (AND (GEQ s73 1) (GEQ s95 1)) (AND (GEQ s75 1) (GEQ s97 1)) (AND (GEQ s67 1) (GEQ s89 1)) (AND (GEQ s69 1) (GEQ s91 1)) (AND (GEQ s61 1) (GEQ s83 1)) (AND (GEQ s63 1) (GEQ s85 1)) (AND (GEQ s65 1) (GEQ s87 1)) (AND (GEQ s55 1) (GEQ s77 1)) (AND (GEQ s56 1) (GEQ s78 1)) (AND (GEQ s58 1) (GEQ s80 1)) (AND (GEQ s60 1) (GEQ s82 1)) (AND (GEQ s70 1) (GEQ s92 1)) (AND (GEQ s72 1) (GEQ s94 1)) (AND (GEQ s74 1) (GEQ s96 1)) (AND (GEQ s76 1) (GEQ s98 1)) (AND (GEQ s66 1) (GEQ s88 1)) (AND (GEQ s68 1) (GEQ s90 1)) (AND (GEQ s62 1) (GEQ s84 1)) (AND (GEQ s64 1) (GEQ s86 1)))], 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]]
Stuttering criterion allowed to conclude after 6933 steps with 511 reset in 38 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-05 finished in 594 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 11 out of 1045 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1045/1045 places, 980/980 transitions.
Discarding 25 places :
Implicit places reduction removed 25 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1020 transition count 980
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 82 place count 963 transition count 923
Iterating global reduction 1 with 57 rules applied. Total rules applied 139 place count 963 transition count 923
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 164 place count 938 transition count 878
Iterating global reduction 1 with 25 rules applied. Total rules applied 189 place count 938 transition count 878
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 202 place count 926 transition count 877
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 225 place count 903 transition count 844
Iterating global reduction 2 with 23 rules applied. Total rules applied 248 place count 903 transition count 844
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 281 place count 870 transition count 811
Iterating global reduction 2 with 33 rules applied. Total rules applied 314 place count 870 transition count 811
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 2 with 36 rules applied. Total rules applied 350 place count 852 transition count 793
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 354 place count 848 transition count 789
Iterating global reduction 3 with 4 rules applied. Total rules applied 358 place count 848 transition count 789
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 362 place count 844 transition count 785
Iterating global reduction 3 with 4 rules applied. Total rules applied 366 place count 844 transition count 785
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 370 place count 842 transition count 783
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 372 place count 840 transition count 781
Iterating global reduction 4 with 2 rules applied. Total rules applied 374 place count 840 transition count 781
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 376 place count 838 transition count 779
Iterating global reduction 4 with 2 rules applied. Total rules applied 378 place count 838 transition count 779
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 380 place count 837 transition count 778
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 381 place count 836 transition count 777
Iterating global reduction 5 with 1 rules applied. Total rules applied 382 place count 836 transition count 777
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 383 place count 835 transition count 776
Iterating global reduction 5 with 1 rules applied. Total rules applied 384 place count 835 transition count 776
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 385 place count 834 transition count 775
Iterating global reduction 5 with 1 rules applied. Total rules applied 386 place count 834 transition count 775
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 387 place count 833 transition count 774
Iterating global reduction 5 with 1 rules applied. Total rules applied 388 place count 833 transition count 774
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 389 place count 832 transition count 773
Iterating global reduction 5 with 1 rules applied. Total rules applied 390 place count 832 transition count 773
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 392 place count 831 transition count 772
Applied a total of 392 rules in 255 ms. Remains 831 /1045 variables (removed 214) and now considering 772/980 (removed 208) transitions.
// Phase 1: matrix 772 rows 831 cols
[2021-05-11 05:03:27] [INFO ] Computed 81 place invariants in 5 ms
[2021-05-11 05:03:27] [INFO ] Implicit Places using invariants in 216 ms returned [143, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 587, 731]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 217 ms to find 14 implicit places.
// Phase 1: matrix 772 rows 817 cols
[2021-05-11 05:03:27] [INFO ] Computed 67 place invariants in 4 ms
[2021-05-11 05:03:28] [INFO ] Dead Transitions using invariants and state equation in 345 ms returned []
Starting structural reductions, iteration 1 : 817/1045 places, 772/980 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 796 transition count 751
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 796 transition count 751
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 786 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 786 transition count 731
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 776 transition count 721
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 776 transition count 721
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 766 transition count 711
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 766 transition count 711
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 756 transition count 701
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 756 transition count 701
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 746 transition count 691
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 746 transition count 691
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 736 transition count 681
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 736 transition count 681
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 726 transition count 671
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 726 transition count 671
Applied a total of 182 rules in 164 ms. Remains 726 /817 variables (removed 91) and now considering 671/772 (removed 101) transitions.
// Phase 1: matrix 671 rows 726 cols
[2021-05-11 05:03:28] [INFO ] Computed 67 place invariants in 3 ms
[2021-05-11 05:03:28] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 671 rows 726 cols
[2021-05-11 05:03:28] [INFO ] Computed 67 place invariants in 3 ms
[2021-05-11 05:03:28] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 726/1045 places, 671/980 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s94 1) (GEQ s89 1) (GEQ s92 1) (GEQ s90 1) (GEQ s95 1) (GEQ s97 1) (GEQ s88 1) (GEQ s93 1) (GEQ s98 1) (GEQ s91 1) (GEQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 246 reset in 240 ms.
Product exploration explored 100000 steps with 246 reset in 224 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 247 reset in 207 ms.
Product exploration explored 100000 steps with 245 reset in 241 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 726 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 726/726 places, 671/671 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 726 transition count 671
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 726 transition count 670
Performed 289 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 289 Pre rules applied. Total rules applied 247 place count 726 transition count 824
Deduced a syphon composed of 535 places in 1 ms
Iterating global reduction 2 with 289 rules applied. Total rules applied 536 place count 726 transition count 824
Discarding 356 places :
Symmetric choice reduction at 2 with 356 rule applications. Total rules 892 place count 370 transition count 468
Deduced a syphon composed of 179 places in 0 ms
Iterating global reduction 2 with 356 rules applied. Total rules applied 1248 place count 370 transition count 468
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 1283 place count 370 transition count 468
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 1330 place count 323 transition count 421
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 1377 place count 323 transition count 421
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 178 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1388 place count 323 transition count 443
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1399 place count 312 transition count 421
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1410 place count 312 transition count 421
Deduced a syphon composed of 167 places in 0 ms
Applied a total of 1410 rules in 93 ms. Remains 312 /726 variables (removed 414) and now considering 421/671 (removed 250) transitions.
[2021-05-11 05:03:30] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 421 rows 312 cols
[2021-05-11 05:03:30] [INFO ] Computed 67 place invariants in 5 ms
[2021-05-11 05:03:30] [INFO ] Dead Transitions using invariants and state equation in 204 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/726 places, 421/671 transitions.
Product exploration explored 100000 steps with 4539 reset in 558 ms.
Product exploration explored 100000 steps with 4509 reset in 506 ms.
[2021-05-11 05:03:31] [INFO ] Flatten gal took : 24 ms
[2021-05-11 05:03:31] [INFO ] Flatten gal took : 23 ms
[2021-05-11 05:03:31] [INFO ] Time to serialize gal into /tmp/LTL11362559796107020513.gal : 6 ms
[2021-05-11 05:03:31] [INFO ] Time to serialize properties into /tmp/LTL1252202662352365800.ltl : 71 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/LTL11362559796107020513.gal, -t, CGAL, -LTL, /tmp/LTL1252202662352365800.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/LTL11362559796107020513.gal -t CGAL -LTL /tmp/LTL1252202662352365800.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((((((((lc1_6>=1)||(lc1_1>=1))||(lc1_4>=1))||(lc1_2>=1))||(lc1_7>=1))||(lc1_9>=1))||(lc1_0>=1))||(lc1_5>=1))||(lc1_10>=1))||(lc1_3>=1))||(lc1_8>=1))")))))
Formula 0 simplified : !XXF"(((((((((((lc1_6>=1)||(lc1_1>=1))||(lc1_4>=1))||(lc1_2>=1))||(lc1_7>=1))||(lc1_9>=1))||(lc1_0>=1))||(lc1_5>=1))||(lc1_10>=1))||(lc1_3>=1))||(lc1_8>=1))"
Detected timeout of ITS tools.
[2021-05-11 05:03:47] [INFO ] Flatten gal took : 35 ms
[2021-05-11 05:03:47] [INFO ] Applying decomposition
[2021-05-11 05:03:47] [INFO ] Flatten gal took : 25 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/graph5469050149778485871.txt, -o, /tmp/graph5469050149778485871.bin, -w, /tmp/graph5469050149778485871.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/graph5469050149778485871.bin, -l, -1, -v, -w, /tmp/graph5469050149778485871.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 05:03:47] [INFO ] Decomposing Gal with order
[2021-05-11 05:03:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 05:03:47] [INFO ] Removed a total of 20 redundant transitions.
[2021-05-11 05:03:47] [INFO ] Flatten gal took : 51 ms
[2021-05-11 05:03:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-11 05:03:47] [INFO ] Time to serialize gal into /tmp/LTL12250668747503300741.gal : 8 ms
[2021-05-11 05:03:47] [INFO ] Time to serialize properties into /tmp/LTL18188008427251270398.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/LTL12250668747503300741.gal, -t, CGAL, -LTL, /tmp/LTL18188008427251270398.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/LTL12250668747503300741.gal -t CGAL -LTL /tmp/LTL18188008427251270398.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((((((((i0.u29.lc1_6>=1)||(i29.u48.lc1_1>=1))||(i6.u28.lc1_4>=1))||(i30.u49.lc1_2>=1))||(i31.u52.lc1_7>=1))||(i10.u31.lc1_9>=1))||(i5.u47.lc1_0>=1))||(i9.u51.lc1_5>=1))||(i28.u53.lc1_10>=1))||(i8.u50.lc1_3>=1))||(i32.u30.lc1_8>=1))")))))
Formula 0 simplified : !XXF"(((((((((((i0.u29.lc1_6>=1)||(i29.u48.lc1_1>=1))||(i6.u28.lc1_4>=1))||(i30.u49.lc1_2>=1))||(i31.u52.lc1_7>=1))||(i10.u31.lc1_9>=1))||(i5.u47.lc1_0>=1))||(i9.u51.lc1_5>=1))||(i28.u53.lc1_10>=1))||(i8.u50.lc1_3>=1))||(i32.u30.lc1_8>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin819222458282303270
[2021-05-11 05:04:02] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin819222458282303270
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/ltsmin819222458282303270]
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/ltsmin819222458282303270] 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/ltsmin819222458282303270] 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-06 finished in 35909 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (G(p2)||X(G((p0&&X(p2))))||p1))))], workingDir=/home/mcc/execution]
Support contains 66 out of 1045 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1045/1045 places, 980/980 transitions.
Discarding 25 places :
Implicit places reduction removed 25 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1020 transition count 980
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 82 place count 963 transition count 923
Iterating global reduction 1 with 57 rules applied. Total rules applied 139 place count 963 transition count 923
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 164 place count 938 transition count 878
Iterating global reduction 1 with 25 rules applied. Total rules applied 189 place count 938 transition count 878
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 202 place count 926 transition count 877
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 225 place count 903 transition count 844
Iterating global reduction 2 with 23 rules applied. Total rules applied 248 place count 903 transition count 844
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 270 place count 881 transition count 822
Iterating global reduction 2 with 22 rules applied. Total rules applied 292 place count 881 transition count 822
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 306 place count 874 transition count 815
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 310 place count 870 transition count 811
Iterating global reduction 3 with 4 rules applied. Total rules applied 314 place count 870 transition count 811
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 318 place count 866 transition count 807
Iterating global reduction 3 with 4 rules applied. Total rules applied 322 place count 866 transition count 807
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 326 place count 864 transition count 805
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 328 place count 862 transition count 803
Iterating global reduction 4 with 2 rules applied. Total rules applied 330 place count 862 transition count 803
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 332 place count 860 transition count 801
Iterating global reduction 4 with 2 rules applied. Total rules applied 334 place count 860 transition count 801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 336 place count 859 transition count 800
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 337 place count 858 transition count 799
Iterating global reduction 5 with 1 rules applied. Total rules applied 338 place count 858 transition count 799
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 339 place count 857 transition count 798
Iterating global reduction 5 with 1 rules applied. Total rules applied 340 place count 857 transition count 798
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 341 place count 856 transition count 797
Iterating global reduction 5 with 1 rules applied. Total rules applied 342 place count 856 transition count 797
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 343 place count 855 transition count 796
Iterating global reduction 5 with 1 rules applied. Total rules applied 344 place count 855 transition count 796
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 345 place count 854 transition count 795
Iterating global reduction 5 with 1 rules applied. Total rules applied 346 place count 854 transition count 795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 348 place count 853 transition count 794
Applied a total of 348 rules in 308 ms. Remains 853 /1045 variables (removed 192) and now considering 794/980 (removed 186) transitions.
// Phase 1: matrix 794 rows 853 cols
[2021-05-11 05:04:03] [INFO ] Computed 92 place invariants in 5 ms
[2021-05-11 05:04:03] [INFO ] Implicit Places using invariants in 212 ms returned [88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 165, 609, 753]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 214 ms to find 14 implicit places.
// Phase 1: matrix 794 rows 839 cols
[2021-05-11 05:04:03] [INFO ] Computed 78 place invariants in 3 ms
[2021-05-11 05:04:04] [INFO ] Dead Transitions using invariants and state equation in 426 ms returned []
Starting structural reductions, iteration 1 : 839/1045 places, 794/980 transitions.
Applied a total of 0 rules in 27 ms. Remains 839 /839 variables (removed 0) and now considering 794/794 (removed 0) transitions.
// Phase 1: matrix 794 rows 839 cols
[2021-05-11 05:04:04] [INFO ] Computed 78 place invariants in 4 ms
[2021-05-11 05:04:04] [INFO ] Dead Transitions using invariants and state equation in 334 ms returned []
Finished structural reductions, in 2 iterations. Remains : 839/1045 places, 794/980 transitions.
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p2), true, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 6}, { cond=p0, acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=2 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=2 dest: 8}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 1}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 6}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(OR (AND (GEQ s383 1) (GEQ s438 1)) (AND (GEQ s376 1) (GEQ s442 1)) (AND (GEQ s375 1) (GEQ s430 1)) (AND (GEQ s378 1) (GEQ s433 1)) (AND (GEQ s376 1) (GEQ s431 1)) (AND (GEQ s380 1) (GEQ s435 1)) (AND (GEQ s375 1) (GEQ s441 1)) (AND (GEQ s377 1) (GEQ s443 1)) (AND (GEQ s379 1) (GEQ s445 1)) (AND (GEQ s381 1) (GEQ s447 1)) (AND (GEQ s383 1) (GEQ s449 1)) (AND (GEQ s385 1) (GEQ s451 1)) (AND (GEQ s380 1) (GEQ s446 1)) (AND (GEQ s379 1) (GEQ s434 1)) (AND (GEQ s382 1) (GEQ s437 1)) (AND (GEQ s384 1) (GEQ s439 1)) (AND (GEQ s385 1) (GEQ s440 1)) (AND (GEQ s378 1) (GEQ s444 1)) (AND (GEQ s377 1) (GEQ s432 1)) (AND (GEQ s381 1) (GEQ s436 1)) (AND (GEQ s382 1) (GEQ s448 1)) (AND (GEQ s384 1) (GEQ s450 1))), p1:(OR (GEQ s752 1) (GEQ s753 1) (GEQ s754 1) (GEQ s755 1) (GEQ s751 1) (GEQ s760 1) (GEQ s761 1) (GEQ s756 1) (GEQ s757 1) (GEQ s758 1) (GEQ s759 1)), p2:(OR (GEQ s125 1) (GEQ s124 1) (GEQ s123 1) (GEQ s122 1) (GEQ s129 1) (GEQ s128 1) (GEQ s127 1) (GEQ s126 1) (GEQ s131 1) (GEQ s130 1) (GEQ s113 1) (GEQ s112 1) (GEQ s111 1) (GEQ s110 1) (GEQ s117 1) (GEQ s116 1) (GEQ s115 1) (GEQ s114 1) (GEQ s121 1) (GEQ s120 1) (GEQ s119 1) (GEQ s118 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-07 finished in 1626 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((X(p0) U (F(p2)&&p1)))||F(p3)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1045 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1045/1045 places, 980/980 transitions.
Discarding 25 places :
Implicit places reduction removed 25 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1020 transition count 980
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 82 place count 963 transition count 923
Iterating global reduction 1 with 57 rules applied. Total rules applied 139 place count 963 transition count 923
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 164 place count 938 transition count 878
Iterating global reduction 1 with 25 rules applied. Total rules applied 189 place count 938 transition count 878
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 202 place count 926 transition count 877
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 225 place count 903 transition count 844
Iterating global reduction 2 with 23 rules applied. Total rules applied 248 place count 903 transition count 844
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 281 place count 870 transition count 811
Iterating global reduction 2 with 33 rules applied. Total rules applied 314 place count 870 transition count 811
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 2 with 36 rules applied. Total rules applied 350 place count 852 transition count 793
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 354 place count 848 transition count 789
Iterating global reduction 3 with 4 rules applied. Total rules applied 358 place count 848 transition count 789
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 362 place count 844 transition count 785
Iterating global reduction 3 with 4 rules applied. Total rules applied 366 place count 844 transition count 785
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 370 place count 842 transition count 783
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 372 place count 840 transition count 781
Iterating global reduction 4 with 2 rules applied. Total rules applied 374 place count 840 transition count 781
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 376 place count 838 transition count 779
Iterating global reduction 4 with 2 rules applied. Total rules applied 378 place count 838 transition count 779
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 380 place count 837 transition count 778
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 381 place count 836 transition count 777
Iterating global reduction 5 with 1 rules applied. Total rules applied 382 place count 836 transition count 777
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 383 place count 835 transition count 776
Iterating global reduction 5 with 1 rules applied. Total rules applied 384 place count 835 transition count 776
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 385 place count 834 transition count 775
Iterating global reduction 5 with 1 rules applied. Total rules applied 386 place count 834 transition count 775
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 387 place count 833 transition count 774
Iterating global reduction 5 with 1 rules applied. Total rules applied 388 place count 833 transition count 774
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 389 place count 832 transition count 773
Iterating global reduction 5 with 1 rules applied. Total rules applied 390 place count 832 transition count 773
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 392 place count 831 transition count 772
Applied a total of 392 rules in 306 ms. Remains 831 /1045 variables (removed 214) and now considering 772/980 (removed 208) transitions.
// Phase 1: matrix 772 rows 831 cols
[2021-05-11 05:04:05] [INFO ] Computed 81 place invariants in 4 ms
[2021-05-11 05:04:05] [INFO ] Implicit Places using invariants in 177 ms returned [143, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 587, 731]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 179 ms to find 13 implicit places.
// Phase 1: matrix 772 rows 818 cols
[2021-05-11 05:04:05] [INFO ] Computed 68 place invariants in 3 ms
[2021-05-11 05:04:05] [INFO ] Dead Transitions using invariants and state equation in 349 ms returned []
Starting structural reductions, iteration 1 : 818/1045 places, 772/980 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 799 transition count 753
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 799 transition count 753
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 790 transition count 735
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 790 transition count 735
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 781 transition count 726
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 781 transition count 726
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 772 transition count 717
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 772 transition count 717
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 101 place count 763 transition count 708
Iterating global reduction 0 with 9 rules applied. Total rules applied 110 place count 763 transition count 708
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 119 place count 754 transition count 699
Iterating global reduction 0 with 9 rules applied. Total rules applied 128 place count 754 transition count 699
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 137 place count 745 transition count 690
Iterating global reduction 0 with 9 rules applied. Total rules applied 146 place count 745 transition count 690
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 155 place count 736 transition count 681
Iterating global reduction 0 with 9 rules applied. Total rules applied 164 place count 736 transition count 681
Applied a total of 164 rules in 162 ms. Remains 736 /818 variables (removed 82) and now considering 681/772 (removed 91) transitions.
// Phase 1: matrix 681 rows 736 cols
[2021-05-11 05:04:06] [INFO ] Computed 68 place invariants in 3 ms
[2021-05-11 05:04:06] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 681 rows 736 cols
[2021-05-11 05:04:06] [INFO ] Computed 68 place invariants in 3 ms
[2021-05-11 05:04:06] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 736/1045 places, 681/980 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-10 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s310 1) (GEQ s346 1)), p1:(AND (GEQ s310 1) (GEQ s346 1)), p2:(GEQ s151 1), p0:(GEQ s444 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1251 steps with 1 reset in 3 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-10 finished in 1671 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1045 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1045/1045 places, 980/980 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 24 places :
Implicit places reduction removed 24 places
Drop transitions removed 471 transitions
Trivial Post-agglo rules discarded 471 transitions
Performed 471 trivial Post agglomeration. Transition count delta: 471
Iterating post reduction 0 with 495 rules applied. Total rules applied 495 place count 1020 transition count 508
Reduce places removed 471 places and 0 transitions.
Iterating post reduction 1 with 471 rules applied. Total rules applied 966 place count 549 transition count 508
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 121 Pre rules applied. Total rules applied 966 place count 549 transition count 387
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 297 rules applied. Total rules applied 1263 place count 373 transition count 387
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 2 with 33 rules applied. Total rules applied 1296 place count 373 transition count 354
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 1329 place count 340 transition count 354
Discarding 46 places :
Symmetric choice reduction at 4 with 46 rule applications. Total rules 1375 place count 294 transition count 298
Iterating global reduction 4 with 46 rules applied. Total rules applied 1421 place count 294 transition count 298
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 4 with 73 rules applied. Total rules applied 1494 place count 285 transition count 234
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 5 with 54 rules applied. Total rules applied 1548 place count 231 transition count 234
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 1548 place count 231 transition count 213
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 43 rules applied. Total rules applied 1591 place count 209 transition count 213
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1593 place count 207 transition count 191
Iterating global reduction 6 with 2 rules applied. Total rules applied 1595 place count 207 transition count 191
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 6 with 55 rules applied. Total rules applied 1650 place count 185 transition count 158
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1672 place count 163 transition count 158
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 1672 place count 163 transition count 147
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1694 place count 152 transition count 147
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1705 place count 141 transition count 136
Iterating global reduction 8 with 11 rules applied. Total rules applied 1716 place count 141 transition count 136
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1727 place count 141 transition count 125
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 9 with 77 rules applied. Total rules applied 1804 place count 102 transition count 87
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1815 place count 91 transition count 76
Ensure Unique test removed 11 places
Iterating global reduction 9 with 22 rules applied. Total rules applied 1837 place count 80 transition count 76
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 9 with 22 rules applied. Total rules applied 1859 place count 80 transition count 54
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1870 place count 69 transition count 54
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1871 place count 69 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1872 place count 68 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1873 place count 67 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1874 place count 66 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1875 place count 65 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1876 place count 64 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1877 place count 63 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1878 place count 62 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1879 place count 61 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1880 place count 60 transition count 45
Applied a total of 1880 rules in 55 ms. Remains 60 /1045 variables (removed 985) and now considering 45/980 (removed 935) transitions.
// Phase 1: matrix 45 rows 60 cols
[2021-05-11 05:04:06] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-11 05:04:06] [INFO ] Implicit Places using invariants in 138 ms returned [3, 4, 10, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 48]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 140 ms to find 15 implicit places.
[2021-05-11 05:04:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 45 cols
[2021-05-11 05:04:06] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-11 05:04:06] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 45/1045 places, 45/980 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 44 transition count 31
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 31 transition count 31
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 26 place count 31 transition count 20
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 48 place count 20 transition count 20
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 57 place count 11 transition count 11
Iterating global reduction 2 with 9 rules applied. Total rules applied 66 place count 11 transition count 11
Applied a total of 66 rules in 2 ms. Remains 11 /45 variables (removed 34) and now considering 11/45 (removed 34) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-11 05:04:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-11 05:04:06] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-11 05:04:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-11 05:04:06] [INFO ] Implicit Places using invariants and state equation in 11 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 20 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 10/1045 places, 11/980 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-11 05:04:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2021-05-11 05:04:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-11 05:04:06] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 3 iterations. Remains : 10/1045 places, 11/980 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s8 1)), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 2 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-11 finished in 361 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 1045 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1045/1045 places, 980/980 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 24 places :
Implicit places reduction removed 24 places
Drop transitions removed 472 transitions
Trivial Post-agglo rules discarded 472 transitions
Performed 472 trivial Post agglomeration. Transition count delta: 472
Iterating post reduction 0 with 496 rules applied. Total rules applied 496 place count 1020 transition count 507
Reduce places removed 472 places and 0 transitions.
Iterating post reduction 1 with 472 rules applied. Total rules applied 968 place count 548 transition count 507
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 121 Pre rules applied. Total rules applied 968 place count 548 transition count 386
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 297 rules applied. Total rules applied 1265 place count 372 transition count 386
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 2 with 33 rules applied. Total rules applied 1298 place count 372 transition count 353
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 1331 place count 339 transition count 353
Discarding 46 places :
Symmetric choice reduction at 4 with 46 rule applications. Total rules 1377 place count 293 transition count 297
Iterating global reduction 4 with 46 rules applied. Total rules applied 1423 place count 293 transition count 297
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 4 with 76 rules applied. Total rules applied 1499 place count 283 transition count 231
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 1554 place count 228 transition count 231
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 22 Pre rules applied. Total rules applied 1554 place count 228 transition count 209
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 45 rules applied. Total rules applied 1599 place count 205 transition count 209
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1601 place count 203 transition count 187
Iterating global reduction 6 with 2 rules applied. Total rules applied 1603 place count 203 transition count 187
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 6 with 55 rules applied. Total rules applied 1658 place count 181 transition count 154
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1680 place count 159 transition count 154
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 1680 place count 159 transition count 143
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1702 place count 148 transition count 143
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1713 place count 137 transition count 132
Iterating global reduction 8 with 11 rules applied. Total rules applied 1724 place count 137 transition count 132
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1735 place count 137 transition count 121
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 9 with 77 rules applied. Total rules applied 1812 place count 98 transition count 83
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1823 place count 87 transition count 72
Ensure Unique test removed 11 places
Iterating global reduction 9 with 22 rules applied. Total rules applied 1845 place count 76 transition count 72
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 9 with 22 rules applied. Total rules applied 1867 place count 76 transition count 50
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1878 place count 65 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1879 place count 64 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1880 place count 63 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1881 place count 62 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1882 place count 61 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1883 place count 60 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1884 place count 59 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1885 place count 58 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1886 place count 57 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1887 place count 56 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1888 place count 55 transition count 40
Applied a total of 1888 rules in 34 ms. Remains 55 /1045 variables (removed 990) and now considering 40/980 (removed 940) transitions.
// Phase 1: matrix 40 rows 55 cols
[2021-05-11 05:04:07] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-11 05:04:07] [INFO ] Implicit Places using invariants in 34 ms returned [1, 4, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 43]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 35 ms to find 14 implicit places.
[2021-05-11 05:04:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 41 cols
[2021-05-11 05:04:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-11 05:04:07] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 41/1045 places, 40/980 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 40 transition count 27
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 28 transition count 27
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 24 place count 28 transition count 16
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 46 place count 17 transition count 16
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 55 place count 8 transition count 7
Iterating global reduction 2 with 9 rules applied. Total rules applied 64 place count 8 transition count 7
Applied a total of 64 rules in 0 ms. Remains 8 /41 variables (removed 33) and now considering 7/40 (removed 33) transitions.
// Phase 1: matrix 7 rows 8 cols
[2021-05-11 05:04:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-11 05:04:07] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-11 05:04:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-11 05:04:07] [INFO ] Implicit Places using invariants and state equation in 10 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 23 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 7/1045 places, 7/980 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-11 05:04:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-11 05:04:07] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-11 05:04:07] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 3 iterations. Remains : 7/1045 places, 7/980 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s5 1))], 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 3 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-13 finished in 164 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0 U p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1045 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1045/1045 places, 980/980 transitions.
Discarding 25 places :
Implicit places reduction removed 25 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1020 transition count 980
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 81 place count 964 transition count 924
Iterating global reduction 1 with 56 rules applied. Total rules applied 137 place count 964 transition count 924
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 162 place count 939 transition count 879
Iterating global reduction 1 with 25 rules applied. Total rules applied 187 place count 939 transition count 879
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 200 place count 927 transition count 878
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 222 place count 905 transition count 846
Iterating global reduction 2 with 22 rules applied. Total rules applied 244 place count 905 transition count 846
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 276 place count 873 transition count 814
Iterating global reduction 2 with 32 rules applied. Total rules applied 308 place count 873 transition count 814
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 2 with 36 rules applied. Total rules applied 344 place count 855 transition count 796
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 348 place count 851 transition count 792
Iterating global reduction 3 with 4 rules applied. Total rules applied 352 place count 851 transition count 792
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 356 place count 847 transition count 788
Iterating global reduction 3 with 4 rules applied. Total rules applied 360 place count 847 transition count 788
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 364 place count 845 transition count 786
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 366 place count 843 transition count 784
Iterating global reduction 4 with 2 rules applied. Total rules applied 368 place count 843 transition count 784
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 370 place count 841 transition count 782
Iterating global reduction 4 with 2 rules applied. Total rules applied 372 place count 841 transition count 782
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 374 place count 840 transition count 781
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 375 place count 839 transition count 780
Iterating global reduction 5 with 1 rules applied. Total rules applied 376 place count 839 transition count 780
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 377 place count 838 transition count 779
Iterating global reduction 5 with 1 rules applied. Total rules applied 378 place count 838 transition count 779
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 379 place count 837 transition count 778
Iterating global reduction 5 with 1 rules applied. Total rules applied 380 place count 837 transition count 778
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 381 place count 836 transition count 777
Iterating global reduction 5 with 1 rules applied. Total rules applied 382 place count 836 transition count 777
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 383 place count 835 transition count 776
Iterating global reduction 5 with 1 rules applied. Total rules applied 384 place count 835 transition count 776
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 386 place count 834 transition count 775
Applied a total of 386 rules in 308 ms. Remains 834 /1045 variables (removed 211) and now considering 775/980 (removed 205) transitions.
// Phase 1: matrix 775 rows 834 cols
[2021-05-11 05:04:07] [INFO ] Computed 81 place invariants in 7 ms
[2021-05-11 05:04:07] [INFO ] Implicit Places using invariants in 207 ms returned [143, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 733]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 208 ms to find 13 implicit places.
// Phase 1: matrix 775 rows 821 cols
[2021-05-11 05:04:07] [INFO ] Computed 68 place invariants in 10 ms
[2021-05-11 05:04:08] [INFO ] Dead Transitions using invariants and state equation in 387 ms returned []
Starting structural reductions, iteration 1 : 821/1045 places, 775/980 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 800 transition count 754
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 800 transition count 754
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 790 transition count 734
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 790 transition count 734
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 780 transition count 724
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 780 transition count 724
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 770 transition count 714
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 770 transition count 714
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 760 transition count 704
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 760 transition count 704
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 750 transition count 694
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 750 transition count 694
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 740 transition count 684
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 740 transition count 684
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 730 transition count 674
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 730 transition count 674
Applied a total of 182 rules in 161 ms. Remains 730 /821 variables (removed 91) and now considering 674/775 (removed 101) transitions.
// Phase 1: matrix 674 rows 730 cols
[2021-05-11 05:04:08] [INFO ] Computed 68 place invariants in 3 ms
[2021-05-11 05:04:08] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 674 rows 730 cols
[2021-05-11 05:04:08] [INFO ] Computed 68 place invariants in 3 ms
[2021-05-11 05:04:08] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 730/1045 places, 674/980 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s484 1) (GEQ s641 1)), p0:(GEQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-14 finished in 1690 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1045 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1045/1045 places, 980/980 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 24 places :
Implicit places reduction removed 24 places
Drop transitions removed 469 transitions
Trivial Post-agglo rules discarded 469 transitions
Performed 469 trivial Post agglomeration. Transition count delta: 469
Iterating post reduction 0 with 493 rules applied. Total rules applied 493 place count 1020 transition count 510
Reduce places removed 469 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 470 rules applied. Total rules applied 963 place count 551 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 964 place count 550 transition count 509
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 964 place count 550 transition count 388
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 3 with 297 rules applied. Total rules applied 1261 place count 374 transition count 388
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 33 rules applied. Total rules applied 1294 place count 374 transition count 355
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 1327 place count 341 transition count 355
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 1373 place count 295 transition count 299
Iterating global reduction 5 with 46 rules applied. Total rules applied 1419 place count 295 transition count 299
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 5 with 77 rules applied. Total rules applied 1496 place count 285 transition count 232
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 6 with 56 rules applied. Total rules applied 1552 place count 229 transition count 232
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 1552 place count 229 transition count 211
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 43 rules applied. Total rules applied 1595 place count 207 transition count 211
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1597 place count 205 transition count 189
Iterating global reduction 7 with 2 rules applied. Total rules applied 1599 place count 205 transition count 189
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 7 with 55 rules applied. Total rules applied 1654 place count 183 transition count 156
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 1676 place count 161 transition count 156
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 1676 place count 161 transition count 145
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1698 place count 150 transition count 145
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1709 place count 139 transition count 134
Iterating global reduction 9 with 11 rules applied. Total rules applied 1720 place count 139 transition count 134
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 12 rules applied. Total rules applied 1732 place count 139 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1733 place count 138 transition count 122
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 11 with 77 rules applied. Total rules applied 1810 place count 99 transition count 84
Discarding 11 places :
Symmetric choice reduction at 11 with 11 rule applications. Total rules 1821 place count 88 transition count 73
Ensure Unique test removed 11 places
Iterating global reduction 11 with 22 rules applied. Total rules applied 1843 place count 77 transition count 73
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 11 with 22 rules applied. Total rules applied 1865 place count 77 transition count 51
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 12 with 11 rules applied. Total rules applied 1876 place count 66 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1877 place count 65 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1878 place count 64 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1879 place count 63 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1880 place count 62 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1881 place count 61 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1882 place count 60 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1883 place count 59 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1884 place count 58 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1885 place count 57 transition count 42
Applied a total of 1885 rules in 33 ms. Remains 57 /1045 variables (removed 988) and now considering 42/980 (removed 938) transitions.
// Phase 1: matrix 42 rows 57 cols
[2021-05-11 05:04:08] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-11 05:04:08] [INFO ] Implicit Places using invariants in 42 ms returned [2, 6, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 45]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 43 ms to find 14 implicit places.
[2021-05-11 05:04:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 43 cols
[2021-05-11 05:04:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-11 05:04:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 43/1045 places, 42/980 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 42 transition count 29
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 30 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 29 transition count 28
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 26 place count 29 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 46 place count 19 transition count 18
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 55 place count 10 transition count 9
Iterating global reduction 3 with 9 rules applied. Total rules applied 64 place count 10 transition count 9
Applied a total of 64 rules in 1 ms. Remains 10 /43 variables (removed 33) and now considering 9/42 (removed 33) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-11 05:04:08] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-11 05:04:08] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-11 05:04:08] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-11 05:04:09] [INFO ] Implicit Places using invariants and state equation in 18 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 26 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 9/1045 places, 9/980 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2021-05-11 05:04:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-11 05:04:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-11 05:04:09] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 3 iterations. Remains : 9/1045 places, 9/980 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-15 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s6 1)), p1:(GEQ s8 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13358 reset in 190 ms.
Product exploration explored 100000 steps with 13315 reset in 238 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G (NOT p1))), p0, (NOT p1)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-15 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-15 finished in 659 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8526173062132114982
[2021-05-11 05:04:09] [INFO ] Computing symmetric may disable matrix : 980 transitions.
[2021-05-11 05:04:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-11 05:04:09] [INFO ] Computing symmetric may enable matrix : 980 transitions.
[2021-05-11 05:04:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-11 05:04:09] [INFO ] Applying decomposition
[2021-05-11 05:04:09] [INFO ] Flatten gal took : 30 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/graph11845532509197524132.txt, -o, /tmp/graph11845532509197524132.bin, -w, /tmp/graph11845532509197524132.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/graph11845532509197524132.bin, -l, -1, -v, -w, /tmp/graph11845532509197524132.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 05:04:09] [INFO ] Decomposing Gal with order
[2021-05-11 05:04:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 05:04:09] [INFO ] Computing Do-Not-Accords matrix : 980 transitions.
[2021-05-11 05:04:09] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-11 05:04:09] [INFO ] Built C files in 263ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8526173062132114982
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/ltsmin8526173062132114982]
[2021-05-11 05:04:09] [INFO ] Removed a total of 173 redundant transitions.
[2021-05-11 05:04:09] [INFO ] Flatten gal took : 65 ms
[2021-05-11 05:04:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 20 ms.
[2021-05-11 05:04:09] [INFO ] Time to serialize gal into /tmp/LTLFireability10815867112081240523.gal : 12 ms
[2021-05-11 05:04:09] [INFO ] Time to serialize properties into /tmp/LTLFireability13383959689271228073.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/LTLFireability10815867112081240523.gal, -t, CGAL, -LTL, /tmp/LTLFireability13383959689271228073.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/LTLFireability10815867112081240523.gal -t CGAL -LTL /tmp/LTLFireability13383959689271228073.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((((((((i6.u51.lc1_6>=1)||(i3.i2.i0.u58.lc1_1>=1))||(i2.u49.lc1_4>=1))||(i8.u47.lc1_2>=1))||(i4.u52.lc1_7>=1))||(i29.u54.lc1_9>=1))||(i3.i0.i0.u59.lc1_0>=1))||(i26.i1.i0.u50.lc1_5>=1))||(i30.u55.lc1_10>=1))||(i3.i1.i0.u48.lc1_3>=1))||(i28.u53.lc1_8>=1))")))))
Formula 0 simplified : !XXF"(((((((((((i6.u51.lc1_6>=1)||(i3.i2.i0.u58.lc1_1>=1))||(i2.u49.lc1_4>=1))||(i8.u47.lc1_2>=1))||(i4.u52.lc1_7>=1))||(i29.u54.lc1_9>=1))||(i3.i0.i0.u59.lc1_0>=1))||(i26.i1.i0.u50.lc1_5>=1))||(i30.u55.lc1_10>=1))||(i3.i1.i0.u48.lc1_3>=1))||(i28.u53.lc1_8>=1))"
Compilation finished in 7631 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8526173062132114982]
Link finished in 74 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, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8526173062132114982]
WARNING : LTSmin timed out (>327 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8526173062132114982]
Retrying LTSmin with larger timeout 2616 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, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8526173062132114982]
Detected timeout of ITS tools.
[2021-05-11 05:24:32] [INFO ] Flatten gal took : 86 ms
[2021-05-11 05:24:32] [INFO ] Time to serialize gal into /tmp/LTLFireability9238531828663685131.gal : 36 ms
[2021-05-11 05:24:32] [INFO ] Time to serialize properties into /tmp/LTLFireability15895208072587583954.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/LTLFireability9238531828663685131.gal, -t, CGAL, -LTL, /tmp/LTLFireability15895208072587583954.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/LTLFireability9238531828663685131.gal -t CGAL -LTL /tmp/LTLFireability15895208072587583954.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(((((((((((lc1_6>=1)||(lc1_1>=1))||(lc1_4>=1))||(lc1_2>=1))||(lc1_7>=1))||(lc1_9>=1))||(lc1_0>=1))||(lc1_5>=1))||(lc1_10>=1))||(lc1_3>=1))||(lc1_8>=1))")))))
Formula 0 simplified : !XXF"(((((((((((lc1_6>=1)||(lc1_1>=1))||(lc1_4>=1))||(lc1_2>=1))||(lc1_7>=1))||(lc1_9>=1))||(lc1_0>=1))||(lc1_5>=1))||(lc1_10>=1))||(lc1_3>=1))||(lc1_8>=1))"
Detected timeout of ITS tools.
[2021-05-11 05:44:55] [INFO ] Flatten gal took : 105 ms
[2021-05-11 05:44:56] [INFO ] Input system was already deterministic with 980 transitions.
[2021-05-11 05:44:56] [INFO ] Transformed 1045 places.
[2021-05-11 05:44:56] [INFO ] Transformed 980 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:44:56] [INFO ] Time to serialize gal into /tmp/LTLFireability1435805136525580242.gal : 3 ms
[2021-05-11 05:44:56] [INFO ] Time to serialize properties into /tmp/LTLFireability13508703183633415469.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/LTLFireability1435805136525580242.gal, -t, CGAL, -LTL, /tmp/LTLFireability13508703183633415469.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/LTLFireability1435805136525580242.gal -t CGAL -LTL /tmp/LTLFireability13508703183633415469.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 : !((X(X(F("(((((((((((lc1_6>=1)||(lc1_1>=1))||(lc1_4>=1))||(lc1_2>=1))||(lc1_7>=1))||(lc1_9>=1))||(lc1_0>=1))||(lc1_5>=1))||(lc1_10>=1))||(lc1_3>=1))||(lc1_8>=1))")))))
Formula 0 simplified : !XXF"(((((((((((lc1_6>=1)||(lc1_1>=1))||(lc1_4>=1))||(lc1_2>=1))||(lc1_7>=1))||(lc1_9>=1))||(lc1_0>=1))||(lc1_5>=1))||(lc1_10>=1))||(lc1_3>=1))||(lc1_8>=1))"
WARNING : LTSmin timed out (>2616 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8526173062132114982]

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00010M0001C001P001G001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048876000941"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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