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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.6K Apr 11 20:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 20:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 11 20:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 20:18 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 28K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 20:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 20:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 20:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 11 20:36 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 135K 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-L00020M0002C001P001G001-LTLFireability-00
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-01
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-02
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-03
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-04
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-05
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-06
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-07
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-08
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-09
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-10
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-11
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-12
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-13
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-14
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716587272083

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-L00020M0002C001P001G001
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-24 21:47:55] [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:47:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 21:47:55] [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:47:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 21:47:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1181 ms
[2024-05-24 21:47:56] [INFO ] Detected 5 constant HL places corresponding to 11 PT places.
[2024-05-24 21:47:56] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 3292 PT places and 2774.0 transition bindings in 41 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:47:56] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 8 ms.
[2024-05-24 21:47:56] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 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 10001 steps, including 7 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 19) seen :18
Finished Best-First random walk after 2205 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=200 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-24 21:47:57] [INFO ] Flatten gal took : 38 ms
[2024-05-24 21:47:57] [INFO ] Flatten gal took : 12 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
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
[2024-05-24 21:47:57] [INFO ] Unfolded HLPN to a Petri net with 3095 places and 2438 transitions 6997 arcs in 79 ms.
[2024-05-24 21:47:57] [INFO ] Unfolded 12 HLPN properties in 12 ms.
[2024-05-24 21:47:57] [INFO ] Reduced 21 identical enabling conditions.
[2024-05-24 21:47:57] [INFO ] Reduced 21 identical enabling conditions.
Deduced a syphon composed of 21 places in 27 ms
Reduce places removed 30 places and 0 transitions.
Support contains 1095 out of 3065 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3065/3065 places, 2438/2438 transitions.
Reduce places removed 73 places and 0 transitions.
Discarding 231 places :
Implicit places reduction removed 231 places
Iterating post reduction 0 with 304 rules applied. Total rules applied 304 place count 2761 transition count 2438
Discarding 169 places :
Symmetric choice reduction at 1 with 169 rule applications. Total rules 473 place count 2592 transition count 2269
Iterating global reduction 1 with 169 rules applied. Total rules applied 642 place count 2592 transition count 2269
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 663 place count 2571 transition count 2228
Iterating global reduction 1 with 21 rules applied. Total rules applied 684 place count 2571 transition count 2228
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 705 place count 2550 transition count 2228
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 726 place count 2529 transition count 2207
Iterating global reduction 2 with 21 rules applied. Total rules applied 747 place count 2529 transition count 2207
Applied a total of 747 rules in 1047 ms. Remains 2529 /3065 variables (removed 536) and now considering 2207/2438 (removed 231) transitions.
// Phase 1: matrix 2207 rows 2529 cols
[2024-05-24 21:47:58] [INFO ] Computed 446 invariants in 163 ms
[2024-05-24 21:47:59] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 21:48:00] [INFO ] Implicit Places using invariants in 1691 ms returned []
[2024-05-24 21:48:00] [INFO ] Invariant cache hit.
[2024-05-24 21:48:01] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned [1956, 1958]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3188 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2527/3065 places, 2207/2438 transitions.
Applied a total of 0 rules in 112 ms. Remains 2527 /2527 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4348 ms. Remains : 2527/3065 places, 2207/2438 transitions.
Support contains 1095 out of 2527 places after structural reductions.
[2024-05-24 21:48:02] [INFO ] Flatten gal took : 222 ms
[2024-05-24 21:48:02] [INFO ] Flatten gal took : 184 ms
[2024-05-24 21:48:02] [INFO ] Input system was already deterministic with 2207 transitions.
Finished random walk after 1072 steps, including 0 resets, run visited all 20 properties in 127 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2527 stabilizing places and 2207 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2527 transition count 2207
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' '!(((p0&&X(F(!p0))) U G(!p1)))'
Support contains 63 out of 2527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2527/2527 places, 2207/2207 transitions.
Graph (complete) has 3462 edges and 2527 vertex of which 2144 are kept as prefixes of interest. Removing 383 places using SCC suffix rule.17 ms
Discarding 383 places :
Also discarding 359 output transitions
Drop transitions removed 359 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 231 places :
Implicit places reduction removed 231 places
Drop transitions removed 1197 transitions
Trivial Post-agglo rules discarded 1197 transitions
Performed 1197 trivial Post agglomeration. Transition count delta: 1197
Iterating post reduction 0 with 1428 rules applied. Total rules applied 1429 place count 1892 transition count 630
Reduce places removed 1197 places and 0 transitions.
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2626 place count 695 transition count 630
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 170 Pre rules applied. Total rules applied 2626 place count 695 transition count 460
Deduced a syphon composed of 170 places in 1 ms
Ensure Unique test removed 63 places
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 403 rules applied. Total rules applied 3029 place count 462 transition count 460
Discarding 42 places :
Implicit places reduction removed 42 places
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 84 rules applied. Total rules applied 3113 place count 420 transition count 418
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 3155 place count 378 transition count 418
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 3157 place count 376 transition count 376
Iterating global reduction 4 with 2 rules applied. Total rules applied 3159 place count 376 transition count 376
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 4 with 38 rules applied. Total rules applied 3197 place count 357 transition count 357
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 3216 place count 338 transition count 357
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 3216 place count 338 transition count 338
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 3254 place count 319 transition count 338
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 3296 place count 277 transition count 296
Iterating global reduction 6 with 42 rules applied. Total rules applied 3338 place count 277 transition count 296
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 3380 place count 277 transition count 254
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 3380 place count 277 transition count 233
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 63 rules applied. Total rules applied 3443 place count 235 transition count 233
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 3485 place count 214 transition count 212
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 7 with 21 rules applied. Total rules applied 3506 place count 193 transition count 191
Applied a total of 3506 rules in 203 ms. Remains 193 /2527 variables (removed 2334) and now considering 191/2207 (removed 2016) transitions.
// Phase 1: matrix 191 rows 193 cols
[2024-05-24 21:48:03] [INFO ] Computed 23 invariants in 2 ms
[2024-05-24 21:48:03] [INFO ] Implicit Places using invariants in 162 ms returned [42, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 171]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 168 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/2527 places, 191/2207 transitions.
Reduce places removed 2 places and 2 transitions.
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 21 Pre rules applied. Total rules applied 0 place count 168 transition count 168
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 147 transition count 168
Applied a total of 42 rules in 9 ms. Remains 147 /170 variables (removed 23) and now considering 168/191 (removed 23) transitions.
// Phase 1: matrix 168 rows 147 cols
[2024-05-24 21:48:03] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 21:48:03] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 21:48:03] [INFO ] Invariant cache hit.
[2024-05-24 21:48:03] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 147/2527 places, 168/2207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 502 ms. Remains : 147/2527 places, 168/2207 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 393 ms :[true, p1, (OR p0 p1), p1]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(OR (GEQ s84 1) (GEQ s86 1) (GEQ s85 1) (GEQ s92 1) (GEQ s91 1) (GEQ s94 1) (GEQ s93 1) (GEQ s88 1) (GEQ s87 1) (GEQ s90 1) (GEQ s89 1) (GEQ s100 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-00 finished in 974 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 105 out of 2527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2527/2527 places, 2207/2207 transitions.
Graph (complete) has 3462 edges and 2527 vertex of which 1809 are kept as prefixes of interest. Removing 718 places using SCC suffix rule.9 ms
Discarding 718 places :
Also discarding 611 output transitions
Drop transitions removed 611 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 231 places :
Implicit places reduction removed 231 places
Drop transitions removed 1008 transitions
Trivial Post-agglo rules discarded 1008 transitions
Performed 1008 trivial Post agglomeration. Transition count delta: 1008
Iterating post reduction 0 with 1239 rules applied. Total rules applied 1240 place count 1557 transition count 567
Reduce places removed 1008 places and 0 transitions.
Iterating post reduction 1 with 1008 rules applied. Total rules applied 2248 place count 549 transition count 567
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 2248 place count 549 transition count 462
Deduced a syphon composed of 105 places in 14 ms
Ensure Unique test removed 42 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 2500 place count 402 transition count 462
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2502 place count 400 transition count 420
Iterating global reduction 2 with 2 rules applied. Total rules applied 2504 place count 400 transition count 420
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 2546 place count 379 transition count 399
Applied a total of 2546 rules in 163 ms. Remains 379 /2527 variables (removed 2148) and now considering 399/2207 (removed 1808) transitions.
// Phase 1: matrix 399 rows 379 cols
[2024-05-24 21:48:04] [INFO ] Computed 43 invariants in 3 ms
[2024-05-24 21:48:04] [INFO ] Implicit Places using invariants in 233 ms returned [84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 252, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 235 ms to find 43 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 336/2527 places, 399/2207 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 336 transition count 336
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 273 transition count 336
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 126 place count 273 transition count 315
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 168 place count 252 transition count 315
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 210 place count 231 transition count 336
Applied a total of 210 rules in 25 ms. Remains 231 /336 variables (removed 105) and now considering 336/399 (removed 63) transitions.
// Phase 1: matrix 336 rows 231 cols
[2024-05-24 21:48:04] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 21:48:04] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 21:48:04] [INFO ] Invariant cache hit.
[2024-05-24 21:48:04] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/2527 places, 336/2207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 632 ms. Remains : 231/2527 places, 336/2207 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s193 1) (GEQ s192 1) (GEQ s191 1) (GEQ s190 1) (GEQ s189 1) (GEQ s201 1) (GEQ s200 1) (GEQ s199 1) (GEQ s198 1) (GEQ s197 1) (GEQ s196 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3143 reset in 692 ms.
Product exploration explored 100000 steps with 3124 reset in 608 ms.
Computed a total of 231 stabilizing places and 336 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 231 transition count 336
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be false thanks to negative knowledge :(X (X (NOT p1)))
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-01 finished in 2446 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&&G(F(p1)))))'
Support contains 108 out of 2527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2527/2527 places, 2207/2207 transitions.
Graph (complete) has 3462 edges and 2527 vertex of which 1599 are kept as prefixes of interest. Removing 928 places using SCC suffix rule.6 ms
Discarding 928 places :
Also discarding 779 output transitions
Drop transitions removed 779 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 210 places :
Implicit places reduction removed 210 places
Drop transitions removed 840 transitions
Trivial Post-agglo rules discarded 840 transitions
Performed 840 trivial Post agglomeration. Transition count delta: 840
Iterating post reduction 0 with 1050 rules applied. Total rules applied 1051 place count 1368 transition count 567
Reduce places removed 840 places and 0 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Iterating post reduction 1 with 924 rules applied. Total rules applied 1975 place count 528 transition count 483
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 2059 place count 444 transition count 483
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 2059 place count 444 transition count 420
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 2185 place count 381 transition count 420
Applied a total of 2185 rules in 58 ms. Remains 381 /2527 variables (removed 2146) and now considering 420/2207 (removed 1787) transitions.
// Phase 1: matrix 420 rows 381 cols
[2024-05-24 21:48:06] [INFO ] Computed 64 invariants in 2 ms
[2024-05-24 21:48:06] [INFO ] Implicit Places using invariants in 201 ms returned [84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 211 ms to find 42 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 339/2527 places, 420/2207 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 339 transition count 357
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 276 transition count 357
Applied a total of 126 rules in 15 ms. Remains 276 /339 variables (removed 63) and now considering 357/420 (removed 63) transitions.
// Phase 1: matrix 357 rows 276 cols
[2024-05-24 21:48:06] [INFO ] Computed 22 invariants in 2 ms
[2024-05-24 21:48:07] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-24 21:48:07] [INFO ] Invariant cache hit.
[2024-05-24 21:48:07] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 276/2527 places, 357/2207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 516 ms. Remains : 276/2527 places, 357/2207 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (OR (LT s177 1) (LT s198 1)) (OR (LT s185 1) (LT s206 1)) (OR (LT s172 1) (LT s193 1)) (OR (LT s180 1) (LT s201 1)) (OR (LT s182 1) (LT s203 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1225 reset in 533 ms.
Product exploration explored 100000 steps with 1221 reset in 536 ms.
Computed a total of 276 stabilizing places and 357 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 276 transition count 357
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 187 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 94 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=47 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 216 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
[2024-05-24 21:48:09] [INFO ] Invariant cache hit.
[2024-05-24 21:48:09] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 11 ms returned sat
[2024-05-24 21:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:48:09] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-24 21:48:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:48:10] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 14 ms returned sat
[2024-05-24 21:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:48:10] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2024-05-24 21:48:10] [INFO ] Computed and/alt/rep : 231/336/231 causal constraints (skipped 63 transitions) in 55 ms.
[2024-05-24 21:48:11] [INFO ] Added : 114 causal constraints over 23 iterations in 1145 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 42 out of 276 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 : 276/276 places, 357/357 transitions.
Applied a total of 0 rules in 25 ms. Remains 276 /276 variables (removed 0) and now considering 357/357 (removed 0) transitions.
[2024-05-24 21:48:11] [INFO ] Invariant cache hit.
[2024-05-24 21:48:11] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-24 21:48:11] [INFO ] Invariant cache hit.
[2024-05-24 21:48:11] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-24 21:48:11] [INFO ] Redundant transitions in 45 ms returned []
[2024-05-24 21:48:11] [INFO ] Invariant cache hit.
[2024-05-24 21:48:12] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 864 ms. Remains : 276/276 places, 357/357 transitions.
Computed a total of 276 stabilizing places and 357 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 276 transition count 357
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 202 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Finished random walk after 90 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
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 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2024-05-24 21:48:13] [INFO ] Invariant cache hit.
[2024-05-24 21:48:13] [INFO ] [Real]Absence check using 0 positive and 22 generalized place invariants in 13 ms returned sat
[2024-05-24 21:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:48:13] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-05-24 21:48:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:48:14] [INFO ] [Nat]Absence check using 0 positive and 22 generalized place invariants in 12 ms returned sat
[2024-05-24 21:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:48:14] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2024-05-24 21:48:14] [INFO ] Computed and/alt/rep : 231/336/231 causal constraints (skipped 63 transitions) in 37 ms.
[2024-05-24 21:48:15] [INFO ] Added : 114 causal constraints over 23 iterations in 947 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1269 reset in 488 ms.
Product exploration explored 100000 steps with 1263 reset in 597 ms.
Built C files in :
/tmp/ltsmin10874172971470196573
[2024-05-24 21:48:16] [INFO ] Computing symmetric may disable matrix : 357 transitions.
[2024-05-24 21:48:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:48:16] [INFO ] Computing symmetric may enable matrix : 357 transitions.
[2024-05-24 21:48:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:48:16] [INFO ] Computing Do-Not-Accords matrix : 357 transitions.
[2024-05-24 21:48:16] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:48:16] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10874172971470196573
Running compilation step : cd /tmp/ltsmin10874172971470196573;'/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 1759 ms.
Running link step : cd /tmp/ltsmin10874172971470196573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin10874172971470196573;'/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/stateBased12351219949328070337.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 42 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 357/357 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 255 transition count 252
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 231 place count 150 transition count 252
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 231 place count 150 transition count 210
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 315 place count 108 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 317 place count 106 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 319 place count 106 transition count 168
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 361 place count 106 transition count 126
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 382 place count 85 transition count 105
Applied a total of 382 rules in 18 ms. Remains 85 /276 variables (removed 191) and now considering 105/357 (removed 252) transitions.
// Phase 1: matrix 105 rows 85 cols
[2024-05-24 21:48:31] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 21:48:31] [INFO ] Implicit Places using invariants in 72 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/276 places, 105/357 transitions.
Reduce places removed 21 places and 21 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /84 variables (removed 21) and now considering 84/105 (removed 21) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 63/276 places, 84/357 transitions.
Built C files in :
/tmp/ltsmin226438841158309570
[2024-05-24 21:48:31] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2024-05-24 21:48:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:48:31] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2024-05-24 21:48:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:48:31] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2024-05-24 21:48:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:48:31] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin226438841158309570
Running compilation step : cd /tmp/ltsmin226438841158309570;'/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 227 ms.
Running link step : cd /tmp/ltsmin226438841158309570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin226438841158309570;'/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/stateBased2243349932337206185.hoa' '--buchi-type=spotba'
LTSmin run took 99 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-02 finished in 25354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (F(G(p0)) U p1))))'
Support contains 168 out of 2527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2527/2527 places, 2207/2207 transitions.
Discarding 168 places :
Implicit places reduction removed 168 places
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 2359 transition count 2207
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 231 place count 2296 transition count 2144
Iterating global reduction 1 with 63 rules applied. Total rules applied 294 place count 2296 transition count 2144
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 336 place count 2254 transition count 2102
Iterating global reduction 1 with 42 rules applied. Total rules applied 378 place count 2254 transition count 2102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 380 place count 2252 transition count 2060
Iterating global reduction 1 with 2 rules applied. Total rules applied 382 place count 2252 transition count 2060
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 403 place count 2231 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 445 place count 2189 transition count 2018
Iterating global reduction 2 with 42 rules applied. Total rules applied 487 place count 2189 transition count 2018
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 529 place count 2147 transition count 1976
Iterating global reduction 2 with 42 rules applied. Total rules applied 571 place count 2147 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 613 place count 2105 transition count 1934
Iterating global reduction 2 with 42 rules applied. Total rules applied 655 place count 2105 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 697 place count 2063 transition count 1892
Iterating global reduction 2 with 42 rules applied. Total rules applied 739 place count 2063 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 781 place count 2021 transition count 1850
Iterating global reduction 2 with 42 rules applied. Total rules applied 823 place count 2021 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 865 place count 1979 transition count 1808
Iterating global reduction 2 with 42 rules applied. Total rules applied 907 place count 1979 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 949 place count 1937 transition count 1766
Iterating global reduction 2 with 42 rules applied. Total rules applied 991 place count 1937 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1033 place count 1895 transition count 1724
Iterating global reduction 2 with 42 rules applied. Total rules applied 1075 place count 1895 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1117 place count 1853 transition count 1682
Iterating global reduction 2 with 42 rules applied. Total rules applied 1159 place count 1853 transition count 1682
Applied a total of 1159 rules in 2481 ms. Remains 1853 /2527 variables (removed 674) and now considering 1682/2207 (removed 525) transitions.
// Phase 1: matrix 1682 rows 1853 cols
[2024-05-24 21:48:34] [INFO ] Computed 255 invariants in 38 ms
[2024-05-24 21:48:35] [INFO ] Implicit Places using invariants in 1354 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 525, 905, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 961, 962, 963, 964, 965, 966, 967, 968, 1076, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303, 1304, 1305, 1600]
Discarding 65 places :
Implicit Place search using SMT only with invariants took 1366 ms to find 65 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1788/2527 places, 1682/2207 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1747 transition count 1641
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1747 transition count 1641
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1727 transition count 1601
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1727 transition count 1601
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1707 transition count 1581
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1707 transition count 1581
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1687 transition count 1561
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1687 transition count 1561
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1667 transition count 1541
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1667 transition count 1541
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1647 transition count 1521
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1647 transition count 1521
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1627 transition count 1501
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1627 transition count 1501
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1607 transition count 1481
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1607 transition count 1481
Applied a total of 362 rules in 951 ms. Remains 1607 /1788 variables (removed 181) and now considering 1481/1682 (removed 201) transitions.
// Phase 1: matrix 1481 rows 1607 cols
[2024-05-24 21:48:36] [INFO ] Computed 190 invariants in 22 ms
[2024-05-24 21:48:37] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-24 21:48:37] [INFO ] Invariant cache hit.
[2024-05-24 21:48:39] [INFO ] Implicit Places using invariants and state equation in 1731 ms returned []
Implicit Place search using SMT with State Equation took 2421 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1607/2527 places, 1481/2207 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7221 ms. Remains : 1607/2527 places, 1481/2207 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s375 1) (GEQ s438 1)) (AND (GEQ s338 1) (GEQ s401 1)) (AND (GEQ s365 1) (GEQ s428 1)) (AND (GEQ s397 1) (GEQ s460 1)) (AND (GEQ s385 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1214 steps with 0 reset in 36 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-03 finished in 7523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 126 out of 2527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2527/2527 places, 2207/2207 transitions.
Discarding 231 places :
Implicit places reduction removed 231 places
Iterating post reduction 0 with 231 rules applied. Total rules applied 231 place count 2296 transition count 2207
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 252 place count 2275 transition count 2186
Iterating global reduction 1 with 21 rules applied. Total rules applied 273 place count 2275 transition count 2186
Applied a total of 273 rules in 435 ms. Remains 2275 /2527 variables (removed 252) and now considering 2186/2207 (removed 21) transitions.
// Phase 1: matrix 2186 rows 2275 cols
[2024-05-24 21:48:40] [INFO ] Computed 213 invariants in 47 ms
[2024-05-24 21:48:41] [INFO ] Implicit Places using invariants in 1462 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 462, 1220, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1541, 1542, 1543, 1544, 1545, 1546, 1547, 1548, 1549, 1550, 1551, 1552, 1553, 1554, 1555, 1556, 1557, 1558, 1559, 1560, 1561, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 2022]
Discarding 85 places :
Implicit Place search using SMT only with invariants took 1468 ms to find 85 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2190/2527 places, 2186/2207 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2149 transition count 2145
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2149 transition count 2145
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 2129 transition count 2105
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 2129 transition count 2105
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 2109 transition count 2085
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 2109 transition count 2085
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 2089 transition count 2065
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 2089 transition count 2065
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 2069 transition count 2045
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 2069 transition count 2045
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 2049 transition count 2025
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 2049 transition count 2025
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 2029 transition count 2005
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 2029 transition count 2005
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 2009 transition count 1985
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 2009 transition count 1985
Applied a total of 362 rules in 1637 ms. Remains 2009 /2190 variables (removed 181) and now considering 1985/2186 (removed 201) transitions.
// Phase 1: matrix 1985 rows 2009 cols
[2024-05-24 21:48:43] [INFO ] Computed 128 invariants in 36 ms
[2024-05-24 21:48:43] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 21:48:44] [INFO ] Implicit Places using invariants in 940 ms returned []
[2024-05-24 21:48:44] [INFO ] Invariant cache hit.
[2024-05-24 21:48:47] [INFO ] Implicit Places using invariants and state equation in 3425 ms returned []
Implicit Place search using SMT with State Equation took 4374 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2009/2527 places, 1985/2207 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7916 ms. Remains : 2009/2527 places, 1985/2207 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s1283 1) (GEQ s1281 1) (GEQ s1279 1) (GEQ s1277 1) (GEQ s1275 1) (GEQ s1273 1) (GEQ s1271 1) (GEQ s1269 1) (GEQ s1267 1) (GEQ s1265 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 384 reset in 857 ms.
Product exploration explored 100000 steps with 379 reset in 611 ms.
Computed a total of 2009 stabilizing places and 1985 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2009 transition count 1985
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Finished random walk after 239 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=79 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 8 factoid took 197 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 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
[2024-05-24 21:48:50] [INFO ] Invariant cache hit.
[2024-05-24 21:48:52] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 120 ms returned sat
[2024-05-24 21:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:48:53] [INFO ] [Real]Absence check using state equation in 1787 ms returned sat
[2024-05-24 21:48:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:48:55] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 113 ms returned sat
[2024-05-24 21:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:48:58] [INFO ] [Nat]Absence check using state equation in 2839 ms returned sat
[2024-05-24 21:48:59] [INFO ] Computed and/alt/rep : 1899/2131/1899 causal constraints (skipped 65 transitions) in 182 ms.
[2024-05-24 21:49:09] [INFO ] Added : 365 causal constraints over 73 iterations in 10146 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 63 out of 2009 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 : 2009/2009 places, 1985/1985 transitions.
Graph (complete) has 2384 edges and 2009 vertex of which 1074 are kept as prefixes of interest. Removing 935 places using SCC suffix rule.2 ms
Discarding 935 places :
Also discarding 830 output transitions
Drop transitions removed 830 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 672 transitions
Trivial Post-agglo rules discarded 672 transitions
Performed 672 trivial Post agglomeration. Transition count delta: 672
Iterating post reduction 0 with 672 rules applied. Total rules applied 673 place count 1053 transition count 462
Reduce places removed 672 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 735 rules applied. Total rules applied 1408 place count 381 transition count 399
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 1471 place count 318 transition count 399
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 1471 place count 318 transition count 378
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 1513 place count 297 transition count 378
Applied a total of 1513 rules in 34 ms. Remains 297 /2009 variables (removed 1712) and now considering 378/1985 (removed 1607) transitions.
// Phase 1: matrix 378 rows 297 cols
[2024-05-24 21:49:09] [INFO ] Computed 1 invariants in 2 ms
[2024-05-24 21:49:09] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-24 21:49:09] [INFO ] Invariant cache hit.
[2024-05-24 21:49:09] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-24 21:49:09] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-24 21:49:09] [INFO ] Invariant cache hit.
[2024-05-24 21:49:09] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 297/2009 places, 378/1985 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 668 ms. Remains : 297/2009 places, 378/1985 transitions.
Computed a total of 297 stabilizing places and 378 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 297 transition count 378
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 p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 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 37 ms :[(NOT p1)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 113 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 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
[2024-05-24 21:49:10] [INFO ] Invariant cache hit.
[2024-05-24 21:49:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 21:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:49:10] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-24 21:49:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:49:10] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 21:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:49:11] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-05-24 21:49:11] [INFO ] Computed and/alt/rep : 252/252/252 causal constraints (skipped 63 transitions) in 30 ms.
[2024-05-24 21:49:11] [INFO ] Added : 42 causal constraints over 9 iterations in 249 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2287 reset in 724 ms.
Product exploration explored 100000 steps with 2284 reset in 585 ms.
Built C files in :
/tmp/ltsmin2283238130513580203
[2024-05-24 21:49:12] [INFO ] Computing symmetric may disable matrix : 378 transitions.
[2024-05-24 21:49:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:49:12] [INFO ] Computing symmetric may enable matrix : 378 transitions.
[2024-05-24 21:49:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:49:12] [INFO ] Computing Do-Not-Accords matrix : 378 transitions.
[2024-05-24 21:49:12] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:49:12] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2283238130513580203
Running compilation step : cd /tmp/ltsmin2283238130513580203;'/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 1084 ms.
Running link step : cd /tmp/ltsmin2283238130513580203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2283238130513580203;'/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/stateBased8694872082549040492.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 63 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 378/378 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 297 transition count 252
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 1 with 126 rules applied. Total rules applied 252 place count 171 transition count 252
Applied a total of 252 rules in 9 ms. Remains 171 /297 variables (removed 126) and now considering 252/378 (removed 126) transitions.
// Phase 1: matrix 252 rows 171 cols
[2024-05-24 21:49:27] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 21:49:27] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-24 21:49:27] [INFO ] Invariant cache hit.
[2024-05-24 21:49:28] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-24 21:49:28] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 21:49:28] [INFO ] Invariant cache hit.
[2024-05-24 21:49:28] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/297 places, 252/378 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 171/297 places, 252/378 transitions.
Built C files in :
/tmp/ltsmin4651042034562759105
[2024-05-24 21:49:28] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2024-05-24 21:49:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:49:28] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2024-05-24 21:49:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:49:28] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2024-05-24 21:49:28] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:49:28] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4651042034562759105
Running compilation step : cd /tmp/ltsmin4651042034562759105;'/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 810 ms.
Running link step : cd /tmp/ltsmin4651042034562759105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4651042034562759105;'/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/stateBased11353619340494069127.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 21:49:43] [INFO ] Flatten gal took : 18 ms
[2024-05-24 21:49:43] [INFO ] Flatten gal took : 17 ms
[2024-05-24 21:49:43] [INFO ] Time to serialize gal into /tmp/LTL11707874259756744650.gal : 6 ms
[2024-05-24 21:49:43] [INFO ] Time to serialize properties into /tmp/LTL9966199796180127473.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/LTL11707874259756744650.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4835727698927958766.hoa' '-atoms' '/tmp/LTL9966199796180127473.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/LTL9966199796180127473.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4835727698927958766.hoa
Detected timeout of ITS tools.
[2024-05-24 21:49:58] [INFO ] Flatten gal took : 23 ms
[2024-05-24 21:49:58] [INFO ] Flatten gal took : 22 ms
[2024-05-24 21:49:58] [INFO ] Time to serialize gal into /tmp/LTL8050817936663450954.gal : 7 ms
[2024-05-24 21:49:58] [INFO ] Time to serialize properties into /tmp/LTL3875305115741151900.ltl : 3 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/LTL8050817936663450954.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3875305115741151900.ltl' '-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...275
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((m5_5>=1)||(m5_3>=1))||((m5_1>=1)||(m5_21>=1)))||(((m5_54>=1)||(m5_19>=1))||((m5_56>=1)||(m5_58>=1))))||((((m5_17>=1)||...1844
Formula 0 simplified : X(F!"(((((((m5_5>=1)||(m5_3>=1))||((m5_1>=1)||(m5_21>=1)))||(((m5_54>=1)||(m5_19>=1))||((m5_56>=1)||(m5_58>=1))))||((((m5_17>=1)||(m...1836
Detected timeout of ITS tools.
[2024-05-24 21:50:13] [INFO ] Flatten gal took : 22 ms
[2024-05-24 21:50:13] [INFO ] Applying decomposition
[2024-05-24 21:50:13] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1440665972146197704.txt' '-o' '/tmp/graph1440665972146197704.bin' '-w' '/tmp/graph1440665972146197704.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1440665972146197704.bin' '-l' '-1' '-v' '-w' '/tmp/graph1440665972146197704.weights' '-q' '0' '-e' '0.001'
[2024-05-24 21:50:14] [INFO ] Decomposing Gal with order
[2024-05-24 21:50:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 21:50:14] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-24 21:50:14] [INFO ] Flatten gal took : 87 ms
[2024-05-24 21:50:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-24 21:50:14] [INFO ] Time to serialize gal into /tmp/LTL11730985684966953638.gal : 11 ms
[2024-05-24 21:50:14] [INFO ] Time to serialize properties into /tmp/LTL9055325085105639923.ltl : 2 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/LTL11730985684966953638.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9055325085105639923.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((i2.u46.m5_5>=1)||(i2.u7.m5_3>=1))||((i1.u5.m5_1>=1)||(i6.u19.m5_21>=1)))||(((i0.u3.m5_54>=1)||(i15.u49.m5_19>=1))||((i...2811
Formula 0 simplified : X(F!"(((((((i2.u46.m5_5>=1)||(i2.u7.m5_3>=1))||((i1.u5.m5_1>=1)||(i6.u19.m5_21>=1)))||(((i0.u3.m5_54>=1)||(i15.u49.m5_19>=1))||((i0....2803
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17339648096875491435
[2024-05-24 21:50:29] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17339648096875491435
Running compilation step : cd /tmp/ltsmin17339648096875491435;'/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 996 ms.
Running link step : cd /tmp/ltsmin17339648096875491435;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17339648096875491435;'/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' '--ltl' 'X(([]((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-04 finished in 124919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(!p1 U (p2||G(!p1))))))'
Support contains 108 out of 2527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2527/2527 places, 2207/2207 transitions.
Discarding 231 places :
Implicit places reduction removed 231 places
Iterating post reduction 0 with 231 rules applied. Total rules applied 231 place count 2296 transition count 2207
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 294 place count 2233 transition count 2144
Iterating global reduction 1 with 63 rules applied. Total rules applied 357 place count 2233 transition count 2144
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 399 place count 2191 transition count 2102
Iterating global reduction 1 with 42 rules applied. Total rules applied 441 place count 2191 transition count 2102
Applied a total of 441 rules in 635 ms. Remains 2191 /2527 variables (removed 336) and now considering 2102/2207 (removed 105) transitions.
// Phase 1: matrix 2102 rows 2191 cols
[2024-05-24 21:50:45] [INFO ] Computed 213 invariants in 19 ms
[2024-05-24 21:50:46] [INFO ] Implicit Places using invariants in 1317 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 462, 1220, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, 1468, 1469, 1470, 1471, 1472, 1473, 1474, 1475, 1476, 1477, 1625, 1626, 1627, 1628, 1629, 1630, 1631, 1632, 1633, 1634, 1635, 1636, 1637, 1638, 1639, 1640, 1641, 1642, 1643, 1938]
Discarding 85 places :
Implicit Place search using SMT only with invariants took 1321 ms to find 85 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2106/2527 places, 2102/2207 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2065 transition count 2061
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2065 transition count 2061
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 2045 transition count 2021
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 2045 transition count 2021
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 2025 transition count 2001
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 2025 transition count 2001
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 2005 transition count 1981
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 2005 transition count 1981
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1985 transition count 1961
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1985 transition count 1961
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1965 transition count 1941
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1965 transition count 1941
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1945 transition count 1921
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1945 transition count 1921
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1925 transition count 1901
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1925 transition count 1901
Applied a total of 362 rules in 1312 ms. Remains 1925 /2106 variables (removed 181) and now considering 1901/2102 (removed 201) transitions.
// Phase 1: matrix 1901 rows 1925 cols
[2024-05-24 21:50:47] [INFO ] Computed 128 invariants in 14 ms
[2024-05-24 21:50:48] [INFO ] Implicit Places using invariants in 579 ms returned []
[2024-05-24 21:50:48] [INFO ] Invariant cache hit.
[2024-05-24 21:50:50] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 2736 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1925/2527 places, 1901/2207 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6006 ms. Remains : 1925/2527 places, 1901/2207 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s1160 1) (LT s1166 1)) (OR (LT s1151 1) (LT s1168 1)) (OR (LT s1146 1) (LT s1167 1)) (OR (LT s1150 1) (LT s1168 1)) (OR (LT s1160 1) (LT s...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-06 finished in 6205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 84 out of 2527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2527/2527 places, 2207/2207 transitions.
Discarding 210 places :
Implicit places reduction removed 210 places
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 2317 transition count 2207
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 273 place count 2254 transition count 2144
Iterating global reduction 1 with 63 rules applied. Total rules applied 336 place count 2254 transition count 2144
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 378 place count 2212 transition count 2102
Iterating global reduction 1 with 42 rules applied. Total rules applied 420 place count 2212 transition count 2102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 422 place count 2210 transition count 2060
Iterating global reduction 1 with 2 rules applied. Total rules applied 424 place count 2210 transition count 2060
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 445 place count 2189 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 487 place count 2147 transition count 2018
Iterating global reduction 2 with 42 rules applied. Total rules applied 529 place count 2147 transition count 2018
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 571 place count 2105 transition count 1976
Iterating global reduction 2 with 42 rules applied. Total rules applied 613 place count 2105 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 655 place count 2063 transition count 1934
Iterating global reduction 2 with 42 rules applied. Total rules applied 697 place count 2063 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 739 place count 2021 transition count 1892
Iterating global reduction 2 with 42 rules applied. Total rules applied 781 place count 2021 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 823 place count 1979 transition count 1850
Iterating global reduction 2 with 42 rules applied. Total rules applied 865 place count 1979 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 907 place count 1937 transition count 1808
Iterating global reduction 2 with 42 rules applied. Total rules applied 949 place count 1937 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 991 place count 1895 transition count 1766
Iterating global reduction 2 with 42 rules applied. Total rules applied 1033 place count 1895 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1075 place count 1853 transition count 1724
Iterating global reduction 2 with 42 rules applied. Total rules applied 1117 place count 1853 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1159 place count 1811 transition count 1682
Iterating global reduction 2 with 42 rules applied. Total rules applied 1201 place count 1811 transition count 1682
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1243 place count 1769 transition count 1640
Iterating global reduction 2 with 42 rules applied. Total rules applied 1285 place count 1769 transition count 1640
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1327 place count 1727 transition count 1598
Iterating global reduction 2 with 42 rules applied. Total rules applied 1369 place count 1727 transition count 1598
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1411 place count 1685 transition count 1556
Iterating global reduction 2 with 42 rules applied. Total rules applied 1453 place count 1685 transition count 1556
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1495 place count 1643 transition count 1514
Iterating global reduction 2 with 42 rules applied. Total rules applied 1537 place count 1643 transition count 1514
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 1600 place count 1622 transition count 1472
Applied a total of 1600 rules in 2220 ms. Remains 1622 /2527 variables (removed 905) and now considering 1472/2207 (removed 735) transitions.
// Phase 1: matrix 1472 rows 1622 cols
[2024-05-24 21:50:52] [INFO ] Computed 192 invariants in 12 ms
[2024-05-24 21:50:53] [INFO ] Implicit Places using invariants in 962 ms returned [273, 653, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 824, 1056, 1057, 1058, 1059, 1060, 1061, 1062, 1063, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1073, 1074, 1369]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 965 ms to find 44 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1578/2527 places, 1472/2207 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1537 transition count 1431
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1537 transition count 1431
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1517 transition count 1391
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1517 transition count 1391
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1497 transition count 1371
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1497 transition count 1371
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1477 transition count 1351
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1477 transition count 1351
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1457 transition count 1331
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1457 transition count 1331
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1437 transition count 1311
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1437 transition count 1311
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1417 transition count 1291
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1417 transition count 1291
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1397 transition count 1271
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1397 transition count 1271
Applied a total of 362 rules in 852 ms. Remains 1397 /1578 variables (removed 181) and now considering 1271/1472 (removed 201) transitions.
// Phase 1: matrix 1271 rows 1397 cols
[2024-05-24 21:50:54] [INFO ] Computed 148 invariants in 7 ms
[2024-05-24 21:50:55] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-24 21:50:55] [INFO ] Invariant cache hit.
[2024-05-24 21:50:56] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned []
Implicit Place search using SMT with State Equation took 2230 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1397/2527 places, 1271/2207 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6268 ms. Remains : 1397/2527 places, 1271/2207 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s883 1) (GEQ s884 1) (GEQ s885 1) (GEQ s886 1) (GEQ s879 1) (GEQ s880 1) (GEQ s881 1) (GEQ s882 1) (GEQ s891 1) (GEQ s892 1) (GEQ s893 1) (GEQ...], 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 423 reset in 534 ms.
Product exploration explored 100000 steps with 467 reset in 501 ms.
Computed a total of 1397 stabilizing places and 1271 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1397 transition count 1271
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Finished random walk after 430 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=107 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 135 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 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
[2024-05-24 21:50:59] [INFO ] Invariant cache hit.
[2024-05-24 21:51:00] [INFO ] [Real]Absence check using 0 positive and 148 generalized place invariants in 95 ms returned sat
[2024-05-24 21:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:51:01] [INFO ] [Real]Absence check using state equation in 1307 ms returned sat
[2024-05-24 21:51:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:51:03] [INFO ] [Nat]Absence check using 0 positive and 148 generalized place invariants in 117 ms returned sat
[2024-05-24 21:51:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:51:04] [INFO ] [Nat]Absence check using state equation in 1272 ms returned sat
[2024-05-24 21:51:04] [INFO ] Computed and/alt/rep : 1248/1417/1248 causal constraints (skipped 2 transitions) in 119 ms.
[2024-05-24 21:51:16] [INFO ] Added : 555 causal constraints over 111 iterations in 12197 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 42 out of 1397 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 : 1397/1397 places, 1271/1271 transitions.
Graph (complete) has 1586 edges and 1397 vertex of which 714 are kept as prefixes of interest. Removing 683 places using SCC suffix rule.3 ms
Discarding 683 places :
Also discarding 557 output transitions
Drop transitions removed 557 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 0 with 483 rules applied. Total rules applied 484 place count 693 transition count 210
Reduce places removed 483 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 504 rules applied. Total rules applied 988 place count 210 transition count 189
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 1009 place count 189 transition count 189
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 1009 place count 189 transition count 147
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1093 place count 147 transition count 147
Applied a total of 1093 rules in 20 ms. Remains 147 /1397 variables (removed 1250) and now considering 147/1271 (removed 1124) transitions.
// Phase 1: matrix 147 rows 147 cols
[2024-05-24 21:51:16] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 21:51:16] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-24 21:51:16] [INFO ] Invariant cache hit.
[2024-05-24 21:51:17] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-24 21:51:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 21:51:17] [INFO ] Invariant cache hit.
[2024-05-24 21:51:17] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/1397 places, 147/1271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 354 ms. Remains : 147/1397 places, 147/1271 transitions.
Computed a total of 147 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 147
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 p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 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 55 ms :[(NOT p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 151 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 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
[2024-05-24 21:51:17] [INFO ] Invariant cache hit.
[2024-05-24 21:51:17] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 10 ms returned sat
[2024-05-24 21:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 21:51:17] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-24 21:51:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 21:51:18] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 9 ms returned sat
[2024-05-24 21:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 21:51:18] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-24 21:51:18] [INFO ] Computed and/alt/rep : 126/147/126 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-24 21:51:18] [INFO ] Added : 42 causal constraints over 9 iterations in 207 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Product exploration explored 100000 steps with 4321 reset in 592 ms.
Product exploration explored 100000 steps with 4332 reset in 405 ms.
Built C files in :
/tmp/ltsmin16278627949601806861
[2024-05-24 21:51:19] [INFO ] Computing symmetric may disable matrix : 147 transitions.
[2024-05-24 21:51:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:51:19] [INFO ] Computing symmetric may enable matrix : 147 transitions.
[2024-05-24 21:51:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:51:19] [INFO ] Computing Do-Not-Accords matrix : 147 transitions.
[2024-05-24 21:51:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 21:51:19] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16278627949601806861
Running compilation step : cd /tmp/ltsmin16278627949601806861;'/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 562 ms.
Running link step : cd /tmp/ltsmin16278627949601806861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16278627949601806861;'/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/stateBased17608791974709349955.hoa' '--buchi-type=spotba'
LTSmin run took 413 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-08 finished in 29879 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 105 out of 2527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2527/2527 places, 2207/2207 transitions.
Graph (complete) has 3462 edges and 2527 vertex of which 2462 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.5 ms
Discarding 65 places :
Also discarding 44 output transitions
Drop transitions removed 44 transitions
Reduce places removed 21 places and 21 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 231 places :
Implicit places reduction removed 231 places
Drop transitions removed 1365 transitions
Trivial Post-agglo rules discarded 1365 transitions
Performed 1365 trivial Post agglomeration. Transition count delta: 1365
Iterating post reduction 0 with 1617 rules applied. Total rules applied 1618 place count 2210 transition count 756
Reduce places removed 1365 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 1386 rules applied. Total rules applied 3004 place count 845 transition count 735
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 3025 place count 824 transition count 735
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 191 Pre rules applied. Total rules applied 3025 place count 824 transition count 544
Deduced a syphon composed of 191 places in 1 ms
Ensure Unique test removed 42 places
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 3 with 424 rules applied. Total rules applied 3449 place count 591 transition count 544
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 42 rules applied. Total rules applied 3491 place count 591 transition count 502
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 3554 place count 549 transition count 481
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3556 place count 547 transition count 439
Iterating global reduction 5 with 2 rules applied. Total rules applied 3558 place count 547 transition count 439
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 5 with 42 rules applied. Total rules applied 3600 place count 526 transition count 418
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 3621 place count 505 transition count 418
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 3621 place count 505 transition count 397
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 3663 place count 484 transition count 397
Discarding 42 places :
Symmetric choice reduction at 7 with 42 rule applications. Total rules 3705 place count 442 transition count 355
Iterating global reduction 7 with 42 rules applied. Total rules applied 3747 place count 442 transition count 355
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 3789 place count 442 transition count 313
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 21 Pre rules applied. Total rules applied 3789 place count 442 transition count 292
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 8 with 63 rules applied. Total rules applied 3852 place count 400 transition count 292
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 8 with 99 rules applied. Total rules applied 3951 place count 341 transition count 252
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 3972 place count 320 transition count 231
Applied a total of 3972 rules in 128 ms. Remains 320 /2527 variables (removed 2207) and now considering 231/2207 (removed 1976) transitions.
// Phase 1: matrix 231 rows 320 cols
[2024-05-24 21:51:20] [INFO ] Computed 89 invariants in 3 ms
[2024-05-24 21:51:21] [INFO ] Implicit Places using invariants in 354 ms returned [21, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 86, 129, 151]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 356 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 295/2527 places, 231/2207 transitions.
Reduce places removed 21 places and 21 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 274 transition count 189
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 253 transition count 189
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 63 place count 232 transition count 168
Applied a total of 63 rules in 14 ms. Remains 232 /295 variables (removed 63) and now considering 168/231 (removed 63) transitions.
// Phase 1: matrix 168 rows 232 cols
[2024-05-24 21:51:21] [INFO ] Computed 64 invariants in 1 ms
[2024-05-24 21:51:21] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-24 21:51:21] [INFO ] Invariant cache hit.
[2024-05-24 21:51:21] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 232/2527 places, 168/2207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 870 ms. Remains : 232/2527 places, 168/2207 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-09 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:(OR (AND (GEQ s154 1) (GEQ s175 1) (GEQ s196 1) (GEQ s217 1)) (AND (GEQ s157 1) (GEQ s178 1) (GEQ s199 1) (GEQ s220 1)) (AND (GEQ s148 1) (GEQ s169 1) ...], 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 1206 reset in 1039 ms.
Product exploration explored 100000 steps with 1220 reset in 1110 ms.
Computed a total of 232 stabilizing places and 168 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 232 transition count 168
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 26 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-09 finished in 3752 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(G(p1)))))'
Support contains 147 out of 2527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2527/2527 places, 2207/2207 transitions.
Graph (complete) has 3462 edges and 2527 vertex of which 2462 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.4 ms
Discarding 65 places :
Also discarding 44 output transitions
Drop transitions removed 44 transitions
Reduce places removed 21 places and 21 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 168 places :
Implicit places reduction removed 168 places
Drop transitions removed 1071 transitions
Trivial Post-agglo rules discarded 1071 transitions
Performed 1071 trivial Post agglomeration. Transition count delta: 1071
Iterating post reduction 0 with 1260 rules applied. Total rules applied 1261 place count 2273 transition count 1050
Reduce places removed 1071 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 1134 rules applied. Total rules applied 2395 place count 1202 transition count 987
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 2458 place count 1139 transition count 987
Performed 338 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 338 Pre rules applied. Total rules applied 2458 place count 1139 transition count 649
Deduced a syphon composed of 338 places in 0 ms
Ensure Unique test removed 105 places
Reduce places removed 443 places and 0 transitions.
Iterating global reduction 3 with 781 rules applied. Total rules applied 3239 place count 696 transition count 649
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 3 with 63 rules applied. Total rules applied 3302 place count 696 transition count 586
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 84 rules applied. Total rules applied 3386 place count 633 transition count 565
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3388 place count 631 transition count 523
Iterating global reduction 5 with 2 rules applied. Total rules applied 3390 place count 631 transition count 523
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 5 with 42 rules applied. Total rules applied 3432 place count 610 transition count 502
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 3453 place count 589 transition count 502
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 3453 place count 589 transition count 481
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 3495 place count 568 transition count 481
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 7 with 99 rules applied. Total rules applied 3594 place count 509 transition count 441
Applied a total of 3594 rules in 226 ms. Remains 509 /2527 variables (removed 2018) and now considering 441/2207 (removed 1766) transitions.
// Phase 1: matrix 441 rows 509 cols
[2024-05-24 21:51:24] [INFO ] Computed 110 invariants in 5 ms
[2024-05-24 21:51:25] [INFO ] Implicit Places using invariants in 490 ms returned [84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 126, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 443, 486, 508]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 493 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 463/2527 places, 441/2207 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 463 transition count 336
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 358 transition count 336
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 210 place count 358 transition count 315
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 252 place count 337 transition count 315
Applied a total of 252 rules in 14 ms. Remains 337 /463 variables (removed 126) and now considering 315/441 (removed 126) transitions.
// Phase 1: matrix 315 rows 337 cols
[2024-05-24 21:51:25] [INFO ] Computed 64 invariants in 3 ms
[2024-05-24 21:51:25] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-24 21:51:25] [INFO ] Invariant cache hit.
[2024-05-24 21:51:25] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 337/2527 places, 315/2207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1223 ms. Remains : 337/2527 places, 315/2207 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-11 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s187 1) (LT s271 1)) (OR (LT s150 1) (LT s234 1)) (OR (LT s182 1) (LT s266 1)) (OR (LT s155 1) (LT s239 1)) (OR (LT s197 1) (LT s281 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1293 reset in 731 ms.
Product exploration explored 100000 steps with 1311 reset in 536 ms.
Computed a total of 337 stabilizing places and 315 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 337 transition count 315
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 33 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-11 finished in 2822 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))'
Support contains 63 out of 2527 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2527/2527 places, 2207/2207 transitions.
Graph (complete) has 3462 edges and 2527 vertex of which 105 are kept as prefixes of interest. Removing 2422 places using SCC suffix rule.1 ms
Discarding 2422 places :
Also discarding 2060 output transitions
Drop transitions removed 2060 transitions
Reduce places removed 21 places and 21 transitions.
Applied a total of 1 rules in 6 ms. Remains 84 /2527 variables (removed 2443) and now considering 126/2207 (removed 2081) transitions.
// Phase 1: matrix 126 rows 84 cols
[2024-05-24 21:51:27] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 21:51:27] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 21:51:27] [INFO ] Invariant cache hit.
[2024-05-24 21:51:27] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-24 21:51:27] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 21:51:27] [INFO ] Invariant cache hit.
[2024-05-24 21:51:27] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/2527 places, 126/2207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 84/2527 places, 126/2207 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s65 1) (GEQ s63 1) (GEQ s69 1) (GEQ s67 1) (GEQ s73 1) (GEQ s71 1) (GEQ s77 1) (GEQ s75 1) (GEQ s81 1) (GEQ s79 1) (GEQ s83 1) (GEQ s22 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 625 ms.
Product exploration explored 100000 steps with 50000 reset in 491 ms.
Computed a total of 84 stabilizing places and 126 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 126
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 p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-14 finished in 1395 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)||G(p1))))'
Support contains 189 out of 2527 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2527/2527 places, 2207/2207 transitions.
Discarding 168 places :
Implicit places reduction removed 168 places
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 2359 transition count 2207
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 231 place count 2296 transition count 2144
Iterating global reduction 1 with 63 rules applied. Total rules applied 294 place count 2296 transition count 2144
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 336 place count 2254 transition count 2102
Iterating global reduction 1 with 42 rules applied. Total rules applied 378 place count 2254 transition count 2102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 380 place count 2252 transition count 2060
Iterating global reduction 1 with 2 rules applied. Total rules applied 382 place count 2252 transition count 2060
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 403 place count 2231 transition count 2060
Applied a total of 403 rules in 544 ms. Remains 2231 /2527 variables (removed 296) and now considering 2060/2207 (removed 147) transitions.
// Phase 1: matrix 2060 rows 2231 cols
[2024-05-24 21:51:29] [INFO ] Computed 255 invariants in 37 ms
[2024-05-24 21:51:30] [INFO ] Implicit Places using invariants in 1418 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 525, 1283, 1326, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1344, 1345, 1346, 1454, 1665, 1666, 1667, 1668, 1669, 1670, 1671, 1672, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1681, 1682, 1683, 1978]
Discarding 65 places :
Implicit Place search using SMT only with invariants took 1421 ms to find 65 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2166/2527 places, 2060/2207 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2125 transition count 2019
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2125 transition count 2019
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 2105 transition count 1979
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 2105 transition count 1979
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 2085 transition count 1959
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 2085 transition count 1959
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 2065 transition count 1939
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 2065 transition count 1939
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 2045 transition count 1919
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 2045 transition count 1919
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 2025 transition count 1899
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 2025 transition count 1899
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 2005 transition count 1879
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 2005 transition count 1879
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1985 transition count 1859
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1985 transition count 1859
Applied a total of 362 rules in 1246 ms. Remains 1985 /2166 variables (removed 181) and now considering 1859/2060 (removed 201) transitions.
// Phase 1: matrix 1859 rows 1985 cols
[2024-05-24 21:51:31] [INFO ] Computed 190 invariants in 10 ms
[2024-05-24 21:51:32] [INFO ] Implicit Places using invariants in 707 ms returned []
[2024-05-24 21:51:32] [INFO ] Invariant cache hit.
[2024-05-24 21:51:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 21:51:33] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1985/2527 places, 1859/2207 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4728 ms. Remains : 1985/2527 places, 1859/2207 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s1118 1) (LT s1116 1) (LT s1114 1) (LT s1112 1) (LT s1126 1) (LT s1124 1) (LT s1122 1) (LT s1120 1) (LT s1102 1) (LT s1100 1) (LT s1098 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2009 ms.
Product exploration explored 100000 steps with 50000 reset in 1770 ms.
Computed a total of 1985 stabilizing places and 1859 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1985 transition count 1859
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 25 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLFireability-15 finished in 9354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
[2024-05-24 21:51:38] [INFO ] Flatten gal took : 137 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16271052175437862886
[2024-05-24 21:51:38] [INFO ] Too many transitions (2207) to apply POR reductions. Disabling POR matrices.
[2024-05-24 21:51:38] [INFO ] Applying decomposition
[2024-05-24 21:51:38] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16271052175437862886
Running compilation step : cd /tmp/ltsmin16271052175437862886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
[2024-05-24 21:51:38] [INFO ] Flatten gal took : 129 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18338113412442452609.txt' '-o' '/tmp/graph18338113412442452609.bin' '-w' '/tmp/graph18338113412442452609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18338113412442452609.bin' '-l' '-1' '-v' '-w' '/tmp/graph18338113412442452609.weights' '-q' '0' '-e' '0.001'
[2024-05-24 21:51:39] [INFO ] Decomposing Gal with order
[2024-05-24 21:51:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 21:51:39] [INFO ] Removed a total of 444 redundant transitions.
[2024-05-24 21:51:39] [INFO ] Flatten gal took : 192 ms
[2024-05-24 21:51:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 40 ms.
[2024-05-24 21:51:39] [INFO ] Time to serialize gal into /tmp/LTLFireability4627616319065668888.gal : 43 ms
[2024-05-24 21:51:39] [INFO ] Time to serialize properties into /tmp/LTLFireability16440795683993699592.ltl : 2 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/LTLFireability4627616319065668888.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16440795683993699592.ltl' '-c' '-stutter-deadlock'

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...277
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((i8.u264.m5_5>=1)||(i8.u290.m5_3>=1))||((i7.i0.i5.u288.m5_1>=1)||(i27.i0.i5.u303.m5_21>=1)))||(((i33.u324.m5_54>=1)||(i...3350
Formula 0 simplified : X(F!"(((((((i8.u264.m5_5>=1)||(i8.u290.m5_3>=1))||((i7.i0.i5.u288.m5_1>=1)||(i27.i0.i5.u303.m5_21>=1)))||(((i33.u324.m5_54>=1)||(i20...3342
Compilation finished in 8385 ms.
Running link step : cd /tmp/ltsmin16271052175437862886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16271052175437862886;'/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' '--ltl' 'X(([]((LTLAPp0==true))||<>((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 22:12:55] [INFO ] Applying decomposition
[2024-05-24 22:12:55] [INFO ] Flatten gal took : 163 ms
[2024-05-24 22:12:55] [INFO ] Decomposing Gal with order
[2024-05-24 22:12:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 22:12:56] [INFO ] Removed a total of 572 redundant transitions.
[2024-05-24 22:12:56] [INFO ] Flatten gal took : 434 ms
[2024-05-24 22:12:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-24 22:12:56] [INFO ] Time to serialize gal into /tmp/LTLFireability3847911854214636166.gal : 51 ms
[2024-05-24 22:12:56] [INFO ] Time to serialize properties into /tmp/LTLFireability4956572367314841523.ltl : 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/LTLFireability3847911854214636166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4956572367314841523.ltl' '-c' '-stutter-deadlock'

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...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((LegalResidentMICSystem5.m5_5>=1)||(LegalResidentMICSystem3.m5_3>=1))||((LegalResidentMICSystem1.m5_1>=1)||(LegalReside...4974
Formula 0 simplified : X(F!"(((((((LegalResidentMICSystem5.m5_5>=1)||(LegalResidentMICSystem3.m5_3>=1))||((LegalResidentMICSystem1.m5_1>=1)||(LegalResident...4966
Detected timeout of ITS tools.
[2024-05-24 22:34:12] [INFO ] Flatten gal took : 230 ms
[2024-05-24 22:34:12] [INFO ] Input system was already deterministic with 2207 transitions.
[2024-05-24 22:34:12] [INFO ] Transformed 2527 places.
[2024-05-24 22:34:12] [INFO ] Transformed 2207 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 22:34:14] [INFO ] Time to serialize gal into /tmp/LTLFireability20830943283107532.gal : 58 ms
[2024-05-24 22:34:14] [INFO ] Time to serialize properties into /tmp/LTLFireability5302481626063774631.ltl : 2 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/LTLFireability20830943283107532.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5302481626063774631.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...340
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G("(((((((m5_5>=1)||(m5_3>=1))||((m5_1>=1)||(m5_21>=1)))||(((m5_54>=1)||(m5_19>=1))||((m5_56>=1)||(m5_58>=1))))||((((m5_17>=1)||...1844
Formula 0 simplified : X(F!"(((((((m5_5>=1)||(m5_3>=1))||((m5_1>=1)||(m5_21>=1)))||(((m5_54>=1)||(m5_19>=1))||((m5_56>=1)||(m5_58>=1))))||((((m5_17>=1)||(m...1836
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6839296 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16033064 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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-L00020M0002C001P001G001"
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-L00020M0002C001P001G001, 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-171636280200248"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00020M0002C001P001G001.tgz
mv FamilyReunion-COL-L00020M0002C001P001G001 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 ;