Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280200242.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280200242
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.4K Apr 11 20:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 20:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 20:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 20:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 134K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716586828779

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00010M0001C001P001G001
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-24 21:40:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 21:40:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 21:40:32] [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.
[2024-05-24 21:40:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 21:40:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 889 ms
[2024-05-24 21:40:33] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2024-05-24 21:40:33] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 38 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 21:40:33] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 8 ms.
[2024-05-24 21:40:33] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 5 formulas.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-14 TRUE 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 11 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 10003 steps, including 14 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 99 cols
[2024-05-24 21:40:33] [INFO ] Computed 33 invariants in 19 ms
[2024-05-24 21:40:33] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2024-05-24 21:40:34] [INFO ] Flatten gal took : 85 ms
[2024-05-24 21:40:34] [INFO ] Flatten gal took : 19 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
[2024-05-24 21:40:34] [INFO ] Unfolded HLPN to a Petri net with 1379 places and 1069 transitions 3062 arcs in 67 ms.
[2024-05-24 21:40:34] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Deduced a syphon composed of 11 places in 24 ms
Reduce places removed 19 places and 0 transitions.
Support contains 501 out of 1360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1069/1069 transitions.
Reduce places removed 17 places and 0 transitions.
Discarding 121 places :
Implicit places reduction removed 121 places
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1222 transition count 1069
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 160 place count 1200 transition count 1047
Iterating global reduction 1 with 22 rules applied. Total rules applied 182 place count 1200 transition count 1047
Applied a total of 182 rules in 308 ms. Remains 1200 /1360 variables (removed 160) and now considering 1047/1069 (removed 22) transitions.
// Phase 1: matrix 1047 rows 1200 cols
[2024-05-24 21:40:34] [INFO ] Computed 194 invariants in 72 ms
[2024-05-24 21:40:35] [INFO ] Implicit Places using invariants in 824 ms returned [99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 530, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 1068, 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1078]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 829 ms to find 45 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1155/1360 places, 1047/1069 transitions.
Applied a total of 0 rules in 37 ms. Remains 1155 /1155 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1175 ms. Remains : 1155/1360 places, 1047/1069 transitions.
Support contains 501 out of 1155 places after structural reductions.
[2024-05-24 21:40:35] [INFO ] Flatten gal took : 143 ms
[2024-05-24 21:40:35] [INFO ] Flatten gal took : 131 ms
[2024-05-24 21:40:36] [INFO ] Input system was already deterministic with 1047 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1047 rows 1155 cols
[2024-05-24 21:40:36] [INFO ] Computed 149 invariants in 22 ms
[2024-05-24 21:40:36] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 1155 stabilizing places and 1047 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1155 transition count 1047
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X(p1)&&(G(p0)||(p0&&F(p2)))))))'
Support contains 56 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 14 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 1086 transition count 1047
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 114 place count 1041 transition count 1002
Iterating global reduction 1 with 45 rules applied. Total rules applied 159 place count 1041 transition count 1002
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 171 place count 1029 transition count 980
Iterating global reduction 1 with 12 rules applied. Total rules applied 183 place count 1029 transition count 980
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 195 place count 1017 transition count 958
Iterating global reduction 1 with 12 rules applied. Total rules applied 207 place count 1017 transition count 958
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 218 place count 1006 transition count 958
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 240 place count 984 transition count 936
Iterating global reduction 2 with 22 rules applied. Total rules applied 262 place count 984 transition count 936
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 273 place count 973 transition count 925
Iterating global reduction 2 with 11 rules applied. Total rules applied 284 place count 973 transition count 925
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 295 place count 962 transition count 914
Iterating global reduction 2 with 11 rules applied. Total rules applied 306 place count 962 transition count 914
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 317 place count 951 transition count 903
Iterating global reduction 2 with 11 rules applied. Total rules applied 328 place count 951 transition count 903
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 339 place count 940 transition count 892
Iterating global reduction 2 with 11 rules applied. Total rules applied 350 place count 940 transition count 892
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 361 place count 929 transition count 881
Iterating global reduction 2 with 11 rules applied. Total rules applied 372 place count 929 transition count 881
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 383 place count 918 transition count 870
Iterating global reduction 2 with 11 rules applied. Total rules applied 394 place count 918 transition count 870
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 405 place count 907 transition count 859
Iterating global reduction 2 with 11 rules applied. Total rules applied 416 place count 907 transition count 859
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 427 place count 896 transition count 848
Iterating global reduction 2 with 11 rules applied. Total rules applied 438 place count 896 transition count 848
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 449 place count 885 transition count 837
Iterating global reduction 2 with 11 rules applied. Total rules applied 460 place count 885 transition count 837
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 471 place count 874 transition count 826
Iterating global reduction 2 with 11 rules applied. Total rules applied 482 place count 874 transition count 826
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 493 place count 863 transition count 815
Iterating global reduction 2 with 11 rules applied. Total rules applied 504 place count 863 transition count 815
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 515 place count 852 transition count 804
Iterating global reduction 2 with 11 rules applied. Total rules applied 526 place count 852 transition count 804
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 537 place count 852 transition count 793
Applied a total of 537 rules in 1745 ms. Remains 852 /1155 variables (removed 303) and now considering 793/1047 (removed 254) transitions.
// Phase 1: matrix 793 rows 852 cols
[2024-05-24 21:40:38] [INFO ] Computed 81 invariants in 13 ms
[2024-05-24 21:40:39] [INFO ] Implicit Places using invariants in 399 ms returned [442, 719]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 402 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 850/1155 places, 793/1047 transitions.
Applied a total of 0 rules in 34 ms. Remains 850 /850 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2183 ms. Remains : 850/1155 places, 793/1047 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 413 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GT (ADD s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464) s143) (GT 3 (ADD s839 s840 s841 s842 s843 s844 s845 s846 s847 s848 s849))), p2:(GT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1619 ms.
Product exploration explored 100000 steps with 50000 reset in 1402 ms.
Computed a total of 850 stabilizing places and 793 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 850 transition count 793
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 p2 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 1412 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-00 finished in 7547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1&&X(p2)))))'
Support contains 79 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 14 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 1086 transition count 1047
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 103 place count 1052 transition count 1013
Iterating global reduction 1 with 34 rules applied. Total rules applied 137 place count 1052 transition count 1013
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 149 place count 1040 transition count 991
Iterating global reduction 1 with 12 rules applied. Total rules applied 161 place count 1040 transition count 991
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 172 place count 1029 transition count 980
Iterating global reduction 1 with 11 rules applied. Total rules applied 183 place count 1029 transition count 980
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 194 place count 1018 transition count 969
Iterating global reduction 1 with 11 rules applied. Total rules applied 205 place count 1018 transition count 969
Applied a total of 205 rules in 298 ms. Remains 1018 /1155 variables (removed 137) and now considering 969/1047 (removed 78) transitions.
// Phase 1: matrix 969 rows 1018 cols
[2024-05-24 21:40:44] [INFO ] Computed 81 invariants in 22 ms
[2024-05-24 21:40:45] [INFO ] Implicit Places using invariants in 546 ms returned [187, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 885]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 548 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1005/1155 places, 969/1047 transitions.
Applied a total of 0 rules in 51 ms. Remains 1005 /1005 variables (removed 0) and now considering 969/969 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 904 ms. Remains : 1005/1155 places, 969/1047 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 (ADD s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351)), p1:(LEQ (ADD s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 618 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-01 finished in 1085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 66 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 1097 transition count 1047
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 92 place count 1063 transition count 1013
Iterating global reduction 1 with 34 rules applied. Total rules applied 126 place count 1063 transition count 1013
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 158 place count 1031 transition count 981
Iterating global reduction 1 with 32 rules applied. Total rules applied 190 place count 1031 transition count 981
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 201 place count 1020 transition count 960
Iterating global reduction 1 with 11 rules applied. Total rules applied 212 place count 1020 transition count 960
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 223 place count 1009 transition count 960
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 233 place count 999 transition count 940
Iterating global reduction 2 with 10 rules applied. Total rules applied 243 place count 999 transition count 940
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 253 place count 989 transition count 930
Iterating global reduction 2 with 10 rules applied. Total rules applied 263 place count 989 transition count 930
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 273 place count 979 transition count 920
Iterating global reduction 2 with 10 rules applied. Total rules applied 283 place count 979 transition count 920
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 293 place count 969 transition count 910
Iterating global reduction 2 with 10 rules applied. Total rules applied 303 place count 969 transition count 910
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 313 place count 959 transition count 900
Iterating global reduction 2 with 10 rules applied. Total rules applied 323 place count 959 transition count 900
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 333 place count 949 transition count 890
Iterating global reduction 2 with 10 rules applied. Total rules applied 343 place count 949 transition count 890
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 353 place count 939 transition count 880
Iterating global reduction 2 with 10 rules applied. Total rules applied 363 place count 939 transition count 880
Applied a total of 363 rules in 578 ms. Remains 939 /1155 variables (removed 216) and now considering 880/1047 (removed 167) transitions.
// Phase 1: matrix 880 rows 939 cols
[2024-05-24 21:40:46] [INFO ] Computed 92 invariants in 15 ms
[2024-05-24 21:40:46] [INFO ] Implicit Places using invariants in 564 ms returned [187, 507]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 566 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 937/1155 places, 880/1047 transitions.
Applied a total of 0 rules in 45 ms. Remains 937 /937 variables (removed 0) and now considering 880/880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1190 ms. Remains : 937/1155 places, 880/1047 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s572 s573 s574 s575 s576 s577 s578 s579 s580 s581 s582)), p1:(LEQ (ADD s816 s817 s818 s819 s820 s821 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 155 reset in 310 ms.
Product exploration explored 100000 steps with 155 reset in 353 ms.
Computed a total of 937 stabilizing places and 880 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 937 transition count 880
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), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 22 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02 finished in 2424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0&&F(!p0))))))'
Support contains 33 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 1097 transition count 1047
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 114 place count 1041 transition count 991
Iterating global reduction 1 with 56 rules applied. Total rules applied 170 place count 1041 transition count 991
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 203 place count 1008 transition count 948
Iterating global reduction 1 with 33 rules applied. Total rules applied 236 place count 1008 transition count 948
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 258 place count 986 transition count 916
Iterating global reduction 1 with 22 rules applied. Total rules applied 280 place count 986 transition count 916
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 291 place count 975 transition count 916
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 323 place count 943 transition count 874
Iterating global reduction 2 with 32 rules applied. Total rules applied 355 place count 943 transition count 874
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 376 place count 922 transition count 853
Iterating global reduction 2 with 21 rules applied. Total rules applied 397 place count 922 transition count 853
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 418 place count 901 transition count 832
Iterating global reduction 2 with 21 rules applied. Total rules applied 439 place count 901 transition count 832
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 460 place count 880 transition count 811
Iterating global reduction 2 with 21 rules applied. Total rules applied 481 place count 880 transition count 811
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 502 place count 859 transition count 790
Iterating global reduction 2 with 21 rules applied. Total rules applied 523 place count 859 transition count 790
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 533 place count 849 transition count 780
Iterating global reduction 2 with 10 rules applied. Total rules applied 543 place count 849 transition count 780
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 553 place count 839 transition count 770
Iterating global reduction 2 with 10 rules applied. Total rules applied 563 place count 839 transition count 770
Applied a total of 563 rules in 348 ms. Remains 839 /1155 variables (removed 316) and now considering 770/1047 (removed 277) transitions.
// Phase 1: matrix 770 rows 839 cols
[2024-05-24 21:40:48] [INFO ] Computed 92 invariants in 7 ms
[2024-05-24 21:40:48] [INFO ] Implicit Places using invariants in 391 ms returned [187, 441, 706]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 396 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 836/1155 places, 770/1047 transitions.
Applied a total of 0 rules in 23 ms. Remains 836 /836 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 769 ms. Remains : 836/1155 places, 770/1047 transitions.
Stuttering acceptance computed with spot in 109 ms :[p0, true, true]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=1, aps=[p0:(LEQ (ADD s781 s782 s783 s784 s785 s786 s787 s788 s789 s790 s791) (ADD s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s323 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 279 reset in 234 ms.
Product exploration explored 100000 steps with 280 reset in 375 ms.
Computed a total of 836 stabilizing places and 770 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 836 transition count 770
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), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[p0]
Finished random walk after 391 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=97 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[p0]
Stuttering acceptance computed with spot in 52 ms :[p0]
// Phase 1: matrix 770 rows 836 cols
[2024-05-24 21:40:50] [INFO ] Computed 89 invariants in 16 ms
[2024-05-24 21:40:51] [INFO ] [Real]Absence check using 0 positive and 89 generalized place invariants in 94 ms returned sat
[2024-05-24 21:40:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:40:53] [INFO ] [Real]Absence check using state equation in 1970 ms returned sat
[2024-05-24 21:40:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:40:54] [INFO ] [Nat]Absence check using 0 positive and 89 generalized place invariants in 56 ms returned sat
[2024-05-24 21:40:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:40:55] [INFO ] [Nat]Absence check using state equation in 1056 ms returned sat
[2024-05-24 21:40:55] [INFO ] Computed and/alt/rep : 757/868/757 causal constraints (skipped 2 transitions) in 160 ms.
[2024-05-24 21:41:06] [INFO ] Added : 496 causal constraints over 100 iterations in 11320 ms. Result :sat
Could not prove EG p0
Support contains 33 out of 836 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 770/770 transitions.
Graph (complete) has 957 edges and 836 vertex of which 649 are kept as prefixes of interest. Removing 187 places using SCC suffix rule.9 ms
Discarding 187 places :
Also discarding 143 output transitions
Drop transitions removed 143 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 0 with 396 rules applied. Total rules applied 397 place count 638 transition count 220
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 793 place count 242 transition count 220
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 793 place count 242 transition count 121
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 44 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 1035 place count 99 transition count 121
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1046 place count 88 transition count 110
Iterating global reduction 2 with 11 rules applied. Total rules applied 1057 place count 88 transition count 110
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1068 place count 88 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1068 place count 88 transition count 88
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 1090 place count 77 transition count 88
Applied a total of 1090 rules in 78 ms. Remains 77 /836 variables (removed 759) and now considering 88/770 (removed 682) transitions.
// Phase 1: matrix 88 rows 77 cols
[2024-05-24 21:41:06] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 21:41:06] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 21:41:06] [INFO ] Invariant cache hit.
[2024-05-24 21:41:07] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-24 21:41:07] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 21:41:07] [INFO ] Invariant cache hit.
[2024-05-24 21:41:07] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/836 places, 88/770 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 331 ms. Remains : 77/836 places, 88/770 transitions.
Computed a total of 77 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[p0]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[p0]
Stuttering acceptance computed with spot in 51 ms :[p0]
[2024-05-24 21:41:07] [INFO ] Invariant cache hit.
[2024-05-24 21:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:41:07] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-24 21:41:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:41:08] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-24 21:41:08] [INFO ] Computed and/alt/rep : 66/77/66 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 21:41:08] [INFO ] Added : 22 causal constraints over 5 iterations in 79 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 59 ms :[p0]
Product exploration explored 100000 steps with 2989 reset in 363 ms.
Product exploration explored 100000 steps with 2978 reset in 391 ms.
Built C files in :
/tmp/ltsmin11603255762643274031
[2024-05-24 21:41:09] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-24 21:41:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:41:09] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-24 21:41:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:41:09] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-24 21:41:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:41:09] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11603255762643274031
Running compilation step : cd /tmp/ltsmin11603255762643274031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 405 ms.
Running link step : cd /tmp/ltsmin11603255762643274031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11603255762643274031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4225249639846463396.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-24 21:41:24] [INFO ] Invariant cache hit.
[2024-05-24 21:41:24] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 21:41:24] [INFO ] Invariant cache hit.
[2024-05-24 21:41:24] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-24 21:41:24] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 21:41:24] [INFO ] Invariant cache hit.
[2024-05-24 21:41:24] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 77/77 places, 88/88 transitions.
Built C files in :
/tmp/ltsmin10274043542505977886
[2024-05-24 21:41:24] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-24 21:41:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:41:24] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-24 21:41:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:41:24] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-24 21:41:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:41:24] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10274043542505977886
Running compilation step : cd /tmp/ltsmin10274043542505977886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 271 ms.
Running link step : cd /tmp/ltsmin10274043542505977886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10274043542505977886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10161836467667436170.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 21:41:39] [INFO ] Flatten gal took : 6 ms
[2024-05-24 21:41:39] [INFO ] Flatten gal took : 4 ms
[2024-05-24 21:41:39] [INFO ] Time to serialize gal into /tmp/LTL6877673478517365381.gal : 2 ms
[2024-05-24 21:41:39] [INFO ] Time to serialize properties into /tmp/LTL17942683859262872747.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6877673478517365381.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2869621934512348071.hoa' '-atoms' '/tmp/LTL17942683859262872747.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17942683859262872747.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2869621934512348071.hoa
Reverse transition relation is NOT exact ! Due to transitions t1036, t1037, t1038, t1039, t1040, t1041, t1042, t1043, t1044, t1045, t1046, Intersection wi...237
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
309 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.13911,70700,1,0,386,200615,202,243,9075,329180,723
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04 finished in 55046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(F(p1))||(X(F(p1))&&G(!p0)))))))'
Support contains 33 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 1075 transition count 1047
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 136 place count 1019 transition count 991
Iterating global reduction 1 with 56 rules applied. Total rules applied 192 place count 1019 transition count 991
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 225 place count 986 transition count 948
Iterating global reduction 1 with 33 rules applied. Total rules applied 258 place count 986 transition count 948
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 280 place count 964 transition count 916
Iterating global reduction 1 with 22 rules applied. Total rules applied 302 place count 964 transition count 916
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 313 place count 953 transition count 916
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 345 place count 921 transition count 874
Iterating global reduction 2 with 32 rules applied. Total rules applied 377 place count 921 transition count 874
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 398 place count 900 transition count 853
Iterating global reduction 2 with 21 rules applied. Total rules applied 419 place count 900 transition count 853
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 440 place count 879 transition count 832
Iterating global reduction 2 with 21 rules applied. Total rules applied 461 place count 879 transition count 832
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 482 place count 858 transition count 811
Iterating global reduction 2 with 21 rules applied. Total rules applied 503 place count 858 transition count 811
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 524 place count 837 transition count 790
Iterating global reduction 2 with 21 rules applied. Total rules applied 545 place count 837 transition count 790
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 566 place count 816 transition count 769
Iterating global reduction 2 with 21 rules applied. Total rules applied 587 place count 816 transition count 769
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 608 place count 795 transition count 748
Iterating global reduction 2 with 21 rules applied. Total rules applied 629 place count 795 transition count 748
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 640 place count 784 transition count 737
Iterating global reduction 2 with 11 rules applied. Total rules applied 651 place count 784 transition count 737
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 662 place count 773 transition count 726
Iterating global reduction 2 with 11 rules applied. Total rules applied 673 place count 773 transition count 726
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 684 place count 762 transition count 715
Iterating global reduction 2 with 11 rules applied. Total rules applied 695 place count 762 transition count 715
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 706 place count 751 transition count 704
Iterating global reduction 2 with 11 rules applied. Total rules applied 717 place count 751 transition count 704
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 728 place count 740 transition count 693
Iterating global reduction 2 with 11 rules applied. Total rules applied 739 place count 740 transition count 693
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 750 place count 729 transition count 682
Iterating global reduction 2 with 11 rules applied. Total rules applied 761 place count 729 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 772 place count 729 transition count 671
Applied a total of 772 rules in 681 ms. Remains 729 /1155 variables (removed 426) and now considering 671/1047 (removed 376) transitions.
// Phase 1: matrix 671 rows 729 cols
[2024-05-24 21:41:43] [INFO ] Computed 70 invariants in 6 ms
[2024-05-24 21:41:44] [INFO ] Implicit Places using invariants in 377 ms returned [143, 331, 596]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 385 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1155 places, 671/1047 transitions.
Applied a total of 0 rules in 17 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1085 ms. Remains : 726/1155 places, 671/1047 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 (ADD s473 s474 s475 s476 s477 s478 s479 s480 s481 s482 s483 s484 s485 s486 s487 s488 s489 s490 s491 s492 s493 s494)), p1:(GT 1 (ADD s22 s23 s24 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 360 reset in 293 ms.
Product exploration explored 100000 steps with 360 reset in 367 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 : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-05 finished in 2261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U (p1 U p2))))'
Support contains 66 out of 1155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Graph (complete) has 1476 edges and 1155 vertex of which 1040 are kept as prefixes of interest. Removing 115 places using SCC suffix rule.7 ms
Discarding 115 places :
Also discarding 101 output transitions
Drop transitions removed 101 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 484 transitions
Trivial Post-agglo rules discarded 484 transitions
Performed 484 trivial Post agglomeration. Transition count delta: 484
Iterating post reduction 0 with 528 rules applied. Total rules applied 529 place count 985 transition count 451
Reduce places removed 484 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 1 with 539 rules applied. Total rules applied 1068 place count 501 transition count 396
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 1123 place count 446 transition count 396
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 1123 place count 446 transition count 264
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 3 with 308 rules applied. Total rules applied 1431 place count 270 transition count 264
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 1442 place count 259 transition count 264
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1442 place count 259 transition count 253
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1464 place count 248 transition count 253
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1477 place count 235 transition count 220
Iterating global reduction 4 with 13 rules applied. Total rules applied 1490 place count 235 transition count 220
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 4 with 22 rules applied. Total rules applied 1512 place count 224 transition count 209
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 5 with 44 rules applied. Total rules applied 1556 place count 202 transition count 187
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 5 with 11 rules applied. Total rules applied 1567 place count 191 transition count 176
Applied a total of 1567 rules in 82 ms. Remains 191 /1155 variables (removed 964) and now considering 176/1047 (removed 871) transitions.
// Phase 1: matrix 176 rows 191 cols
[2024-05-24 21:41:45] [INFO ] Computed 26 invariants in 1 ms
[2024-05-24 21:41:45] [INFO ] Implicit Places using invariants in 123 ms returned [11, 90, 168]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 124 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 188/1155 places, 176/1047 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 188 transition count 154
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 166 transition count 154
Applied a total of 44 rules in 8 ms. Remains 166 /188 variables (removed 22) and now considering 154/176 (removed 22) transitions.
// Phase 1: matrix 154 rows 166 cols
[2024-05-24 21:41:45] [INFO ] Computed 23 invariants in 1 ms
[2024-05-24 21:41:45] [INFO ] Implicit Places using invariants in 104 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 106 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 155/1155 places, 154/1047 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 328 ms. Remains : 155/1155 places, 154/1047 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ (ADD s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132) 2), p1:(LEQ (ADD s22 s23 s24 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1567 reset in 500 ms.
Product exploration explored 100000 steps with 1560 reset in 402 ms.
Computed a total of 155 stabilizing places and 154 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 155 transition count 154
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 p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 386 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-06 finished in 1868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 11 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 1075 transition count 1047
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 136 place count 1019 transition count 991
Iterating global reduction 1 with 56 rules applied. Total rules applied 192 place count 1019 transition count 991
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 225 place count 986 transition count 948
Iterating global reduction 1 with 33 rules applied. Total rules applied 258 place count 986 transition count 948
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 280 place count 964 transition count 916
Iterating global reduction 1 with 22 rules applied. Total rules applied 302 place count 964 transition count 916
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 313 place count 953 transition count 916
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 345 place count 921 transition count 874
Iterating global reduction 2 with 32 rules applied. Total rules applied 377 place count 921 transition count 874
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 398 place count 900 transition count 853
Iterating global reduction 2 with 21 rules applied. Total rules applied 419 place count 900 transition count 853
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 440 place count 879 transition count 832
Iterating global reduction 2 with 21 rules applied. Total rules applied 461 place count 879 transition count 832
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 482 place count 858 transition count 811
Iterating global reduction 2 with 21 rules applied. Total rules applied 503 place count 858 transition count 811
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 524 place count 837 transition count 790
Iterating global reduction 2 with 21 rules applied. Total rules applied 545 place count 837 transition count 790
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 566 place count 816 transition count 769
Iterating global reduction 2 with 21 rules applied. Total rules applied 587 place count 816 transition count 769
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 608 place count 795 transition count 748
Iterating global reduction 2 with 21 rules applied. Total rules applied 629 place count 795 transition count 748
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 640 place count 784 transition count 737
Iterating global reduction 2 with 11 rules applied. Total rules applied 651 place count 784 transition count 737
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 662 place count 773 transition count 726
Iterating global reduction 2 with 11 rules applied. Total rules applied 673 place count 773 transition count 726
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 684 place count 762 transition count 715
Iterating global reduction 2 with 11 rules applied. Total rules applied 695 place count 762 transition count 715
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 706 place count 751 transition count 704
Iterating global reduction 2 with 11 rules applied. Total rules applied 717 place count 751 transition count 704
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 728 place count 740 transition count 693
Iterating global reduction 2 with 11 rules applied. Total rules applied 739 place count 740 transition count 693
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 750 place count 729 transition count 682
Iterating global reduction 2 with 11 rules applied. Total rules applied 761 place count 729 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 772 place count 729 transition count 671
Applied a total of 772 rules in 426 ms. Remains 729 /1155 variables (removed 426) and now considering 671/1047 (removed 376) transitions.
// Phase 1: matrix 671 rows 729 cols
[2024-05-24 21:41:47] [INFO ] Computed 70 invariants in 5 ms
[2024-05-24 21:41:47] [INFO ] Implicit Places using invariants in 297 ms returned [143, 331, 596]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 298 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1155 places, 671/1047 transitions.
Applied a total of 0 rules in 23 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 748 ms. Remains : 726/1155 places, 671/1047 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 897 ms.
Product exploration explored 100000 steps with 50000 reset in 759 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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-08 finished in 2734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(F(p1) U G(p2)))))'
Support contains 88 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 1075 transition count 1047
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 136 place count 1019 transition count 991
Iterating global reduction 1 with 56 rules applied. Total rules applied 192 place count 1019 transition count 991
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 225 place count 986 transition count 948
Iterating global reduction 1 with 33 rules applied. Total rules applied 258 place count 986 transition count 948
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 280 place count 964 transition count 916
Iterating global reduction 1 with 22 rules applied. Total rules applied 302 place count 964 transition count 916
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 313 place count 953 transition count 916
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 334 place count 932 transition count 885
Iterating global reduction 2 with 21 rules applied. Total rules applied 355 place count 932 transition count 885
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 365 place count 922 transition count 875
Iterating global reduction 2 with 10 rules applied. Total rules applied 375 place count 922 transition count 875
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 385 place count 912 transition count 865
Iterating global reduction 2 with 10 rules applied. Total rules applied 395 place count 912 transition count 865
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 405 place count 902 transition count 855
Iterating global reduction 2 with 10 rules applied. Total rules applied 415 place count 902 transition count 855
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 425 place count 892 transition count 845
Iterating global reduction 2 with 10 rules applied. Total rules applied 435 place count 892 transition count 845
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 445 place count 882 transition count 835
Iterating global reduction 2 with 10 rules applied. Total rules applied 455 place count 882 transition count 835
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 465 place count 872 transition count 825
Iterating global reduction 2 with 10 rules applied. Total rules applied 475 place count 872 transition count 825
Applied a total of 475 rules in 357 ms. Remains 872 /1155 variables (removed 283) and now considering 825/1047 (removed 222) transitions.
// Phase 1: matrix 825 rows 872 cols
[2024-05-24 21:41:50] [INFO ] Computed 70 invariants in 10 ms
[2024-05-24 21:41:50] [INFO ] Implicit Places using invariants in 456 ms returned [187, 474, 739]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 458 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 869/1155 places, 825/1047 transitions.
Applied a total of 0 rules in 39 ms. Remains 869 /869 variables (removed 0) and now considering 825/825 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 854 ms. Remains : 869/1155 places, 825/1047 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 (ADD s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330)), p2:(LEQ 2 (ADD s660 s661 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1213 reset in 711 ms.
Product exploration explored 100000 steps with 1211 reset in 502 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 (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 544 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :3
Finished Best-First random walk after 3261 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=326 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2)), (F (AND p0 p2))]
Knowledge based reduction with 11 factoid took 1300 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
// Phase 1: matrix 825 rows 869 cols
[2024-05-24 21:41:55] [INFO ] Computed 67 invariants in 7 ms
[2024-05-24 21:41:56] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 49 ms returned unsat
Proved EG (AND (NOT p0) (NOT p2))
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2)), (F (AND p0 p2)), (G (AND (NOT p0) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p2)))
Knowledge based reduction with 11 factoid took 1583 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09 finished in 7790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U (p2 U X(p3)))))))'
Support contains 70 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 23 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 1077 transition count 1047
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 132 place count 1023 transition count 993
Iterating global reduction 1 with 54 rules applied. Total rules applied 186 place count 1023 transition count 993
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 219 place count 990 transition count 950
Iterating global reduction 1 with 33 rules applied. Total rules applied 252 place count 990 transition count 950
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 273 place count 969 transition count 929
Iterating global reduction 1 with 21 rules applied. Total rules applied 294 place count 969 transition count 929
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 304 place count 959 transition count 909
Iterating global reduction 1 with 10 rules applied. Total rules applied 314 place count 959 transition count 909
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 324 place count 949 transition count 899
Iterating global reduction 1 with 10 rules applied. Total rules applied 334 place count 949 transition count 899
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 344 place count 939 transition count 889
Iterating global reduction 1 with 10 rules applied. Total rules applied 354 place count 939 transition count 889
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 364 place count 929 transition count 879
Iterating global reduction 1 with 10 rules applied. Total rules applied 374 place count 929 transition count 879
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 384 place count 919 transition count 869
Iterating global reduction 1 with 10 rules applied. Total rules applied 394 place count 919 transition count 869
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 404 place count 909 transition count 859
Iterating global reduction 1 with 10 rules applied. Total rules applied 414 place count 909 transition count 859
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 424 place count 899 transition count 849
Iterating global reduction 1 with 10 rules applied. Total rules applied 434 place count 899 transition count 849
Applied a total of 434 rules in 483 ms. Remains 899 /1155 variables (removed 256) and now considering 849/1047 (removed 198) transitions.
// Phase 1: matrix 849 rows 899 cols
[2024-05-24 21:41:58] [INFO ] Computed 82 invariants in 9 ms
[2024-05-24 21:41:58] [INFO ] Implicit Places using invariants in 508 ms returned [187, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 766]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 512 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 886/1155 places, 849/1047 transitions.
Applied a total of 0 rules in 35 ms. Remains 886 /886 variables (removed 0) and now considering 849/849 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1030 ms. Remains : 886/1155 places, 849/1047 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p3) (NOT p0)), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p0 (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p0 p1 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p2 (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 (ADD s842 s843 s844 s845 s846 s847 s848 s849 s850 s851 s852)), p2:(LEQ (ADD s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s41...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 645 steps with 0 reset in 23 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-11 finished in 1376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||F(p2))))'
Support contains 56 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 24 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 1087 transition count 1047
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 113 place count 1042 transition count 1002
Iterating global reduction 1 with 45 rules applied. Total rules applied 158 place count 1042 transition count 1002
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 180 place count 1020 transition count 970
Iterating global reduction 1 with 22 rules applied. Total rules applied 202 place count 1020 transition count 970
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 223 place count 999 transition count 949
Iterating global reduction 1 with 21 rules applied. Total rules applied 244 place count 999 transition count 949
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 265 place count 978 transition count 918
Iterating global reduction 1 with 21 rules applied. Total rules applied 286 place count 978 transition count 918
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 296 place count 968 transition count 908
Iterating global reduction 1 with 10 rules applied. Total rules applied 306 place count 968 transition count 908
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 316 place count 958 transition count 898
Iterating global reduction 1 with 10 rules applied. Total rules applied 326 place count 958 transition count 898
Applied a total of 326 rules in 343 ms. Remains 958 /1155 variables (removed 197) and now considering 898/1047 (removed 149) transitions.
// Phase 1: matrix 898 rows 958 cols
[2024-05-24 21:41:59] [INFO ] Computed 93 invariants in 10 ms
[2024-05-24 21:42:00] [INFO ] Implicit Places using invariants in 587 ms returned [187, 825]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 594 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 956/1155 places, 898/1047 transitions.
Applied a total of 0 rules in 45 ms. Remains 956 /956 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 983 ms. Remains : 956/1155 places, 898/1047 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(LEQ 1 (ADD s582 s583 s584 s585 s586 s587 s588 s589 s590 s591 s592)), p1:(GT (ADD s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43) (ADD s549 s550 s551 s552...], 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]]
Product exploration explored 100000 steps with 50000 reset in 1315 ms.
Product exploration explored 100000 steps with 50000 reset in 1216 ms.
Computed a total of 956 stabilizing places and 898 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 956 transition count 898
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 35 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12 finished in 4096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 22 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 1075 transition count 1047
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 136 place count 1019 transition count 991
Iterating global reduction 1 with 56 rules applied. Total rules applied 192 place count 1019 transition count 991
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 225 place count 986 transition count 948
Iterating global reduction 1 with 33 rules applied. Total rules applied 258 place count 986 transition count 948
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 280 place count 964 transition count 916
Iterating global reduction 1 with 22 rules applied. Total rules applied 302 place count 964 transition count 916
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 313 place count 953 transition count 916
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 345 place count 921 transition count 874
Iterating global reduction 2 with 32 rules applied. Total rules applied 377 place count 921 transition count 874
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 398 place count 900 transition count 853
Iterating global reduction 2 with 21 rules applied. Total rules applied 419 place count 900 transition count 853
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 440 place count 879 transition count 832
Iterating global reduction 2 with 21 rules applied. Total rules applied 461 place count 879 transition count 832
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 482 place count 858 transition count 811
Iterating global reduction 2 with 21 rules applied. Total rules applied 503 place count 858 transition count 811
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 524 place count 837 transition count 790
Iterating global reduction 2 with 21 rules applied. Total rules applied 545 place count 837 transition count 790
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 566 place count 816 transition count 769
Iterating global reduction 2 with 21 rules applied. Total rules applied 587 place count 816 transition count 769
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 608 place count 795 transition count 748
Iterating global reduction 2 with 21 rules applied. Total rules applied 629 place count 795 transition count 748
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 640 place count 784 transition count 737
Iterating global reduction 2 with 11 rules applied. Total rules applied 651 place count 784 transition count 737
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 662 place count 773 transition count 726
Iterating global reduction 2 with 11 rules applied. Total rules applied 673 place count 773 transition count 726
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 684 place count 762 transition count 715
Iterating global reduction 2 with 11 rules applied. Total rules applied 695 place count 762 transition count 715
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 706 place count 751 transition count 704
Iterating global reduction 2 with 11 rules applied. Total rules applied 717 place count 751 transition count 704
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 728 place count 740 transition count 693
Iterating global reduction 2 with 11 rules applied. Total rules applied 739 place count 740 transition count 693
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 750 place count 729 transition count 682
Iterating global reduction 2 with 11 rules applied. Total rules applied 761 place count 729 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 772 place count 729 transition count 671
Applied a total of 772 rules in 676 ms. Remains 729 /1155 variables (removed 426) and now considering 671/1047 (removed 376) transitions.
// Phase 1: matrix 671 rows 729 cols
[2024-05-24 21:42:03] [INFO ] Computed 70 invariants in 7 ms
[2024-05-24 21:42:04] [INFO ] Implicit Places using invariants in 433 ms returned [143, 331, 596]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 435 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1155 places, 671/1047 transitions.
Applied a total of 0 rules in 29 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1141 ms. Remains : 726/1155 places, 671/1047 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, p0, p0]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 s528 s529 s530 s531 s532 s533 s534 s535 s536 s537 s538))], 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 295 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15 finished in 1299 ms.
All properties solved by simple procedures.
Total runtime 92448 ms.

BK_STOP 1716586925868

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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