Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r157-smll-171636265800484.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
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 r157-smll-171636265800484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 20K Apr 11 20:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 20:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 11 20:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 115K Apr 11 20:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 20:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 440K Apr 11 20:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 11 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 11 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 552K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716701359998

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00010M0001C001P001G001
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 05:29:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 05:29:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 05:29:23] [INFO ] Load time of PNML (sax parser for PT used): 352 ms
[2024-05-26 05:29:23] [INFO ] Transformed 1475 places.
[2024-05-26 05:29:23] [INFO ] Transformed 1234 transitions.
[2024-05-26 05:29:23] [INFO ] Parsed PT model containing 1475 places and 1234 transitions and 3799 arcs in 615 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 44 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 362 out of 1465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Reduce places removed 45 places and 0 transitions.
Discarding 129 places :
Implicit places reduction removed 129 places
Iterating post reduction 0 with 174 rules applied. Total rules applied 174 place count 1291 transition count 1234
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 260 place count 1205 transition count 1137
Iterating global reduction 1 with 86 rules applied. Total rules applied 346 place count 1205 transition count 1137
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 356 place count 1195 transition count 1137
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 377 place count 1174 transition count 1116
Iterating global reduction 2 with 21 rules applied. Total rules applied 398 place count 1174 transition count 1116
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 409 place count 1163 transition count 1105
Iterating global reduction 2 with 11 rules applied. Total rules applied 420 place count 1163 transition count 1105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 421 place count 1162 transition count 1094
Iterating global reduction 2 with 1 rules applied. Total rules applied 422 place count 1162 transition count 1094
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 433 place count 1151 transition count 1094
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 444 place count 1140 transition count 1083
Iterating global reduction 3 with 11 rules applied. Total rules applied 455 place count 1140 transition count 1083
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 466 place count 1129 transition count 1072
Iterating global reduction 3 with 11 rules applied. Total rules applied 477 place count 1129 transition count 1072
Applied a total of 477 rules in 607 ms. Remains 1129 /1465 variables (removed 336) and now considering 1072/1234 (removed 162) transitions.
// Phase 1: matrix 1072 rows 1129 cols
[2024-05-26 05:29:24] [INFO ] Computed 152 invariants in 80 ms
[2024-05-26 05:29:25] [INFO ] Implicit Places using invariants in 980 ms returned [77, 78, 79, 80, 82, 83, 84, 85, 86, 87, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 594, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 1030 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1074/1465 places, 1072/1234 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1064 transition count 1062
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1064 transition count 1062
Applied a total of 20 rules in 51 ms. Remains 1064 /1074 variables (removed 10) and now considering 1062/1072 (removed 10) transitions.
// Phase 1: matrix 1062 rows 1064 cols
[2024-05-26 05:29:25] [INFO ] Computed 97 invariants in 24 ms
[2024-05-26 05:29:25] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-26 05:29:25] [INFO ] Invariant cache hit.
[2024-05-26 05:29:27] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2336 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1064/1465 places, 1062/1234 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4064 ms. Remains : 1064/1465 places, 1062/1234 transitions.
Support contains 362 out of 1064 places after structural reductions.
[2024-05-26 05:29:28] [INFO ] Flatten gal took : 231 ms
[2024-05-26 05:29:28] [INFO ] Flatten gal took : 130 ms
[2024-05-26 05:29:28] [INFO ] Input system was already deterministic with 1062 transitions.
Support contains 329 out of 1064 places (down from 362) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (60 resets) in 2017 ms. (19 steps per ms) remains 1/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 942 ms. (42 steps per ms) remains 1/1 properties
[2024-05-26 05:29:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 779/812 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/812 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/1016 variables, 81/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1016 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1003/2019 variables, 1016/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2019 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/2056 variables, 13/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2056 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/2080 variables, 12/1138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2080 variables, 0/1138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/2104 variables, 12/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2104 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/2126 variables, 11/1161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2126 variables, 0/1161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2126 variables, 0/1161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2126/2126 variables, and 1161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2020 ms.
Refiners :[Generalized P Invariants (flows): 97/97 constraints, State Equation: 1064/1064 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 779/812 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/812 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/1016 variables, 81/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1016 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1003/2019 variables, 1016/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2019 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2019 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/2056 variables, 13/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2056 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/2080 variables, 12/1139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2080 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 24/2104 variables, 12/1151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2104 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/2126 variables, 11/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2126 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2126 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2126/2126 variables, and 1162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1723 ms.
Refiners :[Generalized P Invariants (flows): 97/97 constraints, State Equation: 1064/1064 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3828ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 110 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 17 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1064 stabilizing places and 1062 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1064 transition count 1062
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((F(p1)&&G(p2))||p0))))'
Support contains 33 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1062/1062 transitions.
Graph (complete) has 1391 edges and 1064 vertex of which 312 are kept as prefixes of interest. Removing 752 places using SCC suffix rule.12 ms
Discarding 752 places :
Also discarding 743 output transitions
Drop transitions (Output transitions of discarded places.) removed 743 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 190 rules applied. Total rules applied 191 place count 298 transition count 121
Reduce places removed 187 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 209 rules applied. Total rules applied 400 place count 111 transition count 99
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 422 place count 89 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 422 place count 89 transition count 88
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 444 place count 78 transition count 88
Applied a total of 444 rules in 75 ms. Remains 78 /1064 variables (removed 986) and now considering 88/1062 (removed 974) transitions.
// Phase 1: matrix 88 rows 78 cols
[2024-05-26 05:29:34] [INFO ] Computed 1 invariants in 1 ms
[2024-05-26 05:29:34] [INFO ] Implicit Places using invariants in 64 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/1064 places, 88/1062 transitions.
Applied a total of 0 rules in 6 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 77/1064 places, 88/1062 transitions.
Stuttering acceptance computed with spot in 559 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01
Stuttering criterion allowed to conclude after 157 steps with 5 reset in 14 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-01 finished in 841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((X(F(p2))||p1))||p0) U G(p2)))'
Support contains 33 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1062/1062 transitions.
Graph (complete) has 1391 edges and 1064 vertex of which 1060 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 550 rules applied. Total rules applied 551 place count 1046 transition count 500
Reduce places removed 547 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 567 rules applied. Total rules applied 1118 place count 499 transition count 480
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1128 place count 489 transition count 480
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 143 Pre rules applied. Total rules applied 1128 place count 489 transition count 337
Deduced a syphon composed of 143 places in 2 ms
Ensure Unique test removed 55 places
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 341 rules applied. Total rules applied 1469 place count 291 transition count 337
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 1491 place count 291 transition count 315
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1513 place count 269 transition count 315
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1513 place count 269 transition count 304
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1535 place count 258 transition count 304
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1560 place count 233 transition count 269
Iterating global reduction 5 with 25 rules applied. Total rules applied 1585 place count 233 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1586 place count 233 transition count 268
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 1586 place count 233 transition count 243
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 51 rules applied. Total rules applied 1637 place count 207 transition count 243
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1640 place count 204 transition count 210
Iterating global reduction 6 with 3 rules applied. Total rules applied 1643 place count 204 transition count 210
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 44 rules applied. Total rules applied 1687 place count 193 transition count 177
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1698 place count 182 transition count 177
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 1698 place count 182 transition count 166
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 1720 place count 171 transition count 166
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 8 with 86 rules applied. Total rules applied 1806 place count 128 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1807 place count 127 transition count 122
Applied a total of 1807 rules in 158 ms. Remains 127 /1064 variables (removed 937) and now considering 122/1062 (removed 940) transitions.
// Phase 1: matrix 122 rows 127 cols
[2024-05-26 05:29:35] [INFO ] Computed 27 invariants in 4 ms
[2024-05-26 05:29:35] [INFO ] Implicit Places using invariants in 206 ms returned [10, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 69, 115]
[2024-05-26 05:29:35] [INFO ] Actually due to overlaps returned [67, 10, 115, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 69]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 208 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1064 places, 122/1062 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 111 transition count 121
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 2 place count 111 transition count 110
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 24 place count 100 transition count 110
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 46 place count 89 transition count 99
Applied a total of 46 rules in 13 ms. Remains 89 /112 variables (removed 23) and now considering 99/122 (removed 23) transitions.
// Phase 1: matrix 99 rows 89 cols
[2024-05-26 05:29:35] [INFO ] Computed 12 invariants in 1 ms
[2024-05-26 05:29:35] [INFO ] Implicit Places using invariants in 89 ms returned [21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 93 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/1064 places, 99/1062 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 67 transition count 88
Applied a total of 22 rules in 5 ms. Remains 67 /78 variables (removed 11) and now considering 88/99 (removed 11) transitions.
// Phase 1: matrix 88 rows 67 cols
[2024-05-26 05:29:35] [INFO ] Computed 1 invariants in 1 ms
[2024-05-26 05:29:35] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-26 05:29:35] [INFO ] Invariant cache hit.
[2024-05-26 05:29:35] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 67/1064 places, 88/1062 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 636 ms. Remains : 67/1064 places, 88/1062 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-02 finished in 816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 44 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1062/1062 transitions.
Graph (complete) has 1391 edges and 1064 vertex of which 632 are kept as prefixes of interest. Removing 432 places using SCC suffix rule.5 ms
Discarding 432 places :
Also discarding 424 output transitions
Drop transitions (Output transitions of discarded places.) removed 424 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 425 transitions
Trivial Post-agglo rules discarded 425 transitions
Performed 425 trivial Post agglomeration. Transition count delta: 425
Iterating post reduction 0 with 428 rules applied. Total rules applied 429 place count 618 transition count 202
Reduce places removed 425 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 481 rules applied. Total rules applied 910 place count 192 transition count 147
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 944 place count 158 transition count 147
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 944 place count 158 transition count 92
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 1076 place count 81 transition count 92
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1077 place count 80 transition count 91
Iterating global reduction 3 with 1 rules applied. Total rules applied 1078 place count 80 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1079 place count 80 transition count 90
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1079 place count 80 transition count 88
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 1084 place count 77 transition count 88
Applied a total of 1084 rules in 36 ms. Remains 77 /1064 variables (removed 987) and now considering 88/1062 (removed 974) transitions.
// Phase 1: matrix 88 rows 77 cols
[2024-05-26 05:29:35] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 05:29:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-26 05:29:35] [INFO ] Invariant cache hit.
[2024-05-26 05:29:35] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-26 05:29:36] [INFO ] Redundant transitions in 3 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-26 05:29:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 11/165 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1919 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 66/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 11/165 variables, 11/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 143 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1310 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3251ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3253ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/1064 places, 88/1062 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3438 ms. Remains : 77/1064 places, 88/1062 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-03
Product exploration explored 100000 steps with 9697 reset in 459 ms.
Product exploration explored 100000 steps with 9817 reset in 365 ms.
Computed a total of 77 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be false thanks to negative knowledge :(X (X (NOT p1)))
Knowledge based reduction with 6 factoid took 152 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-03 finished in 4640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p2)||p1))&&p0)))'
Support contains 77 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1062/1062 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1061 transition count 1062
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 51 place count 1013 transition count 1004
Iterating global reduction 1 with 48 rules applied. Total rules applied 99 place count 1013 transition count 1004
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 111 place count 1012 transition count 993
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 135 place count 988 transition count 959
Iterating global reduction 2 with 24 rules applied. Total rules applied 159 place count 988 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 170 place count 977 transition count 959
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 203 place count 944 transition count 916
Iterating global reduction 3 with 33 rules applied. Total rules applied 236 place count 944 transition count 916
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 279 place count 901 transition count 863
Iterating global reduction 3 with 43 rules applied. Total rules applied 322 place count 901 transition count 863
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 333 place count 901 transition count 852
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 354 place count 880 transition count 831
Iterating global reduction 4 with 21 rules applied. Total rules applied 375 place count 880 transition count 831
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 396 place count 859 transition count 810
Iterating global reduction 4 with 21 rules applied. Total rules applied 417 place count 859 transition count 810
Applied a total of 417 rules in 357 ms. Remains 859 /1064 variables (removed 205) and now considering 810/1062 (removed 252) transitions.
// Phase 1: matrix 810 rows 859 cols
[2024-05-26 05:29:40] [INFO ] Computed 82 invariants in 6 ms
[2024-05-26 05:29:41] [INFO ] Implicit Places using invariants in 447 ms returned [77, 177, 423, 759]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 455 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 855/1064 places, 810/1062 transitions.
Applied a total of 0 rules in 41 ms. Remains 855 /855 variables (removed 0) and now considering 810/810 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 853 ms. Remains : 855/1064 places, 810/1062 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-04 finished in 1106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
Support contains 35 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1062/1062 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1061 transition count 1062
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 61 place count 1003 transition count 1004
Iterating global reduction 1 with 58 rules applied. Total rules applied 119 place count 1003 transition count 1004
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 131 place count 1002 transition count 993
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 155 place count 978 transition count 959
Iterating global reduction 2 with 24 rules applied. Total rules applied 179 place count 978 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 190 place count 967 transition count 959
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 223 place count 934 transition count 916
Iterating global reduction 3 with 33 rules applied. Total rules applied 256 place count 934 transition count 916
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 288 place count 902 transition count 874
Iterating global reduction 3 with 32 rules applied. Total rules applied 320 place count 902 transition count 874
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 331 place count 891 transition count 863
Iterating global reduction 3 with 11 rules applied. Total rules applied 342 place count 891 transition count 863
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 353 place count 880 transition count 852
Iterating global reduction 3 with 11 rules applied. Total rules applied 364 place count 880 transition count 852
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 375 place count 869 transition count 841
Iterating global reduction 3 with 11 rules applied. Total rules applied 386 place count 869 transition count 841
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 397 place count 858 transition count 830
Iterating global reduction 3 with 11 rules applied. Total rules applied 408 place count 858 transition count 830
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 419 place count 847 transition count 819
Iterating global reduction 3 with 11 rules applied. Total rules applied 430 place count 847 transition count 819
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 441 place count 836 transition count 808
Iterating global reduction 3 with 11 rules applied. Total rules applied 452 place count 836 transition count 808
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 463 place count 825 transition count 797
Iterating global reduction 3 with 11 rules applied. Total rules applied 474 place count 825 transition count 797
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 12 rules applied. Total rules applied 486 place count 824 transition count 786
Applied a total of 486 rules in 550 ms. Remains 824 /1064 variables (removed 240) and now considering 786/1062 (removed 276) transitions.
// Phase 1: matrix 786 rows 824 cols
[2024-05-26 05:29:42] [INFO ] Computed 81 invariants in 15 ms
[2024-05-26 05:29:42] [INFO ] Implicit Places using invariants in 321 ms returned [154, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 724]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 328 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 811/1064 places, 786/1062 transitions.
Applied a total of 0 rules in 40 ms. Remains 811 /811 variables (removed 0) and now considering 786/786 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 918 ms. Remains : 811/1064 places, 786/1062 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-05 finished in 1250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!G(p0))||F(X(p1))) U p2))'
Support contains 44 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1062/1062 transitions.
Graph (complete) has 1391 edges and 1064 vertex of which 722 are kept as prefixes of interest. Removing 342 places using SCC suffix rule.6 ms
Discarding 342 places :
Also discarding 336 output transitions
Drop transitions (Output transitions of discarded places.) removed 336 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 382 transitions
Trivial Post-agglo rules discarded 382 transitions
Performed 382 trivial Post agglomeration. Transition count delta: 382
Iterating post reduction 0 with 385 rules applied. Total rules applied 386 place count 708 transition count 333
Reduce places removed 382 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 417 rules applied. Total rules applied 803 place count 325 transition count 299
Reduce places removed 23 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 2 with 56 rules applied. Total rules applied 859 place count 302 transition count 266
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 892 place count 269 transition count 266
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 892 place count 269 transition count 211
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 1024 place count 192 transition count 211
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 22 rules applied. Total rules applied 1046 place count 192 transition count 189
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1068 place count 170 transition count 189
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1079 place count 159 transition count 178
Iterating global reduction 6 with 11 rules applied. Total rules applied 1090 place count 159 transition count 178
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1090 place count 159 transition count 167
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1112 place count 148 transition count 167
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1113 place count 147 transition count 156
Iterating global reduction 6 with 1 rules applied. Total rules applied 1114 place count 147 transition count 156
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 6 with 33 rules applied. Total rules applied 1147 place count 136 transition count 134
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1158 place count 125 transition count 134
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 1158 place count 125 transition count 123
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 1180 place count 114 transition count 123
Applied a total of 1180 rules in 77 ms. Remains 114 /1064 variables (removed 950) and now considering 123/1062 (removed 939) transitions.
// Phase 1: matrix 123 rows 114 cols
[2024-05-26 05:29:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-26 05:29:43] [INFO ] Implicit Places using invariants in 84 ms returned [11, 80]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 87 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1064 places, 123/1062 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 121
Reduce places removed 2 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 13 rules applied. Total rules applied 15 place count 110 transition count 110
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 26 place count 99 transition count 110
Applied a total of 26 rules in 9 ms. Remains 99 /112 variables (removed 13) and now considering 110/123 (removed 13) transitions.
// Phase 1: matrix 110 rows 99 cols
[2024-05-26 05:29:43] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 05:29:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-26 05:29:43] [INFO ] Invariant cache hit.
[2024-05-26 05:29:43] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/1064 places, 110/1062 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 333 ms. Remains : 99/1064 places, 110/1062 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06
Product exploration explored 100000 steps with 4971 reset in 494 ms.
Product exploration explored 100000 steps with 4955 reset in 353 ms.
Computed a total of 99 stabilizing places and 110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 110
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 777 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 70 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p2)]
Knowledge based reduction with 14 factoid took 965 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p2), (NOT p2)]
[2024-05-26 05:29:46] [INFO ] Invariant cache hit.
[2024-05-26 05:29:46] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-26 05:29:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:29:46] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-26 05:29:46] [INFO ] Computed and/alt/rep : 88/99/88 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-26 05:29:46] [INFO ] Added : 22 causal constraints over 5 iterations in 119 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 11 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 110/110 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-26 05:29:46] [INFO ] Invariant cache hit.
[2024-05-26 05:29:46] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-26 05:29:46] [INFO ] Invariant cache hit.
[2024-05-26 05:29:47] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-26 05:29:47] [INFO ] Redundant transitions in 5 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-26 05:29:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 110/198 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 11/209 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 0/209 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 99 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2814 ms.
Refiners :[State Equation: 99/99 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 110/198 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 88/176 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 11/209 variables, 11/187 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/209 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 187 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2646 ms.
Refiners :[State Equation: 99/99 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 5487ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 5490ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5671 ms. Remains : 99/99 places, 110/110 transitions.
Computed a total of 99 stabilizing places and 110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 110
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 88 steps (0 resets) in 4 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 214 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p2)]
[2024-05-26 05:29:53] [INFO ] Invariant cache hit.
[2024-05-26 05:29:53] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-26 05:29:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 05:29:53] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-26 05:29:53] [INFO ] Computed and/alt/rep : 88/99/88 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-26 05:29:53] [INFO ] Added : 22 causal constraints over 5 iterations in 85 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 5002 reset in 193 ms.
Product exploration explored 100000 steps with 4979 reset in 326 ms.
Support contains 11 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 110/110 transitions.
Graph (complete) has 99 edges and 99 vertex of which 77 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 77 transition count 44
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 100 place count 33 transition count 33
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 100 place count 33 transition count 22
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 122 place count 22 transition count 22
Applied a total of 122 rules in 8 ms. Remains 22 /99 variables (removed 77) and now considering 22/110 (removed 88) transitions.
// Phase 1: matrix 22 rows 22 cols
[2024-05-26 05:29:54] [INFO ] Computed 0 invariants in 0 ms
[2024-05-26 05:29:54] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-26 05:29:54] [INFO ] Invariant cache hit.
[2024-05-26 05:29:54] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-26 05:29:54] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-26 05:29:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 22/33 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 11/44 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/44 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 191 ms.
Refiners :[State Equation: 22/22 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 22/33 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 11/44 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 33 constraints, problems are : Problem set: 0 solved, 11 unsolved in 144 ms.
Refiners :[State Equation: 22/22 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 342ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 344ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/99 places, 22/110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 433 ms. Remains : 22/99 places, 22/110 transitions.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-06 finished in 12139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 3 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1062/1062 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1061 transition count 1062
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 62 place count 1002 transition count 993
Iterating global reduction 1 with 59 rules applied. Total rules applied 121 place count 1002 transition count 993
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 133 place count 1001 transition count 982
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 168 place count 966 transition count 937
Iterating global reduction 2 with 35 rules applied. Total rules applied 203 place count 966 transition count 937
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 214 place count 955 transition count 937
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 248 place count 921 transition count 883
Iterating global reduction 3 with 34 rules applied. Total rules applied 282 place count 921 transition count 883
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 293 place count 910 transition count 883
Discarding 43 places :
Symmetric choice reduction at 4 with 43 rule applications. Total rules 336 place count 867 transition count 830
Iterating global reduction 4 with 43 rules applied. Total rules applied 379 place count 867 transition count 830
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 390 place count 867 transition count 819
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 411 place count 846 transition count 798
Iterating global reduction 5 with 21 rules applied. Total rules applied 432 place count 846 transition count 798
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 453 place count 825 transition count 777
Iterating global reduction 5 with 21 rules applied. Total rules applied 474 place count 825 transition count 777
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 495 place count 804 transition count 756
Iterating global reduction 5 with 21 rules applied. Total rules applied 516 place count 804 transition count 756
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 537 place count 783 transition count 735
Iterating global reduction 5 with 21 rules applied. Total rules applied 558 place count 783 transition count 735
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 559 place count 782 transition count 735
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 580 place count 761 transition count 714
Iterating global reduction 6 with 21 rules applied. Total rules applied 601 place count 761 transition count 714
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 621 place count 741 transition count 694
Iterating global reduction 6 with 20 rules applied. Total rules applied 641 place count 741 transition count 694
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 651 place count 731 transition count 684
Iterating global reduction 6 with 10 rules applied. Total rules applied 661 place count 731 transition count 684
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 671 place count 731 transition count 674
Applied a total of 671 rules in 334 ms. Remains 731 /1064 variables (removed 333) and now considering 674/1062 (removed 388) transitions.
// Phase 1: matrix 674 rows 731 cols
[2024-05-26 05:29:55] [INFO ] Computed 70 invariants in 6 ms
[2024-05-26 05:29:55] [INFO ] Implicit Places using invariants in 250 ms returned [146, 631]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 252 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 729/1064 places, 674/1062 transitions.
Applied a total of 0 rules in 33 ms. Remains 729 /729 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 619 ms. Remains : 729/1064 places, 674/1062 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08
Product exploration explored 100000 steps with 155 reset in 503 ms.
Product exploration explored 100000 steps with 155 reset in 537 ms.
Computed a total of 729 stabilizing places and 674 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 729 transition count 674
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 22 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-08 finished in 2072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 5 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1062/1062 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1061 transition count 1062
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 62 place count 1002 transition count 993
Iterating global reduction 1 with 59 rules applied. Total rules applied 121 place count 1002 transition count 993
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 132 place count 1002 transition count 982
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 167 place count 967 transition count 937
Iterating global reduction 2 with 35 rules applied. Total rules applied 202 place count 967 transition count 937
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 213 place count 956 transition count 937
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 247 place count 922 transition count 883
Iterating global reduction 3 with 34 rules applied. Total rules applied 281 place count 922 transition count 883
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 292 place count 911 transition count 883
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 334 place count 869 transition count 831
Iterating global reduction 4 with 42 rules applied. Total rules applied 376 place count 869 transition count 831
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 386 place count 869 transition count 821
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 407 place count 848 transition count 800
Iterating global reduction 5 with 21 rules applied. Total rules applied 428 place count 848 transition count 800
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 449 place count 827 transition count 779
Iterating global reduction 5 with 21 rules applied. Total rules applied 470 place count 827 transition count 779
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 490 place count 807 transition count 759
Iterating global reduction 5 with 20 rules applied. Total rules applied 510 place count 807 transition count 759
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 530 place count 787 transition count 739
Iterating global reduction 5 with 20 rules applied. Total rules applied 550 place count 787 transition count 739
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 551 place count 786 transition count 739
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 571 place count 766 transition count 719
Iterating global reduction 6 with 20 rules applied. Total rules applied 591 place count 766 transition count 719
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 611 place count 746 transition count 699
Iterating global reduction 6 with 20 rules applied. Total rules applied 631 place count 746 transition count 699
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 641 place count 736 transition count 689
Iterating global reduction 6 with 10 rules applied. Total rules applied 651 place count 736 transition count 689
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 11 rules applied. Total rules applied 662 place count 735 transition count 679
Applied a total of 662 rules in 539 ms. Remains 735 /1064 variables (removed 329) and now considering 679/1062 (removed 383) transitions.
// Phase 1: matrix 679 rows 735 cols
[2024-05-26 05:29:57] [INFO ] Computed 70 invariants in 7 ms
[2024-05-26 05:29:58] [INFO ] Implicit Places using invariants in 470 ms returned [147, 635]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 472 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 733/1064 places, 679/1062 transitions.
Applied a total of 0 rules in 35 ms. Remains 733 /733 variables (removed 0) and now considering 679/679 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1047 ms. Remains : 733/1064 places, 679/1062 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09
Stuttering criterion allowed to conclude after 1130 steps with 5 reset in 4 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-09 finished in 1229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(p1 U (G(p1)||(p1&&G(!p2))))))'
Support contains 4 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1062/1062 transitions.
Graph (complete) has 1391 edges and 1064 vertex of which 1020 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Discarding 44 places :
Also discarding 54 output transitions
Drop transitions (Output transitions of discarded places.) removed 54 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 558 rules applied. Total rules applied 559 place count 1006 transition count 442
Reduce places removed 555 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 611 rules applied. Total rules applied 1170 place count 450 transition count 387
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 1205 place count 416 transition count 386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1206 place count 415 transition count 386
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 131 Pre rules applied. Total rules applied 1206 place count 415 transition count 255
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 4 with 317 rules applied. Total rules applied 1523 place count 229 transition count 255
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 22 rules applied. Total rules applied 1545 place count 229 transition count 233
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1567 place count 207 transition count 233
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1567 place count 207 transition count 222
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1589 place count 196 transition count 222
Discarding 33 places :
Symmetric choice reduction at 6 with 33 rule applications. Total rules 1622 place count 163 transition count 179
Iterating global reduction 6 with 33 rules applied. Total rules applied 1655 place count 163 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1656 place count 163 transition count 178
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 15 Pre rules applied. Total rules applied 1656 place count 163 transition count 163
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 31 rules applied. Total rules applied 1687 place count 147 transition count 163
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1689 place count 145 transition count 141
Iterating global reduction 7 with 2 rules applied. Total rules applied 1691 place count 145 transition count 141
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 44 rules applied. Total rules applied 1735 place count 134 transition count 108
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 12 rules applied. Total rules applied 1747 place count 123 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1748 place count 122 transition count 107
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 11 Pre rules applied. Total rules applied 1748 place count 122 transition count 96
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 1770 place count 111 transition count 96
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 10 with 44 rules applied. Total rules applied 1814 place count 89 transition count 74
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1824 place count 79 transition count 64
Applied a total of 1824 rules in 62 ms. Remains 79 /1064 variables (removed 985) and now considering 64/1062 (removed 998) transitions.
// Phase 1: matrix 64 rows 79 cols
[2024-05-26 05:29:58] [INFO ] Computed 26 invariants in 0 ms
[2024-05-26 05:29:58] [INFO ] Implicit Places using invariants in 193 ms returned [1, 25, 26, 27, 28, 29, 30, 31, 32, 34, 35, 49, 50, 51, 52, 53, 54, 55, 56, 58, 59, 63, 67]
[2024-05-26 05:29:58] [INFO ] Actually due to overlaps returned [1, 67, 63, 49, 50, 51, 52, 53, 54, 55, 56, 58, 59, 25, 27, 28, 29, 30, 31, 32, 34, 35]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 195 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/1064 places, 64/1062 transitions.
Graph (complete) has 80 edges and 57 vertex of which 47 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 10 places and 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 43
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 36 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 35 transition count 42
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 5 place count 35 transition count 32
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 25 place count 25 transition count 32
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 33 place count 17 transition count 16
Iterating global reduction 3 with 8 rules applied. Total rules applied 41 place count 17 transition count 16
Applied a total of 41 rules in 7 ms. Remains 17 /57 variables (removed 40) and now considering 16/64 (removed 48) transitions.
// Phase 1: matrix 16 rows 17 cols
[2024-05-26 05:29:58] [INFO ] Computed 4 invariants in 0 ms
[2024-05-26 05:29:58] [INFO ] Implicit Places using invariants in 41 ms returned [3, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/1064 places, 16/1062 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 16
Applied a total of 2 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 14 cols
[2024-05-26 05:29:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-26 05:29:58] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-26 05:29:58] [INFO ] Invariant cache hit.
[2024-05-26 05:29:58] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 85 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 13/1064 places, 16/1062 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 395 ms. Remains : 13/1064 places, 16/1062 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10
Product exploration explored 100000 steps with 23532 reset in 221 ms.
Product exploration explored 100000 steps with 23531 reset in 239 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 1797 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2)]
RANDOM walk for 2045 steps (279 resets) in 17 ms. (113 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F p2), (F (NOT (OR p0 p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 1947 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2)]
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 13 cols
[2024-05-26 05:30:03] [INFO ] Computed 1 invariants in 1 ms
[2024-05-26 05:30:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-26 05:30:03] [INFO ] Invariant cache hit.
[2024-05-26 05:30:03] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-26 05:30:03] [INFO ] Redundant transitions in 19 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-26 05:30:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 16/26 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/29 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/29 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 14 constraints, problems are : Problem set: 0 solved, 8 unsolved in 115 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 16/26 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 3/29 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 22 constraints, problems are : Problem set: 0 solved, 8 unsolved in 136 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 256ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 256ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 348 ms. Remains : 13/13 places, 16/16 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 1708 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2)]
RANDOM walk for 3530 steps (488 resets) in 21 ms. (160 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F p2), (F (NOT (OR p0 p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 2263 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 23618 reset in 223 ms.
Product exploration explored 100000 steps with 23596 reset in 248 ms.
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-26 05:30:09] [INFO ] Invariant cache hit.
[2024-05-26 05:30:09] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-26 05:30:09] [INFO ] Invariant cache hit.
[2024-05-26 05:30:09] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-26 05:30:09] [INFO ] Redundant transitions in 19 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-26 05:30:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 16/26 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/29 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/29 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 14 constraints, problems are : Problem set: 0 solved, 8 unsolved in 173 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 16/26 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 3/29 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 22 constraints, problems are : Problem set: 0 solved, 8 unsolved in 144 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 323ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 324ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 428 ms. Remains : 13/13 places, 16/16 transitions.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-10 finished in 11758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1&&(p2||X(p3))))))))'
Support contains 5 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1062/1062 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1062 transition count 1062
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 59 place count 1005 transition count 995
Iterating global reduction 1 with 57 rules applied. Total rules applied 116 place count 1005 transition count 995
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 128 place count 1004 transition count 984
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 162 place count 970 transition count 940
Iterating global reduction 2 with 34 rules applied. Total rules applied 196 place count 970 transition count 940
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 207 place count 959 transition count 940
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 240 place count 926 transition count 897
Iterating global reduction 3 with 33 rules applied. Total rules applied 273 place count 926 transition count 897
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 3 with 10 rules applied. Total rules applied 283 place count 916 transition count 897
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 304 place count 895 transition count 866
Iterating global reduction 4 with 21 rules applied. Total rules applied 325 place count 895 transition count 866
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 346 place count 874 transition count 845
Iterating global reduction 4 with 21 rules applied. Total rules applied 367 place count 874 transition count 845
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 386 place count 855 transition count 826
Iterating global reduction 4 with 19 rules applied. Total rules applied 405 place count 855 transition count 826
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 423 place count 837 transition count 808
Iterating global reduction 4 with 18 rules applied. Total rules applied 441 place count 837 transition count 808
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 459 place count 819 transition count 790
Iterating global reduction 4 with 18 rules applied. Total rules applied 477 place count 819 transition count 790
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 495 place count 801 transition count 772
Iterating global reduction 4 with 18 rules applied. Total rules applied 513 place count 801 transition count 772
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 531 place count 783 transition count 754
Iterating global reduction 4 with 18 rules applied. Total rules applied 549 place count 783 transition count 754
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 559 place count 773 transition count 744
Iterating global reduction 4 with 10 rules applied. Total rules applied 569 place count 773 transition count 744
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 11 rules applied. Total rules applied 580 place count 772 transition count 734
Applied a total of 580 rules in 330 ms. Remains 772 /1064 variables (removed 292) and now considering 734/1062 (removed 328) transitions.
// Phase 1: matrix 734 rows 772 cols
[2024-05-26 05:30:10] [INFO ] Computed 72 invariants in 9 ms
[2024-05-26 05:30:10] [INFO ] Implicit Places using invariants in 309 ms returned [252, 324, 672]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 311 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 769/1064 places, 734/1062 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 768 transition count 733
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 768 transition count 733
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 767 transition count 732
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 767 transition count 732
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 766 transition count 731
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 766 transition count 731
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 765 transition count 730
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 765 transition count 730
Applied a total of 8 rules in 107 ms. Remains 765 /769 variables (removed 4) and now considering 730/734 (removed 4) transitions.
// Phase 1: matrix 730 rows 765 cols
[2024-05-26 05:30:10] [INFO ] Computed 69 invariants in 5 ms
[2024-05-26 05:30:11] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-26 05:30:11] [INFO ] Invariant cache hit.
[2024-05-26 05:30:12] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 765/1064 places, 730/1062 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2157 ms. Remains : 765/1064 places, 730/1062 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11
Stuttering criterion allowed to conclude after 1265 steps with 1 reset in 4 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-11 finished in 2443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X((p1||F(!p2)))))'
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1062/1062 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1062 transition count 1062
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 61 place count 1003 transition count 993
Iterating global reduction 1 with 59 rules applied. Total rules applied 120 place count 1003 transition count 993
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 132 place count 1002 transition count 982
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 167 place count 967 transition count 937
Iterating global reduction 2 with 35 rules applied. Total rules applied 202 place count 967 transition count 937
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 213 place count 956 transition count 937
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 246 place count 923 transition count 884
Iterating global reduction 3 with 33 rules applied. Total rules applied 279 place count 923 transition count 884
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 290 place count 912 transition count 884
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 332 place count 870 transition count 832
Iterating global reduction 4 with 42 rules applied. Total rules applied 374 place count 870 transition count 832
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 385 place count 870 transition count 821
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 405 place count 850 transition count 801
Iterating global reduction 5 with 20 rules applied. Total rules applied 425 place count 850 transition count 801
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 445 place count 830 transition count 781
Iterating global reduction 5 with 20 rules applied. Total rules applied 465 place count 830 transition count 781
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 485 place count 810 transition count 761
Iterating global reduction 5 with 20 rules applied. Total rules applied 505 place count 810 transition count 761
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 525 place count 790 transition count 741
Iterating global reduction 5 with 20 rules applied. Total rules applied 545 place count 790 transition count 741
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 546 place count 789 transition count 741
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 566 place count 769 transition count 721
Iterating global reduction 6 with 20 rules applied. Total rules applied 586 place count 769 transition count 721
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 606 place count 749 transition count 701
Iterating global reduction 6 with 20 rules applied. Total rules applied 626 place count 749 transition count 701
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 636 place count 739 transition count 691
Iterating global reduction 6 with 10 rules applied. Total rules applied 646 place count 739 transition count 691
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 11 rules applied. Total rules applied 657 place count 738 transition count 681
Applied a total of 657 rules in 534 ms. Remains 738 /1064 variables (removed 326) and now considering 681/1062 (removed 381) transitions.
// Phase 1: matrix 681 rows 738 cols
[2024-05-26 05:30:13] [INFO ] Computed 70 invariants in 6 ms
[2024-05-26 05:30:13] [INFO ] Implicit Places using invariants in 461 ms returned [146, 638]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 464 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 736/1064 places, 681/1062 transitions.
Applied a total of 0 rules in 35 ms. Remains 736 /736 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1034 ms. Remains : 736/1064 places, 681/1062 transitions.
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 541 ms.
Product exploration explored 100000 steps with 50000 reset in 381 ms.
Computed a total of 736 stabilizing places and 681 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 736 transition count 681
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLFireability-15 finished in 2527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!G(p0))||F(X(p1))) U p2))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(p1 U (G(p1)||(p1&&G(!p2))))))'
[2024-05-26 05:30:15] [INFO ] Flatten gal took : 82 ms
[2024-05-26 05:30:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-26 05:30:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1064 places, 1062 transitions and 2496 arcs took 17 ms.
Total runtime 53103 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FamilyReunion-PT-L00010M0001C001P001G001

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1064
TRANSITIONS: 1062
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.037s, Sys 0.000s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.001s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1411
MODEL NAME: /home/mcc/execution/415/model
1064 places, 1062 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
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 r157-smll-171636265800484"
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 ;