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

--------------------
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-LTLFireability-00
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-03
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-05
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-09
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-11
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716586936753

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00010M0001C001P001G001
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-24 21:42:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 21:42:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 21:42:20] [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:42:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 21:42:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1270 ms
[2024-05-24 21:42:21] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2024-05-24 21:42:21] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 21:42:21] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 8 ms.
[2024-05-24 21:42:21] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-13 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 14 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10005 steps, including 14 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
Finished Best-First random walk after 576 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=144 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-24 21:42:22] [INFO ] Flatten gal took : 60 ms
[2024-05-24 21:42:22] [INFO ] Flatten gal took : 20 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:42:22] [INFO ] Unfolded HLPN to a Petri net with 1379 places and 1069 transitions 3062 arcs in 60 ms.
[2024-05-24 21:42:22] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2024-05-24 21:42:22] [INFO ] Reduced 11 identical enabling conditions.
[2024-05-24 21:42:22] [INFO ] Reduced 11 identical enabling conditions.
Deduced a syphon composed of 11 places in 24 ms
Reduce places removed 19 places and 0 transitions.
Support contains 511 out of 1360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1069/1069 transitions.
Reduce places removed 42 places and 0 transitions.
Discarding 110 places :
Implicit places reduction removed 110 places
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 1208 transition count 1069
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 173 place count 1187 transition count 1048
Iterating global reduction 1 with 21 rules applied. Total rules applied 194 place count 1187 transition count 1048
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 205 place count 1176 transition count 1037
Iterating global reduction 1 with 11 rules applied. Total rules applied 216 place count 1176 transition count 1037
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 227 place count 1165 transition count 1026
Iterating global reduction 1 with 11 rules applied. Total rules applied 238 place count 1165 transition count 1026
Applied a total of 238 rules in 473 ms. Remains 1165 /1360 variables (removed 195) and now considering 1026/1069 (removed 43) transitions.
// Phase 1: matrix 1026 rows 1165 cols
[2024-05-24 21:42:22] [INFO ] Computed 192 invariants in 65 ms
[2024-05-24 21:42:23] [INFO ] Implicit Places using invariants in 839 ms returned [99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 220, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 851 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1131/1360 places, 1026/1069 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1121 transition count 1016
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1121 transition count 1016
Applied a total of 20 rules in 68 ms. Remains 1121 /1131 variables (removed 10) and now considering 1016/1026 (removed 10) transitions.
// Phase 1: matrix 1016 rows 1121 cols
[2024-05-24 21:42:23] [INFO ] Computed 158 invariants in 33 ms
[2024-05-24 21:42:24] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-24 21:42:24] [INFO ] Invariant cache hit.
[2024-05-24 21:42:25] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1530 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1121/1360 places, 1016/1069 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2925 ms. Remains : 1121/1360 places, 1016/1069 transitions.
Support contains 511 out of 1121 places after structural reductions.
[2024-05-24 21:42:25] [INFO ] Flatten gal took : 126 ms
[2024-05-24 21:42:25] [INFO ] Flatten gal took : 128 ms
[2024-05-24 21:42:25] [INFO ] Input system was already deterministic with 1016 transitions.
Support contains 489 out of 1121 places (down from 511) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 29) seen :27
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-24 21:42:26] [INFO ] Invariant cache hit.
[2024-05-24 21:42:26] [INFO ] [Real]Absence check using 0 positive and 158 generalized place invariants in 57 ms returned sat
[2024-05-24 21:42:27] [INFO ] After 1088ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 21:42:27] [INFO ] [Nat]Absence check using 0 positive and 158 generalized place invariants in 91 ms returned sat
[2024-05-24 21:42:28] [INFO ] After 908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 21:42:28] [INFO ] After 1069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-05-24 21:42:29] [INFO ] After 1509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 93 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 4 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1121 stabilizing places and 1016 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1121 transition count 1016
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' '!(G(F(((F(p1)&&G(p2))||p0))))'
Support contains 33 out of 1121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1121/1121 places, 1016/1016 transitions.
Graph (complete) has 1442 edges and 1121 vertex of which 385 are kept as prefixes of interest. Removing 736 places using SCC suffix rule.12 ms
Discarding 736 places :
Also discarding 664 output transitions
Drop transitions removed 664 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 264 rules applied. Total rules applied 265 place count 330 transition count 121
Reduce places removed 220 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 242 rules applied. Total rules applied 507 place count 110 transition count 99
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 529 place count 88 transition count 99
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 540 place count 77 transition count 88
Iterating global reduction 3 with 11 rules applied. Total rules applied 551 place count 77 transition count 88
Applied a total of 551 rules in 61 ms. Remains 77 /1121 variables (removed 1044) and now considering 88/1016 (removed 928) transitions.
// Phase 1: matrix 88 rows 77 cols
[2024-05-24 21:42:29] [INFO ] Computed 0 invariants in 7 ms
[2024-05-24 21:42:29] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-24 21:42:29] [INFO ] Invariant cache hit.
[2024-05-24 21:42:29] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-24 21:42:29] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 21:42:29] [INFO ] Invariant cache hit.
[2024-05-24 21:42:29] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/1121 places, 88/1016 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 77/1121 places, 88/1016 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 456 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s68 1) (GEQ s69 1) (GEQ s66 1) (GEQ s67 1) (GEQ s72 1) (GEQ s73 1) (GEQ s70 1) (GEQ s71 1) (GEQ s76 1) (GEQ s74 1) (GEQ s75 1)), p2:(AND (OR (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 319 steps with 13 reset in 28 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-01 finished in 924 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((X(F(p2))||p1))||p0) U G(p2)))'
Support contains 22 out of 1121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1121/1121 places, 1016/1016 transitions.
Graph (complete) has 1442 edges and 1121 vertex of which 1117 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 539 transitions
Trivial Post-agglo rules discarded 539 transitions
Performed 539 trivial Post agglomeration. Transition count delta: 539
Iterating post reduction 0 with 605 rules applied. Total rules applied 606 place count 1040 transition count 462
Reduce places removed 539 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 550 rules applied. Total rules applied 1156 place count 501 transition count 451
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1167 place count 490 transition count 451
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 1167 place count 490 transition count 297
Deduced a syphon composed of 154 places in 1 ms
Ensure Unique test removed 66 places
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 3 with 374 rules applied. Total rules applied 1541 place count 270 transition count 297
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 33 rules applied. Total rules applied 1574 place count 270 transition count 264
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 1607 place count 237 transition count 264
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1607 place count 237 transition count 253
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1629 place count 226 transition count 253
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 1663 place count 192 transition count 209
Iterating global reduction 5 with 34 rules applied. Total rules applied 1697 place count 192 transition count 209
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 22 rules applied. Total rules applied 1719 place count 192 transition count 187
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1730 place count 181 transition count 187
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 1730 place count 181 transition count 165
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 1774 place count 159 transition count 165
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1775 place count 158 transition count 154
Iterating global reduction 7 with 1 rules applied. Total rules applied 1776 place count 158 transition count 154
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 7 with 33 rules applied. Total rules applied 1809 place count 147 transition count 132
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1820 place count 136 transition count 132
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 9 with 44 rules applied. Total rules applied 1864 place count 114 transition count 110
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 9 with 11 rules applied. Total rules applied 1875 place count 103 transition count 99
Applied a total of 1875 rules in 153 ms. Remains 103 /1121 variables (removed 1018) and now considering 99/1016 (removed 917) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-24 21:42:30] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 21:42:30] [INFO ] Implicit Places using invariants in 131 ms returned [12, 35, 69, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 136 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/1121 places, 99/1016 transitions.
Reduce places removed 11 places and 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 78 transition count 77
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 67 transition count 77
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 56 transition count 66
Applied a total of 44 rules in 8 ms. Remains 56 /89 variables (removed 33) and now considering 66/99 (removed 33) transitions.
// Phase 1: matrix 66 rows 56 cols
[2024-05-24 21:42:30] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 21:42:30] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 21:42:30] [INFO ] Invariant cache hit.
[2024-05-24 21:42:30] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/1121 places, 66/1016 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 409 ms. Remains : 56/1121 places, 66/1016 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (GEQ s20 1) (GEQ s21 1) (GEQ s18 1) (GEQ s13 1) (GEQ s19 1) (GEQ s12 1) (GEQ s16 1) (GEQ s15 1) (GEQ s17 1) (GEQ s14 1) (GEQ s22 1)), p0:(OR (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 26 steps with 1 reset in 1 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-02 finished in 579 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(p0)&&F(p1))))'
Support contains 44 out of 1121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1121/1121 places, 1016/1016 transitions.
Graph (complete) has 1442 edges and 1121 vertex of which 706 are kept as prefixes of interest. Removing 415 places using SCC suffix rule.6 ms
Discarding 415 places :
Also discarding 356 output transitions
Drop transitions removed 356 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Drop transitions removed 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 484 rules applied. Total rules applied 485 place count 640 transition count 220
Reduce places removed 429 places and 0 transitions.
Iterating post reduction 1 with 429 rules applied. Total rules applied 914 place count 211 transition count 220
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 914 place count 211 transition count 154
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 1068 place count 123 transition count 154
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1080 place count 111 transition count 132
Iterating global reduction 2 with 12 rules applied. Total rules applied 1092 place count 111 transition count 132
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1103 place count 111 transition count 121
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1103 place count 111 transition count 110
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1125 place count 100 transition count 110
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1147 place count 89 transition count 99
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 1158 place count 78 transition count 88
Applied a total of 1158 rules in 52 ms. Remains 78 /1121 variables (removed 1043) and now considering 88/1016 (removed 928) transitions.
// Phase 1: matrix 88 rows 78 cols
[2024-05-24 21:42:31] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 21:42:31] [INFO ] Implicit Places using invariants in 56 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/1121 places, 88/1016 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 77/1121 places, 88/1016 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s55 1) (GEQ s57 1) (GEQ s56 1) (GEQ s59 1) (GEQ s58 1) (GEQ s61 1) (GEQ s60 1) (GEQ s63 1) (GEQ s62 1) (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9808 reset in 716 ms.
Stuttering criterion allowed to conclude after 37745 steps with 3710 reset in 226 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-03 finished in 1245 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((G(p2)||p1))&&p0)))'
Support contains 66 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1016/1016 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 1066 transition count 1016
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 102 place count 1019 transition count 959
Iterating global reduction 1 with 47 rules applied. Total rules applied 149 place count 1019 transition count 959
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 172 place count 996 transition count 926
Iterating global reduction 1 with 23 rules applied. Total rules applied 195 place count 996 transition count 926
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 206 place count 985 transition count 926
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 238 place count 953 transition count 894
Iterating global reduction 2 with 32 rules applied. Total rules applied 270 place count 953 transition count 894
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 302 place count 921 transition count 852
Iterating global reduction 2 with 32 rules applied. Total rules applied 334 place count 921 transition count 852
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 355 place count 900 transition count 831
Iterating global reduction 2 with 21 rules applied. Total rules applied 376 place count 900 transition count 831
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 397 place count 879 transition count 810
Iterating global reduction 2 with 21 rules applied. Total rules applied 418 place count 879 transition count 810
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 429 place count 868 transition count 799
Iterating global reduction 2 with 11 rules applied. Total rules applied 440 place count 868 transition count 799
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 451 place count 857 transition count 788
Iterating global reduction 2 with 11 rules applied. Total rules applied 462 place count 857 transition count 788
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 473 place count 846 transition count 777
Iterating global reduction 2 with 11 rules applied. Total rules applied 484 place count 846 transition count 777
Applied a total of 484 rules in 775 ms. Remains 846 /1121 variables (removed 275) and now considering 777/1016 (removed 239) transitions.
// Phase 1: matrix 777 rows 846 cols
[2024-05-24 21:42:33] [INFO ] Computed 92 invariants in 20 ms
[2024-05-24 21:42:33] [INFO ] Implicit Places using invariants in 417 ms returned [388, 437, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 713]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 438 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 832/1121 places, 777/1016 transitions.
Applied a total of 0 rules in 23 ms. Remains 832 /832 variables (removed 0) and now considering 777/777 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1243 ms. Remains : 832/1121 places, 777/1016 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p2:(OR (AND (GEQ s275 1) (GEQ s364 1)) (AND (GEQ s276 1) (GEQ s365 1)) (AND (GEQ s277 1) (GEQ s366 1)) (AND (GEQ s278 1) (GEQ s367 1)) (AND (GEQ s279 1) (...], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-04 finished in 1474 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(X(p0))||G(p1)))'
Support contains 23 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1016/1016 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1055 transition count 1016
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 113 place count 1008 transition count 959
Iterating global reduction 1 with 47 rules applied. Total rules applied 160 place count 1008 transition count 959
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 183 place count 985 transition count 926
Iterating global reduction 1 with 23 rules applied. Total rules applied 206 place count 985 transition count 926
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 217 place count 974 transition count 926
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 249 place count 942 transition count 894
Iterating global reduction 2 with 32 rules applied. Total rules applied 281 place count 942 transition count 894
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 313 place count 910 transition count 852
Iterating global reduction 2 with 32 rules applied. Total rules applied 345 place count 910 transition count 852
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 356 place count 899 transition count 841
Iterating global reduction 2 with 11 rules applied. Total rules applied 367 place count 899 transition count 841
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 378 place count 888 transition count 830
Iterating global reduction 2 with 11 rules applied. Total rules applied 389 place count 888 transition count 830
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 400 place count 877 transition count 819
Iterating global reduction 2 with 11 rules applied. Total rules applied 411 place count 877 transition count 819
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 422 place count 866 transition count 808
Iterating global reduction 2 with 11 rules applied. Total rules applied 433 place count 866 transition count 808
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 444 place count 855 transition count 797
Iterating global reduction 2 with 11 rules applied. Total rules applied 455 place count 855 transition count 797
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 466 place count 844 transition count 786
Iterating global reduction 2 with 11 rules applied. Total rules applied 477 place count 844 transition count 786
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 488 place count 833 transition count 775
Iterating global reduction 2 with 11 rules applied. Total rules applied 499 place count 833 transition count 775
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 510 place count 822 transition count 764
Iterating global reduction 2 with 11 rules applied. Total rules applied 521 place count 822 transition count 764
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 532 place count 811 transition count 753
Iterating global reduction 2 with 11 rules applied. Total rules applied 543 place count 811 transition count 753
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 554 place count 800 transition count 742
Iterating global reduction 2 with 11 rules applied. Total rules applied 565 place count 800 transition count 742
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 576 place count 800 transition count 731
Applied a total of 576 rules in 695 ms. Remains 800 /1121 variables (removed 321) and now considering 731/1016 (removed 285) transitions.
// Phase 1: matrix 731 rows 800 cols
[2024-05-24 21:42:34] [INFO ] Computed 81 invariants in 12 ms
[2024-05-24 21:42:34] [INFO ] Implicit Places using invariants in 299 ms returned [391, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 667]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 303 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 787/1121 places, 731/1016 transitions.
Applied a total of 0 rules in 23 ms. Remains 787 /787 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1023 ms. Remains : 787/1121 places, 731/1016 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(OR (GEQ s83 1) (GEQ s84 1) (GEQ s81 1) (GEQ s82 1) (GEQ s87 1) (GEQ s85 1) (GEQ s86 1) (GEQ s79 1) (GEQ s80 1) (GEQ s77 1) (GEQ s78 1)), p1:(OR (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-05 finished in 1285 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((G(F(p2))||p1))))))'
Support contains 44 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1016/1016 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1055 transition count 1016
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 113 place count 1008 transition count 959
Iterating global reduction 1 with 47 rules applied. Total rules applied 160 place count 1008 transition count 959
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 183 place count 985 transition count 926
Iterating global reduction 1 with 23 rules applied. Total rules applied 206 place count 985 transition count 926
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 217 place count 974 transition count 926
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 249 place count 942 transition count 894
Iterating global reduction 2 with 32 rules applied. Total rules applied 281 place count 942 transition count 894
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 313 place count 910 transition count 852
Iterating global reduction 2 with 32 rules applied. Total rules applied 345 place count 910 transition count 852
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 366 place count 889 transition count 831
Iterating global reduction 2 with 21 rules applied. Total rules applied 387 place count 889 transition count 831
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 397 place count 879 transition count 821
Iterating global reduction 2 with 10 rules applied. Total rules applied 407 place count 879 transition count 821
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 417 place count 869 transition count 811
Iterating global reduction 2 with 10 rules applied. Total rules applied 427 place count 869 transition count 811
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 437 place count 859 transition count 801
Iterating global reduction 2 with 10 rules applied. Total rules applied 447 place count 859 transition count 801
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 448 place count 858 transition count 801
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 458 place count 848 transition count 791
Iterating global reduction 3 with 10 rules applied. Total rules applied 468 place count 848 transition count 791
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 478 place count 838 transition count 781
Iterating global reduction 3 with 10 rules applied. Total rules applied 488 place count 838 transition count 781
Applied a total of 488 rules in 323 ms. Remains 838 /1121 variables (removed 283) and now considering 781/1016 (removed 235) transitions.
// Phase 1: matrix 781 rows 838 cols
[2024-05-24 21:42:35] [INFO ] Computed 80 invariants in 9 ms
[2024-05-24 21:42:35] [INFO ] Implicit Places using invariants in 296 ms returned [429, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 705]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 298 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 825/1121 places, 781/1016 transitions.
Applied a total of 0 rules in 33 ms. Remains 825 /825 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 655 ms. Remains : 825/1121 places, 781/1016 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s20 1) (GEQ s21 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s15 1)), p1:(OR (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 360 reset in 698 ms.
Product exploration explored 100000 steps with 372 reset in 561 ms.
Computed a total of 825 stabilizing places and 781 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 825 transition count 781
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) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 635 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 165 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 12 factoid took 1069 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
// Phase 1: matrix 781 rows 825 cols
[2024-05-24 21:42:39] [INFO ] Computed 67 invariants in 7 ms
[2024-05-24 21:42:40] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 37 ms returned sat
[2024-05-24 21:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:42:40] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2024-05-24 21:42:41] [INFO ] Computed and/alt/rep : 768/857/768 causal constraints (skipped 2 transitions) in 120 ms.
[2024-05-24 21:42:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:42:43] [INFO ] [Nat]Absence check using 0 positive and 67 generalized place invariants in 52 ms returned sat
[2024-05-24 21:42:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:42:44] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2024-05-24 21:42:44] [INFO ] Computed and/alt/rep : 768/857/768 causal constraints (skipped 2 transitions) in 70 ms.
[2024-05-24 21:42:49] [INFO ] Added : 261 causal constraints over 53 iterations in 4488 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 825 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 825/825 places, 781/781 transitions.
Graph (complete) has 924 edges and 825 vertex of which 638 are kept as prefixes of interest. Removing 187 places using SCC suffix rule.5 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 627 transition count 231
Reduce places removed 396 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 407 rules applied. Total rules applied 804 place count 231 transition count 220
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 815 place count 220 transition count 220
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 815 place count 220 transition count 143
Deduced a syphon composed of 77 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 991 place count 121 transition count 143
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1002 place count 110 transition count 132
Iterating global reduction 3 with 11 rules applied. Total rules applied 1013 place count 110 transition count 132
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 3 with 22 rules applied. Total rules applied 1035 place count 110 transition count 110
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1046 place count 99 transition count 110
Applied a total of 1046 rules in 45 ms. Remains 99 /825 variables (removed 726) and now considering 110/781 (removed 671) transitions.
// Phase 1: matrix 110 rows 99 cols
[2024-05-24 21:42:49] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 21:42:49] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-24 21:42:49] [INFO ] Invariant cache hit.
[2024-05-24 21:42:49] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-24 21:42:49] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 21:42:49] [INFO ] Invariant cache hit.
[2024-05-24 21:42:49] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/825 places, 110/781 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 99/825 places, 110/781 transitions.
Computed a total of 99 stabilizing places and 110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 110
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 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 50 ms :[(NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 148 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2024-05-24 21:42:50] [INFO ] Invariant cache hit.
[2024-05-24 21:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:42:50] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-24 21:42:50] [INFO ] Computed and/alt/rep : 88/99/88 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-24 21:42:50] [INFO ] Added : 22 causal constraints over 5 iterations in 94 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4991 reset in 334 ms.
Product exploration explored 100000 steps with 4972 reset in 357 ms.
Built C files in :
/tmp/ltsmin14499476472533629716
[2024-05-24 21:42:51] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-24 21:42:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:42:51] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-24 21:42:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:42:51] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-24 21:42:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:42:51] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14499476472533629716
Running compilation step : cd /tmp/ltsmin14499476472533629716;'/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 664 ms.
Running link step : cd /tmp/ltsmin14499476472533629716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin14499476472533629716;'/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/stateBased10961533416819956709.hoa' '--buchi-type=spotba'
LTSmin run took 274 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-06 finished in 17177 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) U G(p1)))'
Support contains 33 out of 1121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1121/1121 places, 1016/1016 transitions.
Graph (complete) has 1442 edges and 1121 vertex of which 541 are kept as prefixes of interest. Removing 580 places using SCC suffix rule.5 ms
Discarding 580 places :
Also discarding 510 output transitions
Drop transitions removed 510 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions removed 341 transitions
Trivial Post-agglo rules discarded 341 transitions
Performed 341 trivial Post agglomeration. Transition count delta: 341
Iterating post reduction 0 with 385 rules applied. Total rules applied 386 place count 486 transition count 154
Reduce places removed 341 places and 0 transitions.
Iterating post reduction 1 with 341 rules applied. Total rules applied 727 place count 145 transition count 154
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 727 place count 145 transition count 121
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 793 place count 112 transition count 121
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 805 place count 100 transition count 99
Iterating global reduction 2 with 12 rules applied. Total rules applied 817 place count 100 transition count 99
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 828 place count 100 transition count 88
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 828 place count 100 transition count 77
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 850 place count 89 transition count 77
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 861 place count 78 transition count 66
Applied a total of 861 rules in 31 ms. Remains 78 /1121 variables (removed 1043) and now considering 66/1016 (removed 950) transitions.
// Phase 1: matrix 66 rows 78 cols
[2024-05-24 21:42:52] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 21:42:52] [INFO ] Implicit Places using invariants in 69 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/1121 places, 66/1016 transitions.
Reduce places removed 11 places and 11 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /77 variables (removed 11) and now considering 55/66 (removed 11) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 66/1121 places, 55/1016 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s22 1) (GEQ s33 1)) (AND (GEQ s26 1) (GEQ s37 1)) (AND (GEQ s30 1) (GEQ s41 1)) (AND (GEQ s23 1) (GEQ s34 1)) (AND (GEQ s25 1) (GEQ s36 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1663 steps with 88 reset in 6 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-08 finished in 236 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' '!((p0 U X(X(G(!p0)))))'
Support contains 22 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1016/1016 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1055 transition count 1016
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 113 place count 1008 transition count 959
Iterating global reduction 1 with 47 rules applied. Total rules applied 160 place count 1008 transition count 959
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 183 place count 985 transition count 926
Iterating global reduction 1 with 23 rules applied. Total rules applied 206 place count 985 transition count 926
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 217 place count 974 transition count 926
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 249 place count 942 transition count 894
Iterating global reduction 2 with 32 rules applied. Total rules applied 281 place count 942 transition count 894
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 302 place count 921 transition count 863
Iterating global reduction 2 with 21 rules applied. Total rules applied 323 place count 921 transition count 863
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 344 place count 900 transition count 842
Iterating global reduction 2 with 21 rules applied. Total rules applied 365 place count 900 transition count 842
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 386 place count 879 transition count 821
Iterating global reduction 2 with 21 rules applied. Total rules applied 407 place count 879 transition count 821
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 428 place count 858 transition count 800
Iterating global reduction 2 with 21 rules applied. Total rules applied 449 place count 858 transition count 800
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 470 place count 837 transition count 779
Iterating global reduction 2 with 21 rules applied. Total rules applied 491 place count 837 transition count 779
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 492 place count 836 transition count 779
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 513 place count 815 transition count 758
Iterating global reduction 3 with 21 rules applied. Total rules applied 534 place count 815 transition count 758
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 555 place count 794 transition count 737
Iterating global reduction 3 with 21 rules applied. Total rules applied 576 place count 794 transition count 737
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 587 place count 783 transition count 726
Iterating global reduction 3 with 11 rules applied. Total rules applied 598 place count 783 transition count 726
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 609 place count 772 transition count 715
Iterating global reduction 3 with 11 rules applied. Total rules applied 620 place count 772 transition count 715
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 631 place count 761 transition count 704
Iterating global reduction 3 with 11 rules applied. Total rules applied 642 place count 761 transition count 704
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 653 place count 750 transition count 693
Iterating global reduction 3 with 11 rules applied. Total rules applied 664 place count 750 transition count 693
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 675 place count 750 transition count 682
Applied a total of 675 rules in 651 ms. Remains 750 /1121 variables (removed 371) and now considering 682/1016 (removed 334) transitions.
// Phase 1: matrix 682 rows 750 cols
[2024-05-24 21:42:53] [INFO ] Computed 80 invariants in 7 ms
[2024-05-24 21:42:53] [INFO ] Implicit Places using invariants in 497 ms returned [330, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 617]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 499 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 737/1121 places, 682/1016 transitions.
Applied a total of 0 rules in 34 ms. Remains 737 /737 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1185 ms. Remains : 737/1121 places, 682/1016 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, p0, p0, p0]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s579 1) (GEQ s578 1) (GEQ s581 1) (GEQ s580 1) (GEQ s582 1) (GEQ s561 1) (GEQ s563 1) (GEQ s562 1) (GEQ s565 1) (GEQ s564 1) (GEQ s567 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 254 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-10 finished in 1426 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(p1)||p0))))'
Support contains 66 out of 1121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1121/1121 places, 1016/1016 transitions.
Graph (complete) has 1442 edges and 1121 vertex of which 818 are kept as prefixes of interest. Removing 303 places using SCC suffix rule.6 ms
Discarding 303 places :
Also discarding 257 output transitions
Drop transitions removed 257 transitions
Discarding 33 places :
Implicit places reduction removed 33 places
Drop transitions removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 418 rules applied. Total rules applied 419 place count 785 transition count 374
Reduce places removed 385 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 407 rules applied. Total rules applied 826 place count 400 transition count 352
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 848 place count 378 transition count 352
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 848 place count 378 transition count 275
Deduced a syphon composed of 77 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1024 place count 279 transition count 275
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 1046 place count 279 transition count 253
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1068 place count 257 transition count 253
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1091 place count 234 transition count 220
Iterating global reduction 5 with 23 rules applied. Total rules applied 1114 place count 234 transition count 220
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 5 with 22 rules applied. Total rules applied 1136 place count 234 transition count 198
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 1158 place count 212 transition count 198
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1158 place count 212 transition count 187
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1180 place count 201 transition count 187
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1181 place count 200 transition count 176
Iterating global reduction 7 with 1 rules applied. Total rules applied 1182 place count 200 transition count 176
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 44 rules applied. Total rules applied 1226 place count 178 transition count 154
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 1237 place count 167 transition count 154
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 1237 place count 167 transition count 143
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1259 place count 156 transition count 143
Applied a total of 1259 rules in 61 ms. Remains 156 /1121 variables (removed 965) and now considering 143/1016 (removed 873) transitions.
// Phase 1: matrix 143 rows 156 cols
[2024-05-24 21:42:53] [INFO ] Computed 24 invariants in 1 ms
[2024-05-24 21:42:54] [INFO ] Implicit Places using invariants in 128 ms returned [121, 133]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 144 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/1121 places, 143/1016 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 154 transition count 132
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 143 transition count 132
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 143 transition count 121
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 132 transition count 121
Applied a total of 44 rules in 20 ms. Remains 132 /154 variables (removed 22) and now considering 121/143 (removed 22) transitions.
// Phase 1: matrix 121 rows 132 cols
[2024-05-24 21:42:54] [INFO ] Computed 22 invariants in 1 ms
[2024-05-24 21:42:54] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-24 21:42:54] [INFO ] Invariant cache hit.
[2024-05-24 21:42:54] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 132/1121 places, 121/1016 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 450 ms. Remains : 132/1121 places, 121/1016 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s129 1) (LT s128 1) (LT s127 1) (LT s126 1) (LT s131 1) (LT s130 1) (LT s121 1) (LT s125 1) (LT s124 1) (LT s123 1) (LT s122 1)), p0:(OR (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1869 reset in 356 ms.
Product exploration explored 100000 steps with 1877 reset in 485 ms.
Computed a total of 132 stabilizing places and 121 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 132 transition count 121
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-11 finished in 1523 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(X(X(X(G(p0))))))'
Support contains 22 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1016/1016 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1055 transition count 1016
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 113 place count 1008 transition count 959
Iterating global reduction 1 with 47 rules applied. Total rules applied 160 place count 1008 transition count 959
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 183 place count 985 transition count 926
Iterating global reduction 1 with 23 rules applied. Total rules applied 206 place count 985 transition count 926
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 217 place count 974 transition count 926
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 249 place count 942 transition count 894
Iterating global reduction 2 with 32 rules applied. Total rules applied 281 place count 942 transition count 894
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 313 place count 910 transition count 852
Iterating global reduction 2 with 32 rules applied. Total rules applied 345 place count 910 transition count 852
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 366 place count 889 transition count 831
Iterating global reduction 2 with 21 rules applied. Total rules applied 387 place count 889 transition count 831
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 408 place count 868 transition count 810
Iterating global reduction 2 with 21 rules applied. Total rules applied 429 place count 868 transition count 810
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 450 place count 847 transition count 789
Iterating global reduction 2 with 21 rules applied. Total rules applied 471 place count 847 transition count 789
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 492 place count 826 transition count 768
Iterating global reduction 2 with 21 rules applied. Total rules applied 513 place count 826 transition count 768
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 514 place count 825 transition count 768
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 535 place count 804 transition count 747
Iterating global reduction 3 with 21 rules applied. Total rules applied 556 place count 804 transition count 747
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 577 place count 783 transition count 726
Iterating global reduction 3 with 21 rules applied. Total rules applied 598 place count 783 transition count 726
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 609 place count 772 transition count 715
Iterating global reduction 3 with 11 rules applied. Total rules applied 620 place count 772 transition count 715
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 631 place count 761 transition count 704
Iterating global reduction 3 with 11 rules applied. Total rules applied 642 place count 761 transition count 704
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 653 place count 750 transition count 693
Iterating global reduction 3 with 11 rules applied. Total rules applied 664 place count 750 transition count 693
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 675 place count 739 transition count 682
Iterating global reduction 3 with 11 rules applied. Total rules applied 686 place count 739 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 697 place count 739 transition count 671
Applied a total of 697 rules in 377 ms. Remains 739 /1121 variables (removed 382) and now considering 671/1016 (removed 345) transitions.
// Phase 1: matrix 671 rows 739 cols
[2024-05-24 21:42:55] [INFO ] Computed 80 invariants in 4 ms
[2024-05-24 21:42:56] [INFO ] Implicit Places using invariants in 268 ms returned [330, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 606]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 269 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1121 places, 671/1016 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 664 ms. Remains : 726/1121 places, 671/1016 transitions.
Stuttering acceptance computed with spot in 311 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (LT s482 1) (LT s483 1) (LT s484 1) (LT s485 1) (LT s486 1) (LT s487 1) (LT s488 1) (LT s489 1) (LT s490 1) (LT s491 1) (LT s492 1) (LT s493 1) (L...], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 247 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-12 finished in 995 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((X((F(p1)&&X(F(p2))))||p0)) U p2))'
Support contains 77 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1016/1016 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 1066 transition count 1016
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 91 place count 1030 transition count 970
Iterating global reduction 1 with 36 rules applied. Total rules applied 127 place count 1030 transition count 970
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 150 place count 1007 transition count 937
Iterating global reduction 1 with 23 rules applied. Total rules applied 173 place count 1007 transition count 937
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 184 place count 996 transition count 937
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 205 place count 975 transition count 916
Iterating global reduction 2 with 21 rules applied. Total rules applied 226 place count 975 transition count 916
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 247 place count 954 transition count 885
Iterating global reduction 2 with 21 rules applied. Total rules applied 268 place count 954 transition count 885
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 289 place count 933 transition count 864
Iterating global reduction 2 with 21 rules applied. Total rules applied 310 place count 933 transition count 864
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 331 place count 912 transition count 843
Iterating global reduction 2 with 21 rules applied. Total rules applied 352 place count 912 transition count 843
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 363 place count 901 transition count 832
Iterating global reduction 2 with 11 rules applied. Total rules applied 374 place count 901 transition count 832
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 385 place count 890 transition count 821
Iterating global reduction 2 with 11 rules applied. Total rules applied 396 place count 890 transition count 821
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 407 place count 879 transition count 810
Iterating global reduction 2 with 11 rules applied. Total rules applied 418 place count 879 transition count 810
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 429 place count 868 transition count 799
Iterating global reduction 2 with 11 rules applied. Total rules applied 440 place count 868 transition count 799
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 451 place count 857 transition count 788
Iterating global reduction 2 with 11 rules applied. Total rules applied 462 place count 857 transition count 788
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 473 place count 846 transition count 777
Iterating global reduction 2 with 11 rules applied. Total rules applied 484 place count 846 transition count 777
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 495 place count 835 transition count 766
Iterating global reduction 2 with 11 rules applied. Total rules applied 506 place count 835 transition count 766
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 517 place count 824 transition count 755
Iterating global reduction 2 with 11 rules applied. Total rules applied 528 place count 824 transition count 755
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 539 place count 824 transition count 744
Applied a total of 539 rules in 633 ms. Remains 824 /1121 variables (removed 297) and now considering 744/1016 (removed 272) transitions.
// Phase 1: matrix 744 rows 824 cols
[2024-05-24 21:42:57] [INFO ] Computed 92 invariants in 14 ms
[2024-05-24 21:42:57] [INFO ] Implicit Places using invariants in 468 ms returned [333, 382, 691]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 470 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 821/1121 places, 744/1016 transitions.
Applied a total of 0 rules in 33 ms. Remains 821 /821 variables (removed 0) and now considering 744/744 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1138 ms. Remains : 821/1121 places, 744/1016 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s220 1) (GEQ s309 1)) (AND (GEQ s221 1) (GEQ s310 1)) (AND (GEQ s222 1) (GEQ s311 1)) (AND (GEQ s223 1) (GEQ s312 1)) (AND (GEQ s224 1) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 491 reset in 570 ms.
Product exploration explored 100000 steps with 487 reset in 382 ms.
Computed a total of 821 stabilizing places and 744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 821 transition count 744
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 p0) (NOT p1)), (X (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 614 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Finished random walk after 497 steps, including 0 resets, run visited all 4 properties in 19 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 12 factoid took 1471 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
// Phase 1: matrix 744 rows 821 cols
[2024-05-24 21:43:01] [INFO ] Computed 89 invariants in 10 ms
[2024-05-24 21:43:02] [INFO ] [Real]Absence check using 0 positive and 89 generalized place invariants in 68 ms returned sat
[2024-05-24 21:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:43:04] [INFO ] [Real]Absence check using state equation in 2335 ms returned sat
[2024-05-24 21:43:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:43:05] [INFO ] [Nat]Absence check using 0 positive and 89 generalized place invariants in 84 ms returned sat
[2024-05-24 21:43:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:43:07] [INFO ] [Nat]Absence check using state equation in 1182 ms returned sat
[2024-05-24 21:43:07] [INFO ] Computed and/alt/rep : 731/842/731 causal constraints (skipped 2 transitions) in 54 ms.
[2024-05-24 21:43:20] [INFO ] Added : 625 causal constraints over 125 iterations in 12938 ms. Result :unknown
Could not prove EG (NOT p2)
Support contains 77 out of 821 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 821/821 places, 744/744 transitions.
Applied a total of 0 rules in 33 ms. Remains 821 /821 variables (removed 0) and now considering 744/744 (removed 0) transitions.
[2024-05-24 21:43:20] [INFO ] Invariant cache hit.
[2024-05-24 21:43:20] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-24 21:43:20] [INFO ] Invariant cache hit.
[2024-05-24 21:43:21] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
[2024-05-24 21:43:21] [INFO ] Invariant cache hit.
[2024-05-24 21:43:22] [INFO ] Dead Transitions using invariants and state equation in 874 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2314 ms. Remains : 821/821 places, 744/744 transitions.
Computed a total of 821 stabilizing places and 744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 821 transition count 744
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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p2))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 498 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Finished random walk after 570 steps, including 0 resets, run visited all 4 properties in 20 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p2))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 12 factoid took 1432 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
[2024-05-24 21:43:25] [INFO ] Invariant cache hit.
[2024-05-24 21:43:26] [INFO ] [Real]Absence check using 0 positive and 89 generalized place invariants in 61 ms returned sat
[2024-05-24 21:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:43:27] [INFO ] [Real]Absence check using state equation in 1212 ms returned sat
[2024-05-24 21:43:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:43:28] [INFO ] [Nat]Absence check using 0 positive and 89 generalized place invariants in 102 ms returned sat
[2024-05-24 21:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:43:29] [INFO ] [Nat]Absence check using state equation in 1167 ms returned sat
[2024-05-24 21:43:29] [INFO ] Computed and/alt/rep : 731/842/731 causal constraints (skipped 2 transitions) in 46 ms.
[2024-05-24 21:43:42] [INFO ] Added : 650 causal constraints over 130 iterations in 13011 ms. Result :unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 489 reset in 430 ms.
Product exploration explored 100000 steps with 488 reset in 440 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Support contains 77 out of 821 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 821/821 places, 744/744 transitions.
Graph (complete) has 952 edges and 821 vertex of which 815 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 253 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 253 rules applied. Total rules applied 254 place count 815 transition count 737
Performed 253 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 253 Pre rules applied. Total rules applied 254 place count 815 transition count 770
Deduced a syphon composed of 506 places in 1 ms
Iterating global reduction 1 with 253 rules applied. Total rules applied 507 place count 815 transition count 770
Discarding 330 places :
Symmetric choice reduction at 1 with 330 rule applications. Total rules 837 place count 485 transition count 440
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 1 with 330 rules applied. Total rules applied 1167 place count 485 transition count 440
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 1211 place count 485 transition count 451
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 1222 place count 474 transition count 440
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1233 place count 474 transition count 440
Deduced a syphon composed of 209 places in 0 ms
Applied a total of 1233 rules in 166 ms. Remains 474 /821 variables (removed 347) and now considering 440/744 (removed 304) transitions.
[2024-05-24 21:43:44] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 440 rows 474 cols
[2024-05-24 21:43:44] [INFO ] Computed 89 invariants in 5 ms
[2024-05-24 21:43:44] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 474/821 places, 440/744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 689 ms. Remains : 474/821 places, 440/744 transitions.
Built C files in :
/tmp/ltsmin16099352365668060687
[2024-05-24 21:43:44] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16099352365668060687
Running compilation step : cd /tmp/ltsmin16099352365668060687;'/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 1678 ms.
Running link step : cd /tmp/ltsmin16099352365668060687;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16099352365668060687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18065137673198158015.hoa' '--buchi-type=spotba'
LTSmin run took 1528 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-14 finished in 51573 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((X(p1)||p0)))'
Support contains 99 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 1016/1016 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1077 transition count 1016
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 80 place count 1041 transition count 970
Iterating global reduction 1 with 36 rules applied. Total rules applied 116 place count 1041 transition count 970
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 139 place count 1018 transition count 937
Iterating global reduction 1 with 23 rules applied. Total rules applied 162 place count 1018 transition count 937
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 173 place count 1007 transition count 937
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 194 place count 986 transition count 916
Iterating global reduction 2 with 21 rules applied. Total rules applied 215 place count 986 transition count 916
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 236 place count 965 transition count 885
Iterating global reduction 2 with 21 rules applied. Total rules applied 257 place count 965 transition count 885
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 278 place count 944 transition count 864
Iterating global reduction 2 with 21 rules applied. Total rules applied 299 place count 944 transition count 864
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 320 place count 923 transition count 843
Iterating global reduction 2 with 21 rules applied. Total rules applied 341 place count 923 transition count 843
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 362 place count 902 transition count 822
Iterating global reduction 2 with 21 rules applied. Total rules applied 383 place count 902 transition count 822
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 404 place count 881 transition count 801
Iterating global reduction 2 with 21 rules applied. Total rules applied 425 place count 881 transition count 801
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 426 place count 880 transition count 801
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 436 place count 870 transition count 791
Iterating global reduction 3 with 10 rules applied. Total rules applied 446 place count 870 transition count 791
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 456 place count 860 transition count 781
Iterating global reduction 3 with 10 rules applied. Total rules applied 466 place count 860 transition count 781
Applied a total of 466 rules in 274 ms. Remains 860 /1121 variables (removed 261) and now considering 781/1016 (removed 235) transitions.
// Phase 1: matrix 781 rows 860 cols
[2024-05-24 21:43:48] [INFO ] Computed 102 invariants in 7 ms
[2024-05-24 21:43:48] [INFO ] Implicit Places using invariants in 441 ms returned [418, 727]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 445 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 858/1121 places, 781/1016 transitions.
Applied a total of 0 rules in 36 ms. Remains 858 /858 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 757 ms. Remains : 858/1121 places, 781/1016 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s682 1) (GEQ s684 1) (GEQ s683 1) (GEQ s686 1) (GEQ s685 1) (GEQ s688 1) (GEQ s687 1) (GEQ s690 1) (GEQ s689 1) (GEQ s692 1) (GEQ s691 1) (GEQ...], 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 2456 reset in 522 ms.
Product exploration explored 100000 steps with 2418 reset in 556 ms.
Computed a total of 858 stabilizing places and 781 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 858 transition count 781
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 (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 781 rows 858 cols
[2024-05-24 21:43:50] [INFO ] Computed 100 invariants in 6 ms
[2024-05-24 21:43:52] [INFO ] [Real]Absence check using 0 positive and 100 generalized place invariants in 120 ms returned sat
[2024-05-24 21:43:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:43:53] [INFO ] [Real]Absence check using state equation in 1678 ms returned sat
[2024-05-24 21:43:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:43:54] [INFO ] [Nat]Absence check using 0 positive and 100 generalized place invariants in 62 ms returned sat
[2024-05-24 21:43:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:43:56] [INFO ] [Nat]Absence check using state equation in 1641 ms returned sat
[2024-05-24 21:43:56] [INFO ] Computed and/alt/rep : 768/901/768 causal constraints (skipped 2 transitions) in 41 ms.
[2024-05-24 21:43:58] [INFO ] Added : 140 causal constraints over 28 iterations in 2314 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 99 out of 858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 858/858 places, 781/781 transitions.
Graph (complete) has 1001 edges and 858 vertex of which 616 are kept as prefixes of interest. Removing 242 places using SCC suffix rule.2 ms
Discarding 242 places :
Also discarding 198 output transitions
Drop transitions removed 198 transitions
Reduce places removed 11 places and 11 transitions.
Drop transitions removed 286 transitions
Trivial Post-agglo rules discarded 286 transitions
Performed 286 trivial Post agglomeration. Transition count delta: 286
Iterating post reduction 0 with 286 rules applied. Total rules applied 287 place count 605 transition count 286
Reduce places removed 286 places and 0 transitions.
Iterating post reduction 1 with 286 rules applied. Total rules applied 573 place count 319 transition count 286
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 573 place count 319 transition count 187
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 793 place count 198 transition count 187
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 815 place count 187 transition count 176
Applied a total of 815 rules in 21 ms. Remains 187 /858 variables (removed 671) and now considering 176/781 (removed 605) transitions.
// Phase 1: matrix 176 rows 187 cols
[2024-05-24 21:43:58] [INFO ] Computed 33 invariants in 1 ms
[2024-05-24 21:43:58] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-24 21:43:58] [INFO ] Invariant cache hit.
[2024-05-24 21:43:59] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-24 21:43:59] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 21:43:59] [INFO ] Invariant cache hit.
[2024-05-24 21:43:59] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 187/858 places, 176/781 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 416 ms. Remains : 187/858 places, 176/781 transitions.
Computed a total of 187 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 187 transition count 176
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 (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-24 21:43:59] [INFO ] Invariant cache hit.
[2024-05-24 21:44:00] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 29 ms returned sat
[2024-05-24 21:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:44:00] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-05-24 21:44:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:44:01] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 23 ms returned sat
[2024-05-24 21:44:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:44:01] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2024-05-24 21:44:01] [INFO ] Computed and/alt/rep : 154/242/154 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-24 21:44:01] [INFO ] Added : 14 causal constraints over 3 iterations in 93 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7472 reset in 815 ms.
Product exploration explored 100000 steps with 7545 reset in 503 ms.
Built C files in :
/tmp/ltsmin9264962387553893115
[2024-05-24 21:44:02] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2024-05-24 21:44:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:44:02] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2024-05-24 21:44:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:44:02] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2024-05-24 21:44:02] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:44:02] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9264962387553893115
Running compilation step : cd /tmp/ltsmin9264962387553893115;'/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 464 ms.
Running link step : cd /tmp/ltsmin9264962387553893115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9264962387553893115;'/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/stateBased11127163216845474585.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 99 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 187 /187 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-24 21:44:17] [INFO ] Invariant cache hit.
[2024-05-24 21:44:17] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-24 21:44:17] [INFO ] Invariant cache hit.
[2024-05-24 21:44:18] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-24 21:44:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 21:44:18] [INFO ] Invariant cache hit.
[2024-05-24 21:44:18] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 187/187 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin10798432331785282658
[2024-05-24 21:44:18] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2024-05-24 21:44:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:44:18] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2024-05-24 21:44:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:44:18] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2024-05-24 21:44:18] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:44:18] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10798432331785282658
Running compilation step : cd /tmp/ltsmin10798432331785282658;'/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 551 ms.
Running link step : cd /tmp/ltsmin10798432331785282658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10798432331785282658;'/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/stateBased12616974925944795642.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 21:44:33] [INFO ] Flatten gal took : 10 ms
[2024-05-24 21:44:33] [INFO ] Flatten gal took : 9 ms
[2024-05-24 21:44:33] [INFO ] Time to serialize gal into /tmp/LTL4166202004658096899.gal : 2 ms
[2024-05-24 21:44:33] [INFO ] Time to serialize properties into /tmp/LTL12607548302423437740.prop : 1 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/LTL4166202004658096899.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8311558820260597854.hoa' '-atoms' '/tmp/LTL12607548302423437740.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/LTL12607548302423437740.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8311558820260597854.hoa
Reverse transition relation is NOT exact ! Due to transitions t884, t885, t886, t887, t888, t889, t890, t891, t892, t893, t894, t895, t896, t897, t898, t89...294
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
85 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.90274,32892,1,0,331,93479,382,227,5138,97521,589
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLFireability-15 finished in 46553 ms.
All properties solved by simple procedures.
Total runtime 134571 ms.

BK_STOP 1716587076094

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-171636280200243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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