Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838855700300.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855700300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.9K Feb 26 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 12:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 12:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 134K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678504827464

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00010M0001C001P001G001
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 03:20:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:20:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:20:29] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-11 03:20:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-11 03:20:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 546 ms
[2023-03-11 03:20:29] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2023-03-11 03:20:29] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 03:20:29] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 6 ms.
[2023-03-11 03:20:29] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10007 steps, including 14 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 27) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 99 cols
[2023-03-11 03:20:30] [INFO ] Computed 33 place invariants in 16 ms
[2023-03-11 03:20:30] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-11 03:20:30] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 17 ms returned sat
[2023-03-11 03:20:30] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:20:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 03:20:30] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 03:20:30] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:20:30] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 03:20:30] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 101 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 2 ms.
[2023-03-11 03:20:30] [INFO ] Flatten gal took : 102 ms
[2023-03-11 03:20:30] [INFO ] Flatten gal took : 17 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
[2023-03-11 03:20:30] [INFO ] Unfolded HLPN to a Petri net with 1379 places and 1069 transitions 3062 arcs in 30 ms.
[2023-03-11 03:20:30] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2023-03-11 03:20:30] [INFO ] Reduced 11 identical enabling conditions.
[2023-03-11 03:20:30] [INFO ] Reduced 11 identical enabling conditions.
[2023-03-11 03:20:30] [INFO ] Reduced 11 identical enabling conditions.
[2023-03-11 03:20:30] [INFO ] Reduced 11 identical enabling conditions.
[2023-03-11 03:20:30] [INFO ] Reduced 11 identical enabling conditions.
[2023-03-11 03:20:30] [INFO ] Reduced 11 identical enabling conditions.
Deduced a syphon composed of 11 places in 11 ms
Reduce places removed 19 places and 0 transitions.
Support contains 441 out of 1360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1069/1069 transitions.
Reduce places removed 42 places and 0 transitions.
Discarding 176 places :
Implicit places reduction removed 176 places
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 1142 transition count 1069
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 263 place count 1097 transition count 1024
Iterating global reduction 1 with 45 rules applied. Total rules applied 308 place count 1097 transition count 1024
Applied a total of 308 rules in 145 ms. Remains 1097 /1360 variables (removed 263) and now considering 1024/1069 (removed 45) transitions.
// Phase 1: matrix 1024 rows 1097 cols
[2023-03-11 03:20:30] [INFO ] Computed 126 place invariants in 40 ms
[2023-03-11 03:20:31] [INFO ] Implicit Places using invariants in 366 ms returned [99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 198, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 370 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1063/1360 places, 1024/1069 transitions.
Applied a total of 0 rules in 39 ms. Remains 1063 /1063 variables (removed 0) and now considering 1024/1024 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 554 ms. Remains : 1063/1360 places, 1024/1069 transitions.
Support contains 441 out of 1063 places after structural reductions.
[2023-03-11 03:20:31] [INFO ] Flatten gal took : 66 ms
[2023-03-11 03:20:31] [INFO ] Flatten gal took : 61 ms
[2023-03-11 03:20:31] [INFO ] Input system was already deterministic with 1024 transitions.
Support contains 408 out of 1063 places (down from 441) after GAL structural reductions.
Finished random walk after 623 steps, including 0 resets, run visited all 27 properties in 50 ms. (steps per millisecond=12 )
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1063 stabilizing places and 1024 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1063 transition count 1024
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G((p1||F(p2)))||(!p1 U X(p2)))&&p0)))'
Support contains 44 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1030 transition count 991
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1030 transition count 991
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 88 place count 1008 transition count 959
Iterating global reduction 0 with 22 rules applied. Total rules applied 110 place count 1008 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 121 place count 997 transition count 959
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 133 place count 985 transition count 937
Iterating global reduction 1 with 12 rules applied. Total rules applied 145 place count 985 transition count 937
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 156 place count 974 transition count 926
Iterating global reduction 1 with 11 rules applied. Total rules applied 167 place count 974 transition count 926
Applied a total of 167 rules in 333 ms. Remains 974 /1063 variables (removed 89) and now considering 926/1024 (removed 98) transitions.
// Phase 1: matrix 926 rows 974 cols
[2023-03-11 03:20:32] [INFO ] Computed 81 place invariants in 16 ms
[2023-03-11 03:20:32] [INFO ] Implicit Places using invariants in 261 ms returned [485, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 576, 841]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 274 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 960/1063 places, 926/1024 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 939 transition count 905
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 939 transition count 905
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 929 transition count 885
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 929 transition count 885
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 919 transition count 875
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 919 transition count 875
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 909 transition count 865
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 909 transition count 865
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 899 transition count 855
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 899 transition count 855
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 889 transition count 845
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 889 transition count 845
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 879 transition count 835
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 879 transition count 835
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 869 transition count 825
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 869 transition count 825
Applied a total of 182 rules in 447 ms. Remains 869 /960 variables (removed 91) and now considering 825/926 (removed 101) transitions.
// Phase 1: matrix 825 rows 869 cols
[2023-03-11 03:20:33] [INFO ] Computed 67 place invariants in 7 ms
[2023-03-11 03:20:33] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-11 03:20:33] [INFO ] Invariant cache hit.
[2023-03-11 03:20:33] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 869/1063 places, 825/1024 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1809 ms. Remains : 869/1063 places, 825/1024 transitions.
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (LT s409 1) (LT s408 1) (LT s411 1) (LT s410 1) (LT s413 1) (LT s412 1) (LT s415 1) (LT s414 1) (LT s403 1) (LT s405 1) (LT s404 1) (LT s407 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 384 reset in 504 ms.
Product exploration explored 100000 steps with 386 reset in 440 ms.
Computed a total of 869 stabilizing places and 825 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 869 transition count 825
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (AND p0 p1 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X p0), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (F (G p0)), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 (NOT p2))
Knowledge based reduction with 22 factoid took 989 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-00 finished in 4420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 11 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1030 transition count 991
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1030 transition count 991
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 88 place count 1008 transition count 959
Iterating global reduction 0 with 22 rules applied. Total rules applied 110 place count 1008 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 121 place count 997 transition count 959
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 133 place count 985 transition count 937
Iterating global reduction 1 with 12 rules applied. Total rules applied 145 place count 985 transition count 937
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 167 place count 963 transition count 915
Iterating global reduction 1 with 22 rules applied. Total rules applied 189 place count 963 transition count 915
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 200 place count 952 transition count 904
Iterating global reduction 1 with 11 rules applied. Total rules applied 211 place count 952 transition count 904
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 222 place count 941 transition count 893
Iterating global reduction 1 with 11 rules applied. Total rules applied 233 place count 941 transition count 893
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 244 place count 930 transition count 882
Iterating global reduction 1 with 11 rules applied. Total rules applied 255 place count 930 transition count 882
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 266 place count 919 transition count 871
Iterating global reduction 1 with 11 rules applied. Total rules applied 277 place count 919 transition count 871
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 288 place count 908 transition count 860
Iterating global reduction 1 with 11 rules applied. Total rules applied 299 place count 908 transition count 860
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 310 place count 897 transition count 849
Iterating global reduction 1 with 11 rules applied. Total rules applied 321 place count 897 transition count 849
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 332 place count 886 transition count 838
Iterating global reduction 1 with 11 rules applied. Total rules applied 343 place count 886 transition count 838
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 354 place count 875 transition count 827
Iterating global reduction 1 with 11 rules applied. Total rules applied 365 place count 875 transition count 827
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 376 place count 864 transition count 816
Iterating global reduction 1 with 11 rules applied. Total rules applied 387 place count 864 transition count 816
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 398 place count 853 transition count 805
Iterating global reduction 1 with 11 rules applied. Total rules applied 409 place count 853 transition count 805
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 420 place count 842 transition count 794
Iterating global reduction 1 with 11 rules applied. Total rules applied 431 place count 842 transition count 794
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 442 place count 831 transition count 783
Iterating global reduction 1 with 11 rules applied. Total rules applied 453 place count 831 transition count 783
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 464 place count 831 transition count 772
Applied a total of 464 rules in 392 ms. Remains 831 /1063 variables (removed 232) and now considering 772/1024 (removed 252) transitions.
// Phase 1: matrix 772 rows 831 cols
[2023-03-11 03:20:36] [INFO ] Computed 81 place invariants in 14 ms
[2023-03-11 03:20:37] [INFO ] Implicit Places using invariants in 216 ms returned [342, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 433, 698]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 218 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 817/1063 places, 772/1024 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 796 transition count 751
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 796 transition count 751
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 786 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 786 transition count 731
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 776 transition count 721
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 776 transition count 721
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 766 transition count 711
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 766 transition count 711
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 756 transition count 701
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 756 transition count 701
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 746 transition count 691
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 746 transition count 691
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 736 transition count 681
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 736 transition count 681
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 726 transition count 671
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 726 transition count 671
Applied a total of 182 rules in 255 ms. Remains 726 /817 variables (removed 91) and now considering 671/772 (removed 101) transitions.
// Phase 1: matrix 671 rows 726 cols
[2023-03-11 03:20:37] [INFO ] Computed 67 place invariants in 8 ms
[2023-03-11 03:20:37] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-11 03:20:37] [INFO ] Invariant cache hit.
[2023-03-11 03:20:37] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 726/1063 places, 671/1024 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1419 ms. Remains : 726/1063 places, 671/1024 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s20 1) (GEQ s21 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 563 reset in 197 ms.
Product exploration explored 100000 steps with 566 reset in 212 ms.
Computed a total of 726 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 200 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=100 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 03:20:39] [INFO ] Invariant cache hit.
[2023-03-11 03:20:39] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 20 ms returned sat
[2023-03-11 03:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:20:39] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2023-03-11 03:20:39] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 45 ms.
[2023-03-11 03:20:42] [INFO ] Added : 231 causal constraints over 47 iterations in 2319 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 726 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 671/671 transitions.
Applied a total of 0 rules in 17 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2023-03-11 03:20:42] [INFO ] Invariant cache hit.
[2023-03-11 03:20:42] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-11 03:20:42] [INFO ] Invariant cache hit.
[2023-03-11 03:20:42] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2023-03-11 03:20:42] [INFO ] Invariant cache hit.
[2023-03-11 03:20:43] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 976 ms. Remains : 726/726 places, 671/671 transitions.
Computed a total of 726 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 160 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=160 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 03:20:44] [INFO ] Invariant cache hit.
[2023-03-11 03:20:44] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 21 ms returned sat
[2023-03-11 03:20:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:20:44] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-11 03:20:44] [INFO ] Computed and/alt/rep : 658/736/658 causal constraints (skipped 2 transitions) in 39 ms.
[2023-03-11 03:20:46] [INFO ] Added : 231 causal constraints over 47 iterations in 2236 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 562 reset in 193 ms.
Product exploration explored 100000 steps with 565 reset in 209 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 726 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 726/726 places, 671/671 transitions.
Graph (complete) has 814 edges and 726 vertex of which 264 are kept as prefixes of interest. Removing 462 places using SCC suffix rule.8 ms
Discarding 462 places :
Also discarding 407 output transitions
Drop transitions removed 407 transitions
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 264 transition count 264
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 121 Pre rules applied. Total rules applied 122 place count 264 transition count 264
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 1 with 121 rules applied. Total rules applied 243 place count 264 transition count 264
Discarding 231 places :
Symmetric choice reduction at 1 with 231 rule applications. Total rules 474 place count 33 transition count 33
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 231 rules applied. Total rules applied 705 place count 33 transition count 33
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 705 rules in 52 ms. Remains 33 /726 variables (removed 693) and now considering 33/671 (removed 638) transitions.
[2023-03-11 03:20:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 33 rows 33 cols
[2023-03-11 03:20:47] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 03:20:47] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/726 places, 33/671 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 33/726 places, 33/671 transitions.
Support contains 11 out of 726 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 726/726 places, 671/671 transitions.
Applied a total of 0 rules in 43 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
// Phase 1: matrix 671 rows 726 cols
[2023-03-11 03:20:47] [INFO ] Computed 67 place invariants in 15 ms
[2023-03-11 03:20:48] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-11 03:20:48] [INFO ] Invariant cache hit.
[2023-03-11 03:20:48] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2023-03-11 03:20:48] [INFO ] Invariant cache hit.
[2023-03-11 03:20:48] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 933 ms. Remains : 726/726 places, 671/671 transitions.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01 finished in 12462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(X(p2)||p1)))))'
Support contains 22 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1030 transition count 991
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1030 transition count 991
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 88 place count 1008 transition count 959
Iterating global reduction 0 with 22 rules applied. Total rules applied 110 place count 1008 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 121 place count 997 transition count 959
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 133 place count 985 transition count 937
Iterating global reduction 1 with 12 rules applied. Total rules applied 145 place count 985 transition count 937
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 167 place count 963 transition count 915
Iterating global reduction 1 with 22 rules applied. Total rules applied 189 place count 963 transition count 915
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 200 place count 952 transition count 904
Iterating global reduction 1 with 11 rules applied. Total rules applied 211 place count 952 transition count 904
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 222 place count 941 transition count 893
Iterating global reduction 1 with 11 rules applied. Total rules applied 233 place count 941 transition count 893
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 244 place count 930 transition count 882
Iterating global reduction 1 with 11 rules applied. Total rules applied 255 place count 930 transition count 882
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 266 place count 919 transition count 871
Iterating global reduction 1 with 11 rules applied. Total rules applied 277 place count 919 transition count 871
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 288 place count 908 transition count 860
Iterating global reduction 1 with 11 rules applied. Total rules applied 299 place count 908 transition count 860
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 310 place count 897 transition count 849
Iterating global reduction 1 with 11 rules applied. Total rules applied 321 place count 897 transition count 849
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 332 place count 886 transition count 838
Iterating global reduction 1 with 11 rules applied. Total rules applied 343 place count 886 transition count 838
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 354 place count 875 transition count 827
Iterating global reduction 1 with 11 rules applied. Total rules applied 365 place count 875 transition count 827
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 376 place count 864 transition count 816
Iterating global reduction 1 with 11 rules applied. Total rules applied 387 place count 864 transition count 816
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 398 place count 853 transition count 805
Iterating global reduction 1 with 11 rules applied. Total rules applied 409 place count 853 transition count 805
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 420 place count 842 transition count 794
Iterating global reduction 1 with 11 rules applied. Total rules applied 431 place count 842 transition count 794
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 442 place count 831 transition count 783
Iterating global reduction 1 with 11 rules applied. Total rules applied 453 place count 831 transition count 783
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 464 place count 831 transition count 772
Applied a total of 464 rules in 350 ms. Remains 831 /1063 variables (removed 232) and now considering 772/1024 (removed 252) transitions.
// Phase 1: matrix 772 rows 831 cols
[2023-03-11 03:20:49] [INFO ] Computed 81 place invariants in 11 ms
[2023-03-11 03:20:49] [INFO ] Implicit Places using invariants in 197 ms returned [342, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 433, 698]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 199 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 817/1063 places, 772/1024 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 796 transition count 751
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 796 transition count 751
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 786 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 786 transition count 731
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 776 transition count 721
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 776 transition count 721
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 766 transition count 711
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 766 transition count 711
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 756 transition count 701
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 756 transition count 701
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 746 transition count 691
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 746 transition count 691
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 736 transition count 681
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 736 transition count 681
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 726 transition count 671
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 726 transition count 671
Applied a total of 182 rules in 133 ms. Remains 726 /817 variables (removed 91) and now considering 671/772 (removed 101) transitions.
// Phase 1: matrix 671 rows 726 cols
[2023-03-11 03:20:49] [INFO ] Computed 67 place invariants in 9 ms
[2023-03-11 03:20:49] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-11 03:20:49] [INFO ] Invariant cache hit.
[2023-03-11 03:20:50] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 726/1063 places, 671/1024 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1266 ms. Remains : 726/1063 places, 671/1024 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s307 1) (GEQ s308 1) (GEQ s305 1) (GEQ s306 1) (GEQ s311 1) (GEQ s312 1) (GEQ s309 1) (GEQ s310 1) (GEQ s315 1) (GEQ s314 1) (GEQ s313 1)), p0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 645 steps with 0 reset in 4 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02 finished in 1389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||(!p0&&G(!p1)))))))'
Support contains 33 out of 1063 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Graph (complete) has 1342 edges and 1063 vertex of which 1007 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.7 ms
Discarding 56 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Reduce places removed 11 places and 11 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 583 transitions
Trivial Post-agglo rules discarded 583 transitions
Performed 583 trivial Post agglomeration. Transition count delta: 583
Iterating post reduction 0 with 594 rules applied. Total rules applied 595 place count 996 transition count 374
Reduce places removed 583 places and 0 transitions.
Iterating post reduction 1 with 583 rules applied. Total rules applied 1178 place count 413 transition count 374
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 1178 place count 413 transition count 242
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 44 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 1486 place count 237 transition count 242
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 33 rules applied. Total rules applied 1519 place count 215 transition count 231
Reduce places removed 11 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 3 with 33 rules applied. Total rules applied 1552 place count 204 transition count 209
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1574 place count 182 transition count 209
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1574 place count 182 transition count 198
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 1596 place count 171 transition count 198
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1608 place count 159 transition count 176
Iterating global reduction 5 with 12 rules applied. Total rules applied 1620 place count 159 transition count 176
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1631 place count 159 transition count 165
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1631 place count 159 transition count 154
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 1653 place count 148 transition count 154
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1654 place count 147 transition count 143
Iterating global reduction 6 with 1 rules applied. Total rules applied 1655 place count 147 transition count 143
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 6 with 44 rules applied. Total rules applied 1699 place count 125 transition count 121
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 1710 place count 114 transition count 110
Applied a total of 1710 rules in 61 ms. Remains 114 /1063 variables (removed 949) and now considering 110/1024 (removed 914) transitions.
// Phase 1: matrix 110 rows 114 cols
[2023-03-11 03:20:50] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-11 03:20:50] [INFO ] Implicit Places using invariants in 59 ms returned [12, 35, 80, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 60 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/1063 places, 110/1024 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 100 transition count 99
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 89 transition count 99
Applied a total of 22 rules in 4 ms. Remains 89 /100 variables (removed 11) and now considering 99/110 (removed 11) transitions.
// Phase 1: matrix 99 rows 89 cols
[2023-03-11 03:20:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 03:20:50] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-11 03:20:50] [INFO ] Invariant cache hit.
[2023-03-11 03:20:50] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/1063 places, 99/1024 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 89/1063 places, 99/1024 transitions.
Stuttering acceptance computed with spot in 111 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s27 1) (GEQ s28 1) (GEQ s25 1) (GEQ s26 1) (GEQ s31 1) (GEQ s32 1) (GEQ s29 1) (GEQ s30 1) (GEQ s33 1) (GEQ s23 1) (GEQ s24 1)), p0:(OR (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2500 reset in 297 ms.
Product exploration explored 100000 steps with 2500 reset in 296 ms.
Computed a total of 89 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 89 transition count 99
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 8 factoid took 361 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-03 finished in 1339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 33 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1041 transition count 1002
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1041 transition count 1002
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 56 place count 1029 transition count 980
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 1029 transition count 980
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 79 place count 1018 transition count 980
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 91 place count 1006 transition count 958
Iterating global reduction 1 with 12 rules applied. Total rules applied 103 place count 1006 transition count 958
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 125 place count 984 transition count 936
Iterating global reduction 1 with 22 rules applied. Total rules applied 147 place count 984 transition count 936
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 158 place count 973 transition count 925
Iterating global reduction 1 with 11 rules applied. Total rules applied 169 place count 973 transition count 925
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 180 place count 962 transition count 914
Iterating global reduction 1 with 11 rules applied. Total rules applied 191 place count 962 transition count 914
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 202 place count 951 transition count 903
Iterating global reduction 1 with 11 rules applied. Total rules applied 213 place count 951 transition count 903
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 224 place count 940 transition count 892
Iterating global reduction 1 with 11 rules applied. Total rules applied 235 place count 940 transition count 892
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 246 place count 929 transition count 881
Iterating global reduction 1 with 11 rules applied. Total rules applied 257 place count 929 transition count 881
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 268 place count 918 transition count 870
Iterating global reduction 1 with 11 rules applied. Total rules applied 279 place count 918 transition count 870
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 290 place count 907 transition count 859
Iterating global reduction 1 with 11 rules applied. Total rules applied 301 place count 907 transition count 859
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 312 place count 896 transition count 848
Iterating global reduction 1 with 11 rules applied. Total rules applied 323 place count 896 transition count 848
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 334 place count 885 transition count 837
Iterating global reduction 1 with 11 rules applied. Total rules applied 345 place count 885 transition count 837
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 356 place count 874 transition count 826
Iterating global reduction 1 with 11 rules applied. Total rules applied 367 place count 874 transition count 826
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 378 place count 863 transition count 815
Iterating global reduction 1 with 11 rules applied. Total rules applied 389 place count 863 transition count 815
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 400 place count 852 transition count 804
Iterating global reduction 1 with 11 rules applied. Total rules applied 411 place count 852 transition count 804
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 422 place count 852 transition count 793
Applied a total of 422 rules in 351 ms. Remains 852 /1063 variables (removed 211) and now considering 793/1024 (removed 231) transitions.
// Phase 1: matrix 793 rows 852 cols
[2023-03-11 03:20:52] [INFO ] Computed 81 place invariants in 10 ms
[2023-03-11 03:20:52] [INFO ] Implicit Places using invariants in 188 ms returned [342, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 443, 719]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 189 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 838/1063 places, 793/1024 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 828 transition count 783
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 828 transition count 783
Applied a total of 20 rules in 36 ms. Remains 828 /838 variables (removed 10) and now considering 783/793 (removed 10) transitions.
// Phase 1: matrix 783 rows 828 cols
[2023-03-11 03:20:52] [INFO ] Computed 67 place invariants in 7 ms
[2023-03-11 03:20:52] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-11 03:20:52] [INFO ] Invariant cache hit.
[2023-03-11 03:20:52] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 828/1063 places, 783/1024 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1183 ms. Remains : 828/1063 places, 783/1024 transitions.
Stuttering acceptance computed with spot in 453 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s429 1) (LT s430 1) (LT s427 1) (LT s422 1) (LT s428 1) (LT s421 1) (LT s425 1) (LT s424 1) (LT s426 1) (LT s423 1) (LT s431 1)), p1:(OR (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 339 ms.
Product exploration explored 100000 steps with 50000 reset in 428 ms.
Computed a total of 828 stabilizing places and 783 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 828 transition count 783
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04 finished in 2680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(!(!p0 U !p1))||X((F(p3)||p2)))))'
Support contains 66 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1041 transition count 1002
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1041 transition count 1002
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 65 place count 1020 transition count 981
Iterating global reduction 0 with 21 rules applied. Total rules applied 86 place count 1020 transition count 981
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1019 transition count 970
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1019 transition count 970
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 99 place count 1008 transition count 959
Iterating global reduction 0 with 11 rules applied. Total rules applied 110 place count 1008 transition count 959
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 121 place count 997 transition count 948
Iterating global reduction 0 with 11 rules applied. Total rules applied 132 place count 997 transition count 948
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 143 place count 986 transition count 937
Iterating global reduction 0 with 11 rules applied. Total rules applied 154 place count 986 transition count 937
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 165 place count 975 transition count 926
Iterating global reduction 0 with 11 rules applied. Total rules applied 176 place count 975 transition count 926
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 187 place count 964 transition count 915
Iterating global reduction 0 with 11 rules applied. Total rules applied 198 place count 964 transition count 915
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 209 place count 953 transition count 904
Iterating global reduction 0 with 11 rules applied. Total rules applied 220 place count 953 transition count 904
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 231 place count 942 transition count 893
Iterating global reduction 0 with 11 rules applied. Total rules applied 242 place count 942 transition count 893
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 253 place count 931 transition count 882
Iterating global reduction 0 with 11 rules applied. Total rules applied 264 place count 931 transition count 882
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 275 place count 920 transition count 871
Iterating global reduction 0 with 11 rules applied. Total rules applied 286 place count 920 transition count 871
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 297 place count 909 transition count 860
Iterating global reduction 0 with 11 rules applied. Total rules applied 308 place count 909 transition count 860
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 319 place count 898 transition count 849
Iterating global reduction 0 with 11 rules applied. Total rules applied 330 place count 898 transition count 849
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 341 place count 887 transition count 838
Iterating global reduction 0 with 11 rules applied. Total rules applied 352 place count 887 transition count 838
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 363 place count 876 transition count 827
Iterating global reduction 0 with 11 rules applied. Total rules applied 374 place count 876 transition count 827
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 385 place count 876 transition count 816
Applied a total of 385 rules in 342 ms. Remains 876 /1063 variables (removed 187) and now considering 816/1024 (removed 208) transitions.
// Phase 1: matrix 816 rows 876 cols
[2023-03-11 03:20:54] [INFO ] Computed 92 place invariants in 11 ms
[2023-03-11 03:20:54] [INFO ] Implicit Places using invariants in 216 ms returned [342, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 433]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 220 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 863/1063 places, 816/1024 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 842 transition count 795
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 842 transition count 795
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 832 transition count 775
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 832 transition count 775
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 822 transition count 765
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 822 transition count 765
Applied a total of 82 rules in 61 ms. Remains 822 /863 variables (removed 41) and now considering 765/816 (removed 51) transitions.
// Phase 1: matrix 765 rows 822 cols
[2023-03-11 03:20:55] [INFO ] Computed 79 place invariants in 10 ms
[2023-03-11 03:20:55] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-11 03:20:55] [INFO ] Invariant cache hit.
[2023-03-11 03:20:55] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 822/1063 places, 765/1024 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1374 ms. Remains : 822/1063 places, 765/1024 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s695 1) (GEQ s711 1)) (AND (GEQ s692 1) (GEQ s705 1)) (AND (GEQ s695 1) (GEQ s712 1)) (AND (GEQ s698 1) (GEQ s718 1)) (AND (GEQ s692 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 505 ms.
Product exploration explored 100000 steps with 50000 reset in 505 ms.
Computed a total of 822 stabilizing places and 765 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 822 transition count 765
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 p3) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))
Knowledge based reduction with 12 factoid took 382 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-05 finished in 3229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(G(p1))))'
Support contains 45 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1030 transition count 991
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1030 transition count 991
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 88 place count 1008 transition count 959
Iterating global reduction 0 with 22 rules applied. Total rules applied 110 place count 1008 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 121 place count 997 transition count 959
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 133 place count 985 transition count 937
Iterating global reduction 1 with 12 rules applied. Total rules applied 145 place count 985 transition count 937
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 156 place count 974 transition count 926
Iterating global reduction 1 with 11 rules applied. Total rules applied 167 place count 974 transition count 926
Applied a total of 167 rules in 117 ms. Remains 974 /1063 variables (removed 89) and now considering 926/1024 (removed 98) transitions.
// Phase 1: matrix 926 rows 974 cols
[2023-03-11 03:20:57] [INFO ] Computed 81 place invariants in 10 ms
[2023-03-11 03:20:57] [INFO ] Implicit Places using invariants in 221 ms returned [508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 576, 841]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 222 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 961/1063 places, 926/1024 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 940 transition count 905
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 940 transition count 905
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 930 transition count 885
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 930 transition count 885
Applied a total of 62 rules in 58 ms. Remains 930 /961 variables (removed 31) and now considering 885/926 (removed 41) transitions.
// Phase 1: matrix 885 rows 930 cols
[2023-03-11 03:20:58] [INFO ] Computed 68 place invariants in 7 ms
[2023-03-11 03:20:58] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-11 03:20:58] [INFO ] Invariant cache hit.
[2023-03-11 03:20:58] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 930/1063 places, 885/1024 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1117 ms. Remains : 930/1063 places, 885/1024 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (LT s577 1) (LT s574 1) (LT s573 1) (LT s576 1) (LT s575 1) (LT s570 1) (LT s569 1) (LT s572 1) (LT s571 1) (LT s568 1) (LT s567 1)) (AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 160 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06 finished in 1268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(p1)))))'
Support contains 77 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1030 transition count 991
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1030 transition count 991
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 88 place count 1008 transition count 959
Iterating global reduction 0 with 22 rules applied. Total rules applied 110 place count 1008 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 121 place count 997 transition count 959
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 133 place count 985 transition count 937
Iterating global reduction 1 with 12 rules applied. Total rules applied 145 place count 985 transition count 937
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 156 place count 974 transition count 926
Iterating global reduction 1 with 11 rules applied. Total rules applied 167 place count 974 transition count 926
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 178 place count 963 transition count 915
Iterating global reduction 1 with 11 rules applied. Total rules applied 189 place count 963 transition count 915
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 200 place count 952 transition count 904
Iterating global reduction 1 with 11 rules applied. Total rules applied 211 place count 952 transition count 904
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 222 place count 941 transition count 893
Iterating global reduction 1 with 11 rules applied. Total rules applied 233 place count 941 transition count 893
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 244 place count 930 transition count 882
Iterating global reduction 1 with 11 rules applied. Total rules applied 255 place count 930 transition count 882
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 266 place count 919 transition count 871
Iterating global reduction 1 with 11 rules applied. Total rules applied 277 place count 919 transition count 871
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 288 place count 908 transition count 860
Iterating global reduction 1 with 11 rules applied. Total rules applied 299 place count 908 transition count 860
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 310 place count 897 transition count 849
Iterating global reduction 1 with 11 rules applied. Total rules applied 321 place count 897 transition count 849
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 332 place count 886 transition count 838
Iterating global reduction 1 with 11 rules applied. Total rules applied 343 place count 886 transition count 838
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 354 place count 875 transition count 827
Iterating global reduction 1 with 11 rules applied. Total rules applied 365 place count 875 transition count 827
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 376 place count 864 transition count 816
Iterating global reduction 1 with 11 rules applied. Total rules applied 387 place count 864 transition count 816
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 398 place count 853 transition count 805
Iterating global reduction 1 with 11 rules applied. Total rules applied 409 place count 853 transition count 805
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 420 place count 842 transition count 794
Iterating global reduction 1 with 11 rules applied. Total rules applied 431 place count 842 transition count 794
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 442 place count 842 transition count 783
Applied a total of 442 rules in 327 ms. Remains 842 /1063 variables (removed 221) and now considering 783/1024 (removed 241) transitions.
// Phase 1: matrix 783 rows 842 cols
[2023-03-11 03:20:59] [INFO ] Computed 81 place invariants in 7 ms
[2023-03-11 03:20:59] [INFO ] Implicit Places using invariants in 206 ms returned [342, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 433, 709]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 208 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/1063 places, 783/1024 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 807 transition count 762
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 807 transition count 762
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 797 transition count 742
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 797 transition count 742
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 787 transition count 732
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 787 transition count 732
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 777 transition count 722
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 777 transition count 722
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 767 transition count 712
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 767 transition count 712
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 757 transition count 702
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 757 transition count 702
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 747 transition count 692
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 747 transition count 692
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 737 transition count 682
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 737 transition count 682
Applied a total of 182 rules in 116 ms. Remains 737 /828 variables (removed 91) and now considering 682/783 (removed 101) transitions.
// Phase 1: matrix 682 rows 737 cols
[2023-03-11 03:20:59] [INFO ] Computed 67 place invariants in 8 ms
[2023-03-11 03:20:59] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-11 03:20:59] [INFO ] Invariant cache hit.
[2023-03-11 03:21:00] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 737/1063 places, 682/1024 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1154 ms. Remains : 737/1063 places, 682/1024 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=7, aps=[p1:(AND (OR (LT s523 1) (LT s545 1)) (OR (LT s531 1) (LT s553 1)) (OR (LT s528 1) (LT s550 1)) (OR (LT s536 1) (LT s558 1)) (OR (LT s517 1) (LT s539 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 268 ms.
Product exploration explored 100000 steps with 25000 reset in 280 ms.
Computed a total of 737 stabilizing places and 682 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 737 transition count 682
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 239 ms. Reduced automaton from 9 states, 14 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 206 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 264 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 55 out of 737 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 682/682 transitions.
Applied a total of 0 rules in 17 ms. Remains 737 /737 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2023-03-11 03:21:02] [INFO ] Invariant cache hit.
[2023-03-11 03:21:02] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-11 03:21:02] [INFO ] Invariant cache hit.
[2023-03-11 03:21:02] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-11 03:21:02] [INFO ] Invariant cache hit.
[2023-03-11 03:21:02] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 836 ms. Remains : 737/737 places, 682/682 transitions.
Computed a total of 737 stabilizing places and 682 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 737 transition count 682
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 : [p1, true, (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 213 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=106 )
Knowledge obtained : [p1, true, (F (G p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 257 ms.
Product exploration explored 100000 steps with 25000 reset in 250 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 55 out of 737 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 737/737 places, 682/682 transitions.
Graph (complete) has 836 edges and 737 vertex of which 451 are kept as prefixes of interest. Removing 286 places using SCC suffix rule.3 ms
Discarding 286 places :
Also discarding 242 output transitions
Drop transitions removed 242 transitions
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 176 rules applied. Total rules applied 177 place count 451 transition count 440
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 143 Pre rules applied. Total rules applied 177 place count 451 transition count 440
Deduced a syphon composed of 319 places in 1 ms
Iterating global reduction 1 with 143 rules applied. Total rules applied 320 place count 451 transition count 440
Discarding 264 places :
Symmetric choice reduction at 1 with 264 rule applications. Total rules 584 place count 187 transition count 176
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 264 rules applied. Total rules applied 848 place count 187 transition count 176
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 859 place count 187 transition count 176
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 881 place count 165 transition count 154
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 903 place count 165 transition count 154
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 914 place count 165 transition count 176
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 925 place count 154 transition count 154
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 936 place count 154 transition count 154
Deduced a syphon composed of 44 places in 0 ms
Applied a total of 936 rules in 44 ms. Remains 154 /737 variables (removed 583) and now considering 154/682 (removed 528) transitions.
[2023-03-11 03:21:05] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 154 rows 154 cols
[2023-03-11 03:21:05] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-11 03:21:05] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/737 places, 154/682 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 154/737 places, 154/682 transitions.
Support contains 55 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 682/682 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 726 transition count 671
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 726 transition count 671
Applied a total of 22 rules in 24 ms. Remains 726 /737 variables (removed 11) and now considering 671/682 (removed 11) transitions.
// Phase 1: matrix 671 rows 726 cols
[2023-03-11 03:21:05] [INFO ] Computed 67 place invariants in 9 ms
[2023-03-11 03:21:05] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-11 03:21:05] [INFO ] Invariant cache hit.
[2023-03-11 03:21:05] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-11 03:21:05] [INFO ] Invariant cache hit.
[2023-03-11 03:21:05] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 726/737 places, 671/682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 774 ms. Remains : 726/737 places, 671/682 transitions.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07 finished in 7144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 1063 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Graph (complete) has 1342 edges and 1063 vertex of which 420 are kept as prefixes of interest. Removing 643 places using SCC suffix rule.3 ms
Discarding 643 places :
Also discarding 584 output transitions
Drop transitions removed 584 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 353 place count 409 transition count 77
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 705 place count 57 transition count 77
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 705 place count 57 transition count 66
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 727 place count 46 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 728 place count 45 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 729 place count 45 transition count 55
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 740 place count 45 transition count 44
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 751 place count 34 transition count 33
Applied a total of 751 rules in 14 ms. Remains 34 /1063 variables (removed 1029) and now considering 33/1024 (removed 991) transitions.
// Phase 1: matrix 33 rows 34 cols
[2023-03-11 03:21:06] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 03:21:06] [INFO ] Implicit Places using invariants in 25 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/1063 places, 33/1024 transitions.
Reduce places removed 11 places and 11 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /33 variables (removed 11) and now considering 22/33 (removed 11) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40 ms. Remains : 22/1063 places, 22/1024 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s21 1) (GEQ s18 1) (GEQ s17 1) (GEQ s20 1) (GEQ s19 1) (GEQ s14 1) (GEQ s13 1) (GEQ s16 1) (GEQ s15 1) (GEQ s12 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 24 steps with 1 reset in 1 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08 finished in 129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 33 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1030 transition count 991
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1030 transition count 991
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 88 place count 1008 transition count 959
Iterating global reduction 0 with 22 rules applied. Total rules applied 110 place count 1008 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 121 place count 997 transition count 959
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 133 place count 985 transition count 937
Iterating global reduction 1 with 12 rules applied. Total rules applied 145 place count 985 transition count 937
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 167 place count 963 transition count 915
Iterating global reduction 1 with 22 rules applied. Total rules applied 189 place count 963 transition count 915
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 200 place count 952 transition count 904
Iterating global reduction 1 with 11 rules applied. Total rules applied 211 place count 952 transition count 904
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 222 place count 941 transition count 893
Iterating global reduction 1 with 11 rules applied. Total rules applied 233 place count 941 transition count 893
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 244 place count 930 transition count 882
Iterating global reduction 1 with 11 rules applied. Total rules applied 255 place count 930 transition count 882
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 266 place count 919 transition count 871
Iterating global reduction 1 with 11 rules applied. Total rules applied 277 place count 919 transition count 871
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 288 place count 908 transition count 860
Iterating global reduction 1 with 11 rules applied. Total rules applied 299 place count 908 transition count 860
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 310 place count 897 transition count 849
Iterating global reduction 1 with 11 rules applied. Total rules applied 321 place count 897 transition count 849
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 332 place count 886 transition count 838
Iterating global reduction 1 with 11 rules applied. Total rules applied 343 place count 886 transition count 838
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 354 place count 875 transition count 827
Iterating global reduction 1 with 11 rules applied. Total rules applied 365 place count 875 transition count 827
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 376 place count 864 transition count 816
Iterating global reduction 1 with 11 rules applied. Total rules applied 387 place count 864 transition count 816
Applied a total of 387 rules in 279 ms. Remains 864 /1063 variables (removed 199) and now considering 816/1024 (removed 208) transitions.
// Phase 1: matrix 816 rows 864 cols
[2023-03-11 03:21:06] [INFO ] Computed 81 place invariants in 9 ms
[2023-03-11 03:21:06] [INFO ] Implicit Places using invariants in 222 ms returned [375, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 466, 731]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 224 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 850/1063 places, 816/1024 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 829 transition count 795
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 829 transition count 795
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 819 transition count 775
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 819 transition count 775
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 809 transition count 765
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 809 transition count 765
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 799 transition count 755
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 799 transition count 755
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 789 transition count 745
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 789 transition count 745
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 779 transition count 735
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 779 transition count 735
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 769 transition count 725
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 769 transition count 725
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 759 transition count 715
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 759 transition count 715
Applied a total of 182 rules in 138 ms. Remains 759 /850 variables (removed 91) and now considering 715/816 (removed 101) transitions.
// Phase 1: matrix 715 rows 759 cols
[2023-03-11 03:21:06] [INFO ] Computed 67 place invariants in 5 ms
[2023-03-11 03:21:06] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-11 03:21:06] [INFO ] Invariant cache hit.
[2023-03-11 03:21:07] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 759/1063 places, 715/1024 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1234 ms. Remains : 759/1063 places, 715/1024 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (GEQ s105 1) (GEQ s106 1) (GEQ s103 1) (GEQ s104 1) (GEQ s109 1) (GEQ s107 1) (GEQ s108 1) (GEQ s101 1) (GEQ s102 1) (GEQ s99 1) (GEQ s100 1)), p0:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10 finished in 1412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 22 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1030 transition count 991
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1030 transition count 991
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 88 place count 1008 transition count 959
Iterating global reduction 0 with 22 rules applied. Total rules applied 110 place count 1008 transition count 959
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 121 place count 997 transition count 959
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 133 place count 985 transition count 937
Iterating global reduction 1 with 12 rules applied. Total rules applied 145 place count 985 transition count 937
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 167 place count 963 transition count 915
Iterating global reduction 1 with 22 rules applied. Total rules applied 189 place count 963 transition count 915
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 200 place count 952 transition count 904
Iterating global reduction 1 with 11 rules applied. Total rules applied 211 place count 952 transition count 904
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 222 place count 941 transition count 893
Iterating global reduction 1 with 11 rules applied. Total rules applied 233 place count 941 transition count 893
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 244 place count 930 transition count 882
Iterating global reduction 1 with 11 rules applied. Total rules applied 255 place count 930 transition count 882
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 266 place count 919 transition count 871
Iterating global reduction 1 with 11 rules applied. Total rules applied 277 place count 919 transition count 871
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 288 place count 908 transition count 860
Iterating global reduction 1 with 11 rules applied. Total rules applied 299 place count 908 transition count 860
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 310 place count 897 transition count 849
Iterating global reduction 1 with 11 rules applied. Total rules applied 321 place count 897 transition count 849
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 332 place count 886 transition count 838
Iterating global reduction 1 with 11 rules applied. Total rules applied 343 place count 886 transition count 838
Applied a total of 343 rules in 254 ms. Remains 886 /1063 variables (removed 177) and now considering 838/1024 (removed 186) transitions.
// Phase 1: matrix 838 rows 886 cols
[2023-03-11 03:21:07] [INFO ] Computed 81 place invariants in 12 ms
[2023-03-11 03:21:08] [INFO ] Implicit Places using invariants in 213 ms returned [397, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 488, 753]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 214 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 872/1063 places, 838/1024 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 851 transition count 817
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 851 transition count 817
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 841 transition count 797
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 841 transition count 797
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 831 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 831 transition count 787
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 821 transition count 777
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 821 transition count 777
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 811 transition count 767
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 811 transition count 767
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 801 transition count 757
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 801 transition count 757
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 791 transition count 747
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 791 transition count 747
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 781 transition count 737
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 781 transition count 737
Applied a total of 182 rules in 152 ms. Remains 781 /872 variables (removed 91) and now considering 737/838 (removed 101) transitions.
// Phase 1: matrix 737 rows 781 cols
[2023-03-11 03:21:08] [INFO ] Computed 67 place invariants in 6 ms
[2023-03-11 03:21:08] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-11 03:21:08] [INFO ] Invariant cache hit.
[2023-03-11 03:21:08] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 781/1063 places, 737/1024 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1197 ms. Remains : 781/1063 places, 737/1024 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s190 1) (GEQ s191 1) (GEQ s192 1) (GEQ s193 1) (GEQ s187 1) (GEQ s188 1) (GEQ s189 1) (GEQ s198 1) (GEQ s199 1) (GEQ s200 1) (GEQ s201 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13 finished in 1311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p1&&G(p2)))||p0)))'
Support contains 44 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1041 transition count 1002
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1041 transition count 1002
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1030 transition count 981
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1030 transition count 981
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 77 place count 1019 transition count 981
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 88 place count 1008 transition count 970
Iterating global reduction 1 with 11 rules applied. Total rules applied 99 place count 1008 transition count 970
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 110 place count 997 transition count 959
Iterating global reduction 1 with 11 rules applied. Total rules applied 121 place count 997 transition count 959
Applied a total of 121 rules in 120 ms. Remains 997 /1063 variables (removed 66) and now considering 959/1024 (removed 65) transitions.
// Phase 1: matrix 959 rows 997 cols
[2023-03-11 03:21:09] [INFO ] Computed 81 place invariants in 12 ms
[2023-03-11 03:21:09] [INFO ] Implicit Places using invariants in 245 ms returned [485, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 864]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 247 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 984/1063 places, 959/1024 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 963 transition count 938
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 963 transition count 938
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 953 transition count 918
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 953 transition count 918
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 943 transition count 908
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 943 transition count 908
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 933 transition count 898
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 933 transition count 898
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 923 transition count 888
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 923 transition count 888
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 913 transition count 878
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 913 transition count 878
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 903 transition count 868
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 903 transition count 868
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 893 transition count 858
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 893 transition count 858
Applied a total of 182 rules in 177 ms. Remains 893 /984 variables (removed 91) and now considering 858/959 (removed 101) transitions.
// Phase 1: matrix 858 rows 893 cols
[2023-03-11 03:21:09] [INFO ] Computed 68 place invariants in 11 ms
[2023-03-11 03:21:09] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-11 03:21:09] [INFO ] Invariant cache hit.
[2023-03-11 03:21:10] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 893/1063 places, 858/1024 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1340 ms. Remains : 893/1063 places, 858/1024 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s506 1) (GEQ s507 1) (GEQ s508 1) (GEQ s509 1) (GEQ s502 1) (GEQ s503 1) (GEQ s504 1) (GEQ s505 1) (GEQ s498 1) (GEQ s499 1) (GEQ s500 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 671 reset in 356 ms.
Product exploration explored 100000 steps with 669 reset in 422 ms.
Computed a total of 893 stabilizing places and 858 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 858
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) (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 367 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 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 p2))]
Finished random walk after 188 steps, including 0 resets, run visited all 4 properties in 12 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2 p1))]
Knowledge based reduction with 10 factoid took 479 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 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 p2))]
Stuttering acceptance computed with spot in 113 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 p2))]
[2023-03-11 03:21:12] [INFO ] Invariant cache hit.
[2023-03-11 03:21:12] [INFO ] [Real]Absence check using 0 positive and 68 generalized place invariants in 46 ms returned sat
[2023-03-11 03:21:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:13] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2023-03-11 03:21:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:21:13] [INFO ] [Nat]Absence check using 0 positive and 68 generalized place invariants in 26 ms returned sat
[2023-03-11 03:21:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:14] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2023-03-11 03:21:14] [INFO ] Computed and/alt/rep : 823/923/823 causal constraints (skipped 24 transitions) in 48 ms.
[2023-03-11 03:21:18] [INFO ] Added : 303 causal constraints over 61 iterations in 4039 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-11 03:21:18] [INFO ] Invariant cache hit.
[2023-03-11 03:21:18] [INFO ] [Real]Absence check using 0 positive and 68 generalized place invariants in 25 ms returned sat
[2023-03-11 03:21:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:19] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2023-03-11 03:21:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:21:19] [INFO ] [Nat]Absence check using 0 positive and 68 generalized place invariants in 23 ms returned sat
[2023-03-11 03:21:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:20] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2023-03-11 03:21:20] [INFO ] Computed and/alt/rep : 823/923/823 causal constraints (skipped 24 transitions) in 41 ms.
[2023-03-11 03:21:24] [INFO ] Added : 330 causal constraints over 66 iterations in 3621 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 44 out of 893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 893/893 places, 858/858 transitions.
Applied a total of 0 rules in 18 ms. Remains 893 /893 variables (removed 0) and now considering 858/858 (removed 0) transitions.
[2023-03-11 03:21:24] [INFO ] Invariant cache hit.
[2023-03-11 03:21:24] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-11 03:21:24] [INFO ] Invariant cache hit.
[2023-03-11 03:21:24] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2023-03-11 03:21:24] [INFO ] Invariant cache hit.
[2023-03-11 03:21:25] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1185 ms. Remains : 893/893 places, 858/858 transitions.
Computed a total of 893 stabilizing places and 858 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 858
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 p2) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 386 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 192 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 10 factoid took 499 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-11 03:21:26] [INFO ] Invariant cache hit.
[2023-03-11 03:21:27] [INFO ] [Real]Absence check using 0 positive and 68 generalized place invariants in 25 ms returned sat
[2023-03-11 03:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:27] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2023-03-11 03:21:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:21:27] [INFO ] [Nat]Absence check using 0 positive and 68 generalized place invariants in 24 ms returned sat
[2023-03-11 03:21:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:28] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2023-03-11 03:21:28] [INFO ] Computed and/alt/rep : 823/923/823 causal constraints (skipped 24 transitions) in 47 ms.
[2023-03-11 03:21:32] [INFO ] Added : 330 causal constraints over 66 iterations in 3731 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-11 03:21:32] [INFO ] Invariant cache hit.
[2023-03-11 03:21:32] [INFO ] [Real]Absence check using 0 positive and 68 generalized place invariants in 25 ms returned sat
[2023-03-11 03:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:32] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2023-03-11 03:21:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:21:33] [INFO ] [Nat]Absence check using 0 positive and 68 generalized place invariants in 25 ms returned sat
[2023-03-11 03:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:34] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2023-03-11 03:21:34] [INFO ] Computed and/alt/rep : 823/923/823 causal constraints (skipped 24 transitions) in 42 ms.
[2023-03-11 03:21:37] [INFO ] Added : 303 causal constraints over 61 iterations in 3931 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 665 reset in 359 ms.
Product exploration explored 100000 steps with 669 reset in 366 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 44 out of 893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 893/893 places, 858/858 transitions.
Graph (complete) has 1045 edges and 893 vertex of which 453 are kept as prefixes of interest. Removing 440 places using SCC suffix rule.6 ms
Discarding 440 places :
Also discarding 385 output transitions
Drop transitions removed 385 transitions
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 176 rules applied. Total rules applied 177 place count 453 transition count 473
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 132 Pre rules applied. Total rules applied 177 place count 453 transition count 484
Deduced a syphon composed of 308 places in 0 ms
Iterating global reduction 1 with 132 rules applied. Total rules applied 309 place count 453 transition count 484
Discarding 231 places :
Symmetric choice reduction at 1 with 231 rule applications. Total rules 540 place count 222 transition count 253
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 231 rules applied. Total rules applied 771 place count 222 transition count 253
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 804 place count 222 transition count 253
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 859 place count 167 transition count 198
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 55 rules applied. Total rules applied 914 place count 167 transition count 198
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 914 rules in 33 ms. Remains 167 /893 variables (removed 726) and now considering 198/858 (removed 660) transitions.
[2023-03-11 03:21:39] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 198 rows 167 cols
[2023-03-11 03:21:39] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 03:21:39] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/893 places, 198/858 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 167/893 places, 198/858 transitions.
Support contains 44 out of 893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 893/893 places, 858/858 transitions.
Applied a total of 0 rules in 18 ms. Remains 893 /893 variables (removed 0) and now considering 858/858 (removed 0) transitions.
// Phase 1: matrix 858 rows 893 cols
[2023-03-11 03:21:39] [INFO ] Computed 68 place invariants in 15 ms
[2023-03-11 03:21:39] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-11 03:21:39] [INFO ] Invariant cache hit.
[2023-03-11 03:21:40] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2023-03-11 03:21:40] [INFO ] Invariant cache hit.
[2023-03-11 03:21:40] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1201 ms. Remains : 893/893 places, 858/858 transitions.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14 finished in 31557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 22 out of 1063 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Graph (complete) has 1342 edges and 1063 vertex of which 264 are kept as prefixes of interest. Removing 799 places using SCC suffix rule.3 ms
Discarding 799 places :
Also discarding 749 output transitions
Drop transitions removed 749 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 253 transition count 66
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 397 place count 55 transition count 66
Applied a total of 397 rules in 10 ms. Remains 55 /1063 variables (removed 1008) and now considering 66/1024 (removed 958) transitions.
// Phase 1: matrix 66 rows 55 cols
[2023-03-11 03:21:40] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 03:21:40] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 03:21:40] [INFO ] Invariant cache hit.
[2023-03-11 03:21:40] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-11 03:21:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 03:21:40] [INFO ] Invariant cache hit.
[2023-03-11 03:21:40] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/1063 places, 66/1024 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 55/1063 places, 66/1024 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s41 1) (LT s42 1) (LT s43 1) (LT s44 1) (LT s45 1) (LT s46 1) (LT s47 1) (LT s34 1) (LT s33 1) (LT s48 1) (LT s35 1) (LT s36 1) (LT s37 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2941 reset in 171 ms.
Product exploration explored 100000 steps with 2941 reset in 177 ms.
Computed a total of 55 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 66
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 : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15 finished in 798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Graph (complete) has 1342 edges and 1063 vertex of which 431 are kept as prefixes of interest. Removing 632 places using SCC suffix rule.3 ms
Discarding 632 places :
Also discarding 573 output transitions
Drop transitions removed 573 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 353 place count 420 transition count 88
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 705 place count 68 transition count 88
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 705 place count 68 transition count 66
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 749 place count 46 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 750 place count 45 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 751 place count 45 transition count 55
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 762 place count 45 transition count 44
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 773 place count 34 transition count 33
Applied a total of 773 rules in 15 ms. Remains 34 /1063 variables (removed 1029) and now considering 33/1024 (removed 991) transitions.
// Phase 1: matrix 33 rows 34 cols
[2023-03-11 03:21:41] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 03:21:41] [INFO ] Implicit Places using invariants in 33 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 33/1063 places, 33/1024 transitions.
Reduce places removed 11 places and 11 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /33 variables (removed 11) and now considering 22/33 (removed 11) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 50 ms. Remains : 22/1063 places, 22/1024 transitions.
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32374 reset in 80 ms.
Product exploration explored 100000 steps with 32363 reset in 97 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 22 rows 22 cols
[2023-03-11 03:21:42] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:42] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-11 03:21:42] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 03:21:42] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 03:21:42] [INFO ] Invariant cache hit.
[2023-03-11 03:21:42] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-11 03:21:42] [INFO ] Invariant cache hit.
[2023-03-11 03:21:42] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-11 03:21:42] [INFO ] Invariant cache hit.
[2023-03-11 03:21:42] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 22/22 places, 22/22 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 03:21:43] [INFO ] Invariant cache hit.
[2023-03-11 03:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-11 03:21:43] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 03:21:43] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32370 reset in 88 ms.
Product exploration explored 100000 steps with 32365 reset in 95 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 03:21:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 03:21:43] [INFO ] Invariant cache hit.
[2023-03-11 03:21:43] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37 ms. Remains : 22/22 places, 22/22 transitions.
Support contains 11 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 03:21:43] [INFO ] Invariant cache hit.
[2023-03-11 03:21:43] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-11 03:21:43] [INFO ] Invariant cache hit.
[2023-03-11 03:21:43] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-11 03:21:43] [INFO ] Invariant cache hit.
[2023-03-11 03:21:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 22/22 places, 22/22 transitions.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01 finished in 2640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p1&&G(p2)))||p0)))'
Found a Shortening insensitive property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 44 out of 1063 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1063/1063 places, 1024/1024 transitions.
Graph (complete) has 1342 edges and 1063 vertex of which 453 are kept as prefixes of interest. Removing 610 places using SCC suffix rule.4 ms
Discarding 610 places :
Also discarding 551 output transitions
Drop transitions removed 551 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions removed 308 transitions
Trivial Post-agglo rules discarded 308 transitions
Performed 308 trivial Post agglomeration. Transition count delta: 308
Iterating post reduction 0 with 308 rules applied. Total rules applied 309 place count 442 transition count 154
Reduce places removed 308 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 319 rules applied. Total rules applied 628 place count 134 transition count 143
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 639 place count 123 transition count 143
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 639 place count 123 transition count 132
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 661 place count 112 transition count 132
Applied a total of 661 rules in 16 ms. Remains 112 /1063 variables (removed 951) and now considering 132/1024 (removed 892) transitions.
// Phase 1: matrix 132 rows 112 cols
[2023-03-11 03:21:44] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 03:21:44] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 03:21:44] [INFO ] Invariant cache hit.
[2023-03-11 03:21:44] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-11 03:21:44] [INFO ] Invariant cache hit.
[2023-03-11 03:21:44] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 112/1063 places, 132/1024 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 178 ms. Remains : 112/1063 places, 132/1024 transitions.
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s55 1) (GEQ s56 1) (GEQ s57 1) (GEQ s58 1) (GEQ s51 1) (GEQ s52 1) (GEQ s53 1) (GEQ s54 1) (GEQ s47 1) (GEQ s48 1) (GEQ s49 1) (GEQ s50 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7555 reset in 381 ms.
Product exploration explored 100000 steps with 7576 reset in 395 ms.
Computed a total of 112 stabilizing places and 132 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 132
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) (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 362 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 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 p2))]
Finished random walk after 62 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2 p1))]
Knowledge based reduction with 10 factoid took 439 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 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 p2))]
Stuttering acceptance computed with spot in 133 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 p2))]
[2023-03-11 03:21:46] [INFO ] Invariant cache hit.
[2023-03-11 03:21:46] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:46] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-11 03:21:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:21:46] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:46] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-11 03:21:46] [INFO ] Computed and/alt/rep : 88/99/88 causal constraints (skipped 22 transitions) in 6 ms.
[2023-03-11 03:21:46] [INFO ] Added : 8 causal constraints over 2 iterations in 31 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-11 03:21:46] [INFO ] Invariant cache hit.
[2023-03-11 03:21:46] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:46] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-11 03:21:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:21:46] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:46] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-11 03:21:46] [INFO ] Computed and/alt/rep : 88/99/88 causal constraints (skipped 22 transitions) in 7 ms.
[2023-03-11 03:21:46] [INFO ] Added : 12 causal constraints over 3 iterations in 35 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 44 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 132/132 transitions.
Applied a total of 0 rules in 0 ms. Remains 112 /112 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2023-03-11 03:21:46] [INFO ] Invariant cache hit.
[2023-03-11 03:21:47] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-11 03:21:47] [INFO ] Invariant cache hit.
[2023-03-11 03:21:47] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-11 03:21:47] [INFO ] Invariant cache hit.
[2023-03-11 03:21:47] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 112/112 places, 132/132 transitions.
Computed a total of 112 stabilizing places and 132 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 132
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 p2) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 433 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 60 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 10 factoid took 462 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-11 03:21:48] [INFO ] Invariant cache hit.
[2023-03-11 03:21:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:48] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-11 03:21:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:21:48] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:48] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-11 03:21:48] [INFO ] Computed and/alt/rep : 88/99/88 causal constraints (skipped 22 transitions) in 14 ms.
[2023-03-11 03:21:48] [INFO ] Added : 12 causal constraints over 3 iterations in 46 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-11 03:21:48] [INFO ] Invariant cache hit.
[2023-03-11 03:21:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:48] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-11 03:21:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:21:48] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:48] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-11 03:21:48] [INFO ] Computed and/alt/rep : 88/99/88 causal constraints (skipped 22 transitions) in 8 ms.
[2023-03-11 03:21:48] [INFO ] Added : 8 causal constraints over 2 iterations in 35 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 7559 reset in 381 ms.
Product exploration explored 100000 steps with 7564 reset in 386 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 44 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 132/132 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2023-03-11 03:21:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:21:50] [INFO ] Invariant cache hit.
[2023-03-11 03:21:50] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 112/112 places, 132/132 transitions.
Support contains 44 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 132/132 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2023-03-11 03:21:50] [INFO ] Invariant cache hit.
[2023-03-11 03:21:50] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-11 03:21:50] [INFO ] Invariant cache hit.
[2023-03-11 03:21:50] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-11 03:21:50] [INFO ] Invariant cache hit.
[2023-03-11 03:21:50] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 112/112 places, 132/132 transitions.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14 finished in 6401 ms.
[2023-03-11 03:21:50] [INFO ] Flatten gal took : 41 ms
[2023-03-11 03:21:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 03:21:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1063 places, 1024 transitions and 2377 arcs took 4 ms.
Total runtime 81235 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2274/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2274/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2274/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 11914280 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16118928 kB
Could not compute solution for formula : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01
Could not compute solution for formula : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07
Could not compute solution for formula : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14

BK_STOP 1678506103320

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01
ltl formula formula --ltl=/tmp/2274/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1063 places, 1024 transitions and 2377 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.040 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2274/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2274/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2274/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2274/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07
ltl formula formula --ltl=/tmp/2274/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1063 places, 1024 transitions and 2377 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.060 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2274/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2274/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2274/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2274/ltl_1_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
corrupted size vs. prev_size in fastbins
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
corrupted size vs. prev_size in fastbins
ltl formula name FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14
ltl formula formula --ltl=/tmp/2274/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1063 places, 1024 transitions and 2377 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.010 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2274/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2274/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2274/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2274/ltl_2_
Killing (15) : 2292 2293 2294 2295 2296
Killing (9) : 2292 2293 2294 2295 2296

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FamilyReunion-COL-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 r169-tall-167838855700300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00010M0001C001P001G001.tgz
mv FamilyReunion-COL-L00010M0001C001P001G001 execution
cd execution
if [ "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 ;