Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 8.9K Apr 30 09:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 30 09:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 30 09:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 09:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 140K May 10 09:33 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-L00100M0010C005P005G002-LTLFireability-00
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-01
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-02
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-03
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-04
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-05
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-06
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-07
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-08
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-09
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-10
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-11
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-12
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-13
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-14
FORMULA_NAME FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652705365171

Running Version 202205111006
[2022-05-16 12:49:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 12:49:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 12:49:26] [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.
[2022-05-16 12:49:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 12:49:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 741 ms
[2022-05-16 12:49:27] [INFO ] Detected 5 constant HL places corresponding to 31 PT places.
[2022-05-16 12:49:27] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 40706 PT places and 36972.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 12:49:27] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 10 ms.
[2022-05-16 12:49:27] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-09 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 13 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 10100 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=138 ) properties (out of 29) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 66 rows 99 cols
[2022-05-16 12:49:28] [INFO ] Computed 33 place invariants in 19 ms
[2022-05-16 12:49:28] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-16 12:49:28] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-16 12:49:28] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2022-05-16 12:49:28] [INFO ] After 95ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-16 12:49:28] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-16 12:49:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 12:49:28] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-16 12:49:28] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-16 12:49:28] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-16 12:49:28] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Finished Parikh walk after 516 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=258 )
Parikh walk visited 7 properties in 316 ms.
[2022-05-16 12:49:29] [INFO ] Flatten gal took : 41 ms
[2022-05-16 12:49:29] [INFO ] Flatten gal took : 8 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 :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 6
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
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 3
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
[2022-05-16 12:49:29] [INFO ] Unfolded HLPN to a Petri net with 37039 places and 31114 transitions 89397 arcs in 172 ms.
[2022-05-16 12:49:29] [INFO ] Unfolded 14 HLPN properties in 4 ms.
[2022-05-16 12:49:29] [INFO ] Reduced 101 identical enabling conditions.
[2022-05-16 12:49:29] [INFO ] Reduced 101 identical enabling conditions.
[2022-05-16 12:49:29] [INFO ] Reduced 505 identical enabling conditions.
Deduced a syphon composed of 101 places in 165 ms
Reduce places removed 122 places and 0 transitions.
Support contains 14041 out of 36917 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36917/36917 places, 31114/31114 transitions.
Reduce places removed 329 places and 0 transitions.
Discarding 2424 places :
Implicit places reduction removed 2424 places
Iterating post reduction 0 with 2753 rules applied. Total rules applied 2753 place count 34164 transition count 31114
Applied a total of 2753 rules in 632 ms. Remains 34164 /36917 variables (removed 2753) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 34164 cols
[2022-05-16 12:49:34] [INFO ] Computed 6166 place invariants in 3380 ms
[2022-05-16 12:49:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:49:37] [INFO ] Implicit Places using invariants in 6409 ms returned []
Implicit Place search using SMT only with invariants took 6411 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 34164 cols
[2022-05-16 12:49:40] [INFO ] Computed 6166 place invariants in 3087 ms
[2022-05-16 12:49:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:49:43] [INFO ] Dead Transitions using invariants and state equation in 6102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 34164/36917 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 34164/36917 places, 31114/31114 transitions.
Support contains 14041 out of 34164 places after structural reductions.
[2022-05-16 12:49:44] [INFO ] Flatten gal took : 1210 ms
[2022-05-16 12:49:46] [INFO ] Flatten gal took : 1051 ms
[2022-05-16 12:49:49] [INFO ] Input system was already deterministic with 31114 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1192 ms. (steps per millisecond=8 ) properties (out of 29) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 31114 rows 34164 cols
[2022-05-16 12:49:54] [INFO ] Computed 6166 place invariants in 3203 ms
[2022-05-16 12:50:08] [INFO ] [Real]Absence check using 0 positive and 6166 generalized place invariants in 7345 ms returned sat
[2022-05-16 12:50:09] [INFO ] After 14831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 12:50:22] [INFO ] [Nat]Absence check using 0 positive and 6166 generalized place invariants in 7062 ms returned sat
[2022-05-16 12:50:34] [INFO ] After 9177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 12:50:34] [INFO ] After 9220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-16 12:50:34] [INFO ] After 25081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 808 out of 34164 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Graph (complete) has 48884 edges and 34164 vertex of which 34057 are kept as prefixes of interest. Removing 107 places using SCC suffix rule.56 ms
Discarding 107 places :
Also discarding 107 output transitions
Drop transitions removed 107 transitions
Discarding 4444 places :
Implicit places reduction removed 4444 places
Drop transitions removed 18281 transitions
Trivial Post-agglo rules discarded 18281 transitions
Performed 18281 trivial Post agglomeration. Transition count delta: 18281
Iterating post reduction 0 with 22725 rules applied. Total rules applied 22726 place count 29613 transition count 12726
Reduce places removed 18281 places and 0 transitions.
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Iterating post reduction 1 with 18483 rules applied. Total rules applied 41209 place count 11332 transition count 12524
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 2 with 202 rules applied. Total rules applied 41411 place count 11130 transition count 12524
Performed 2020 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2020 Pre rules applied. Total rules applied 41411 place count 11130 transition count 10504
Deduced a syphon composed of 2020 places in 9 ms
Ensure Unique test removed 909 places
Reduce places removed 2929 places and 0 transitions.
Iterating global reduction 3 with 4949 rules applied. Total rules applied 46360 place count 8201 transition count 10504
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 3 with 606 rules applied. Total rules applied 46966 place count 8201 transition count 9898
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 47572 place count 7595 transition count 9898
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 47572 place count 7595 transition count 9797
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 47774 place count 7494 transition count 9797
Discarding 3030 places :
Symmetric choice reduction at 5 with 3030 rule applications. Total rules 50804 place count 4464 transition count 6767
Iterating global reduction 5 with 3030 rules applied. Total rules applied 53834 place count 4464 transition count 6767
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 5 with 202 rules applied. Total rules applied 54036 place count 4464 transition count 6565
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 6 with 202 rules applied. Total rules applied 54238 place count 4262 transition count 6565
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 54238 place count 4262 transition count 6464
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 54440 place count 4161 transition count 6464
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 54455 place count 4146 transition count 4949
Iterating global reduction 7 with 15 rules applied. Total rules applied 54470 place count 4146 transition count 4949
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 7 with 1010 rules applied. Total rules applied 55480 place count 3843 transition count 4242
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 8 with 202 rules applied. Total rules applied 55682 place count 3641 transition count 4242
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 202 Pre rules applied. Total rules applied 55682 place count 3641 transition count 4040
Deduced a syphon composed of 202 places in 2 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 404 rules applied. Total rules applied 56086 place count 3439 transition count 4040
Discarding 1010 places :
Symmetric choice reduction at 9 with 1010 rule applications. Total rules 57096 place count 2429 transition count 3030
Iterating global reduction 9 with 1010 rules applied. Total rules applied 58106 place count 2429 transition count 3030
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 9 with 1212 rules applied. Total rules applied 59318 place count 2328 transition count 1919
Reduce places removed 101 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 10 with 202 rules applied. Total rules applied 59520 place count 2227 transition count 1818
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 11 with 101 rules applied. Total rules applied 59621 place count 2126 transition count 1818
Free-agglomeration rule (complex) applied 303 times.
Iterating global reduction 12 with 303 rules applied. Total rules applied 59924 place count 2126 transition count 1515
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 12 with 303 rules applied. Total rules applied 60227 place count 1823 transition count 1515
Applied a total of 60227 rules in 3534 ms. Remains 1823 /34164 variables (removed 32341) and now considering 1515/31114 (removed 29599) transitions.
Finished structural reductions, in 1 iterations. Remains : 1823/34164 places, 1515/31114 transitions.
Finished random walk after 433 steps, including 0 resets, run visited all 4 properties in 37 ms. (steps per millisecond=11 )
Computed a total of 34164 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 34164 transition count 31114
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 101 out of 34164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Discarding 4646 places :
Implicit places reduction removed 4646 places
Iterating post reduction 0 with 4646 rules applied. Total rules applied 4646 place count 29518 transition count 31114
Applied a total of 4646 rules in 256 ms. Remains 29518 /34164 variables (removed 4646) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:50:39] [INFO ] Computed 1520 place invariants in 1157 ms
[2022-05-16 12:50:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:50:42] [INFO ] Implicit Places using invariants in 3623 ms returned []
Implicit Place search using SMT only with invariants took 3624 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:50:43] [INFO ] Computed 1520 place invariants in 1128 ms
[2022-05-16 12:50:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:50:46] [INFO ] Dead Transitions using invariants and state equation in 3979 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29518/34164 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/34164 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s22004 1) (GEQ s21943 1) (GEQ s22000 1) (GEQ s21939 1) (GEQ s21996 1) (GEQ s21935 1) (GEQ s21992 1) (GEQ s21931 1) (GEQ s21959 1) (GEQ s22020 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 6 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-00 finished in 8232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p1)||(G(p2)&&F(G(p3))))&&p0)))'
Support contains 4040 out of 34164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Graph (complete) has 48884 edges and 34164 vertex of which 31024 are kept as prefixes of interest. Removing 3140 places using SCC suffix rule.61 ms
Discarding 3140 places :
Also discarding 2531 output transitions
Drop transitions removed 2531 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Drop transitions removed 10908 transitions
Trivial Post-agglo rules discarded 10908 transitions
Performed 10908 trivial Post agglomeration. Transition count delta: 10908
Iterating post reduction 0 with 14241 rules applied. Total rules applied 14242 place count 27590 transition count 17574
Reduce places removed 10908 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 12019 rules applied. Total rules applied 26261 place count 16682 transition count 16463
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 27372 place count 15571 transition count 16463
Performed 707 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 707 Pre rules applied. Total rules applied 27372 place count 15571 transition count 15756
Deduced a syphon composed of 707 places in 10 ms
Reduce places removed 707 places and 0 transitions.
Iterating global reduction 3 with 1414 rules applied. Total rules applied 28786 place count 14864 transition count 15756
Discarding 606 places :
Implicit places reduction removed 606 places
Performed 606 Post agglomeration using F-continuation condition.Transition count delta: 606
Iterating post reduction 3 with 1212 rules applied. Total rules applied 29998 place count 14258 transition count 15150
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 30604 place count 13652 transition count 15150
Discarding 3030 places :
Symmetric choice reduction at 5 with 3030 rule applications. Total rules 33634 place count 10622 transition count 12120
Iterating global reduction 5 with 3030 rules applied. Total rules applied 36664 place count 10622 transition count 12120
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 5 with 202 rules applied. Total rules applied 36866 place count 10622 transition count 11918
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 6 with 202 rules applied. Total rules applied 37068 place count 10420 transition count 11918
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 37068 place count 10420 transition count 11817
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 37270 place count 10319 transition count 11817
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 37285 place count 10304 transition count 10302
Iterating global reduction 7 with 15 rules applied. Total rules applied 37300 place count 10304 transition count 10302
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 7 with 303 rules applied. Total rules applied 37603 place count 10102 transition count 10201
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 8 with 101 rules applied. Total rules applied 37704 place count 10001 transition count 10201
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 202 Pre rules applied. Total rules applied 37704 place count 10001 transition count 9999
Deduced a syphon composed of 202 places in 4 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 404 rules applied. Total rules applied 38108 place count 9799 transition count 9999
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 38310 place count 9698 transition count 9898
Applied a total of 38310 rules in 6666 ms. Remains 9698 /34164 variables (removed 24466) and now considering 9898/31114 (removed 21216) transitions.
// Phase 1: matrix 9898 rows 9698 cols
[2022-05-16 12:50:53] [INFO ] Computed 1315 place invariants in 280 ms
[2022-05-16 12:50:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:50:54] [INFO ] Implicit Places using invariants in 1284 ms returned []
// Phase 1: matrix 9898 rows 9698 cols
[2022-05-16 12:50:54] [INFO ] Computed 1315 place invariants in 289 ms
[2022-05-16 12:50:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:50:55] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 2597 ms to find 0 implicit places.
[2022-05-16 12:50:57] [INFO ] Redundant transitions in 1285 ms returned []
// Phase 1: matrix 9898 rows 9698 cols
[2022-05-16 12:50:57] [INFO ] Computed 1315 place invariants in 279 ms
[2022-05-16 12:50:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:50:58] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9698/34164 places, 9898/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 9698/34164 places, 9898/31114 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=0 dest: 3}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 5}], [{ cond=(OR (AND (NOT p0) p3) (AND (NOT p1) p3)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 p3), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p3)), acceptance={1} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 p3), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s4561 1) (LT s5672 1)) (OR (LT s3959 1) (LT s5070 1)) (OR (LT s4551 1) (LT s5662 1)) (OR (LT s3989 1) (LT s5100 1)) (OR (LT s4581 1) (LT s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1313 steps with 0 reset in 196 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-01 finished in 12438 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))&&X(F(p1)))))'
Support contains 202 out of 34164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Discarding 4646 places :
Implicit places reduction removed 4646 places
Iterating post reduction 0 with 4646 rules applied. Total rules applied 4646 place count 29518 transition count 31114
Applied a total of 4646 rules in 284 ms. Remains 29518 /34164 variables (removed 4646) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:51:00] [INFO ] Computed 1520 place invariants in 1166 ms
[2022-05-16 12:51:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:51:03] [INFO ] Implicit Places using invariants in 3838 ms returned []
Implicit Place search using SMT only with invariants took 3839 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:51:04] [INFO ] Computed 1520 place invariants in 1115 ms
[2022-05-16 12:51:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:51:06] [INFO ] Dead Transitions using invariants and state equation in 3617 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29518/34164 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/34164 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(OR (GEQ s17864 1) (GEQ s17799 1) (GEQ s17868 1) (GEQ s17803 1) (GEQ s17856 1) (GEQ s17791 1) (GEQ s17860 1) (GEQ s17795 1) (GEQ s17815 1) (GEQ s17819 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-02 finished in 8078 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(F((X(p1)||X(F(p2)))))&&p0)))))'
Support contains 1314 out of 34164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Discarding 4646 places :
Implicit places reduction removed 4646 places
Iterating post reduction 0 with 4646 rules applied. Total rules applied 4646 place count 29518 transition count 31114
Applied a total of 4646 rules in 345 ms. Remains 29518 /34164 variables (removed 4646) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:51:08] [INFO ] Computed 1520 place invariants in 1095 ms
[2022-05-16 12:51:10] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:51:11] [INFO ] Implicit Places using invariants in 3599 ms returned []
Implicit Place search using SMT only with invariants took 3606 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:51:12] [INFO ] Computed 1520 place invariants in 1107 ms
[2022-05-16 12:51:14] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:51:14] [INFO ] Dead Transitions using invariants and state equation in 3644 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29518/34164 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/34164 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s11458 1) (LT s11515 1)) (OR (LT s11487 1) (LT s11515 1)) (OR (LT s11438 1) (LT s11515 1)) (OR (LT s11507 1) (LT s11515 1)) (OR (LT s11467...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 57499 steps with 14 reset in 2025 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-03 finished in 9924 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (p0 U p1))))'
Support contains 4444 out of 34164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Discarding 2424 places :
Implicit places reduction removed 2424 places
Iterating post reduction 0 with 2424 rules applied. Total rules applied 2424 place count 31740 transition count 31114
Applied a total of 2424 rules in 286 ms. Remains 31740 /34164 variables (removed 2424) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 31740 cols
[2022-05-16 12:51:19] [INFO ] Computed 3742 place invariants in 1990 ms
[2022-05-16 12:51:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:51:22] [INFO ] Implicit Places using invariants in 4660 ms returned []
Implicit Place search using SMT only with invariants took 4665 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 31740 cols
[2022-05-16 12:51:24] [INFO ] Computed 3742 place invariants in 1969 ms
[2022-05-16 12:51:26] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:51:26] [INFO ] Dead Transitions using invariants and state equation in 4611 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31740/34164 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 31740/34164 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s17749 1) (GEQ s18860 1)) (AND (GEQ s18341 1) (GEQ s19452 1)) (AND (GEQ s18351 1) (GEQ s19462 1)) (AND (GEQ s17739 1) (GEQ s18850 1)) (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-04 finished in 9870 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 101 out of 34164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Graph (complete) has 48884 edges and 34164 vertex of which 31024 are kept as prefixes of interest. Removing 3140 places using SCC suffix rule.55 ms
Discarding 3140 places :
Also discarding 2531 output transitions
Drop transitions removed 2531 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 4444 places :
Implicit places reduction removed 4444 places
Drop transitions removed 18180 transitions
Trivial Post-agglo rules discarded 18180 transitions
Performed 18180 trivial Post agglomeration. Transition count delta: 18180
Iterating post reduction 0 with 22624 rules applied. Total rules applied 22625 place count 26479 transition count 10302
Reduce places removed 18180 places and 0 transitions.
Iterating post reduction 1 with 18180 rules applied. Total rules applied 40805 place count 8299 transition count 10302
Performed 1313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1313 Pre rules applied. Total rules applied 40805 place count 8299 transition count 8989
Deduced a syphon composed of 1313 places in 3 ms
Ensure Unique test removed 606 places
Reduce places removed 1919 places and 0 transitions.
Iterating global reduction 2 with 3232 rules applied. Total rules applied 44037 place count 6380 transition count 8989
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 2 with 606 rules applied. Total rules applied 44643 place count 6380 transition count 8383
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 3 with 606 rules applied. Total rules applied 45249 place count 5774 transition count 8383
Discarding 3030 places :
Symmetric choice reduction at 4 with 3030 rule applications. Total rules 48279 place count 2744 transition count 5353
Iterating global reduction 4 with 3030 rules applied. Total rules applied 51309 place count 2744 transition count 5353
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 4 with 202 rules applied. Total rules applied 51511 place count 2744 transition count 5151
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 5 with 202 rules applied. Total rules applied 51713 place count 2542 transition count 5151
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 101 Pre rules applied. Total rules applied 51713 place count 2542 transition count 5050
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 51915 place count 2441 transition count 5050
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 51930 place count 2426 transition count 3535
Iterating global reduction 6 with 15 rules applied. Total rules applied 51945 place count 2426 transition count 3535
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 6 with 1010 rules applied. Total rules applied 52955 place count 2123 transition count 2828
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 7 with 202 rules applied. Total rules applied 53157 place count 1921 transition count 2828
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 53157 place count 1921 transition count 2626
Deduced a syphon composed of 202 places in 1 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 53561 place count 1719 transition count 2626
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 54571 place count 709 transition count 1616
Iterating global reduction 8 with 1010 rules applied. Total rules applied 55581 place count 709 transition count 1616
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 8 with 1010 rules applied. Total rules applied 56591 place count 709 transition count 606
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 56591 place count 709 transition count 505
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 303 rules applied. Total rules applied 56894 place count 507 transition count 505
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 9 with 101 rules applied. Total rules applied 56995 place count 406 transition count 404
Applied a total of 56995 rules in 1594 ms. Remains 406 /34164 variables (removed 33758) and now considering 404/31114 (removed 30710) transitions.
// Phase 1: matrix 404 rows 406 cols
[2022-05-16 12:51:28] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 12:51:28] [INFO ] Implicit Places using invariants in 245 ms returned [101, 203]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 247 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/34164 places, 404/31114 transitions.
Reduce places removed 101 places and 101 transitions.
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 101 Pre rules applied. Total rules applied 0 place count 303 transition count 202
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 202 transition count 202
Applied a total of 202 rules in 23 ms. Remains 202 /404 variables (removed 202) and now considering 202/404 (removed 202) transitions.
// Phase 1: matrix 202 rows 202 cols
[2022-05-16 12:51:28] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 12:51:28] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 202 rows 202 cols
[2022-05-16 12:51:28] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 12:51:28] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 202/34164 places, 202/31114 transitions.
Finished structural reductions, in 2 iterations. Remains : 202/34164 places, 202/31114 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s135 1) (GEQ s200 1) (GEQ s139 1) (GEQ s127 1) (GEQ s192 1) (GEQ s131 1) (GEQ s196 1) (GEQ s119 1) (GEQ s184 1) (GEQ s123 1) (GEQ s188 1) (GEQ...], 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 731 ms.
Product exploration explored 100000 steps with 50000 reset in 791 ms.
Computed a total of 202 stabilizing places and 202 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 202 transition count 202
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 :(X p0)
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-06 finished in 3763 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&G(X(p1))))||G(p2)))'
Support contains 202 out of 34164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Graph (complete) has 48884 edges and 34164 vertex of which 33552 are kept as prefixes of interest. Removing 612 places using SCC suffix rule.36 ms
Discarding 612 places :
Also discarding 511 output transitions
Drop transitions removed 511 transitions
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Discarding 4646 places :
Implicit places reduction removed 4646 places
Drop transitions removed 18887 transitions
Trivial Post-agglo rules discarded 18887 transitions
Performed 18887 trivial Post agglomeration. Transition count delta: 18887
Iterating post reduction 0 with 23634 rules applied. Total rules applied 23635 place count 28906 transition count 11615
Reduce places removed 18887 places and 0 transitions.
Iterating post reduction 1 with 18887 rules applied. Total rules applied 42522 place count 10019 transition count 11615
Performed 2020 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2020 Pre rules applied. Total rules applied 42522 place count 10019 transition count 9595
Deduced a syphon composed of 2020 places in 4 ms
Ensure Unique test removed 909 places
Reduce places removed 2929 places and 0 transitions.
Iterating global reduction 2 with 4949 rules applied. Total rules applied 47471 place count 7090 transition count 9595
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 2 with 707 rules applied. Total rules applied 48178 place count 7090 transition count 8888
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 3 with 707 rules applied. Total rules applied 48885 place count 6383 transition count 8888
Discarding 3030 places :
Symmetric choice reduction at 4 with 3030 rule applications. Total rules 51915 place count 3353 transition count 5858
Iterating global reduction 4 with 3030 rules applied. Total rules applied 54945 place count 3353 transition count 5858
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 4 with 303 rules applied. Total rules applied 55248 place count 3353 transition count 5555
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 5 with 303 rules applied. Total rules applied 55551 place count 3050 transition count 5555
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 55566 place count 3035 transition count 4040
Iterating global reduction 6 with 15 rules applied. Total rules applied 55581 place count 3035 transition count 4040
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 6 with 1111 rules applied. Total rules applied 56692 place count 2732 transition count 3232
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 7 with 303 rules applied. Total rules applied 56995 place count 2429 transition count 3232
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 56995 place count 2429 transition count 3030
Deduced a syphon composed of 202 places in 1 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 57399 place count 2227 transition count 3030
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 58409 place count 1217 transition count 2020
Iterating global reduction 8 with 1010 rules applied. Total rules applied 59419 place count 1217 transition count 2020
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 8 with 1212 rules applied. Total rules applied 60631 place count 1116 transition count 909
Reduce places removed 101 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 9 with 202 rules applied. Total rules applied 60833 place count 1015 transition count 808
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 10 with 101 rules applied. Total rules applied 60934 place count 914 transition count 808
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 11 with 202 rules applied. Total rules applied 61136 place count 813 transition count 707
Applied a total of 61136 rules in 1880 ms. Remains 813 /34164 variables (removed 33351) and now considering 707/31114 (removed 30407) transitions.
// Phase 1: matrix 707 rows 813 cols
[2022-05-16 12:51:32] [INFO ] Computed 106 place invariants in 17 ms
[2022-05-16 12:51:33] [INFO ] Implicit Places using invariants in 495 ms returned [202, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 507, 710, 812]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 497 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 708/34164 places, 707/31114 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 708 transition count 505
Reduce places removed 202 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 1 with 303 rules applied. Total rules applied 505 place count 506 transition count 404
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 606 place count 405 transition count 404
Applied a total of 606 rules in 9 ms. Remains 405 /708 variables (removed 303) and now considering 404/707 (removed 303) transitions.
// Phase 1: matrix 404 rows 405 cols
[2022-05-16 12:51:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 12:51:33] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 404 rows 405 cols
[2022-05-16 12:51:33] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 12:51:33] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 405/34164 places, 404/31114 transitions.
Finished structural reductions, in 2 iterations. Remains : 405/34164 places, 404/31114 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={1} source=1 dest: 2}, { cond=p0, acceptance={0, 1} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(OR (GEQ s368 1) (GEQ s364 1) (GEQ s311 1) (GEQ s376 1) (GEQ s307 1) (GEQ s372 1) (GEQ s319 1) (GEQ s384 1) (GEQ s315 1) (GEQ s380 1) (GEQ s327 1) (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-07 finished in 2906 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X((X(G(p0))&&p1))))'
Support contains 202 out of 34164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Discarding 4646 places :
Implicit places reduction removed 4646 places
Iterating post reduction 0 with 4646 rules applied. Total rules applied 4646 place count 29518 transition count 31114
Applied a total of 4646 rules in 259 ms. Remains 29518 /34164 variables (removed 4646) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:51:35] [INFO ] Computed 1520 place invariants in 1133 ms
[2022-05-16 12:51:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:51:37] [INFO ] Implicit Places using invariants in 3655 ms returned []
Implicit Place search using SMT only with invariants took 3662 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:51:38] [INFO ] Computed 1520 place invariants in 1105 ms
[2022-05-16 12:51:41] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:51:41] [INFO ] Dead Transitions using invariants and state equation in 3583 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29518/34164 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/34164 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, 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: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GEQ s22569 1) (GEQ s22634 1) (GEQ s22573 1) (GEQ s22561 1) (GEQ s22626 1) (GEQ s22565 1) (GEQ s22630 1) (GEQ s22553 1) (GEQ s22618 1) (GEQ s22557 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-08 finished in 7795 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 203 out of 34164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Graph (complete) has 48884 edges and 34164 vertex of which 33046 are kept as prefixes of interest. Removing 1118 places using SCC suffix rule.36 ms
Discarding 1118 places :
Also discarding 1016 output transitions
Drop transitions removed 1016 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 4545 places :
Implicit places reduction removed 4545 places
Drop transitions removed 18483 transitions
Trivial Post-agglo rules discarded 18483 transitions
Performed 18483 trivial Post agglomeration. Transition count delta: 18483
Iterating post reduction 0 with 23028 rules applied. Total rules applied 23029 place count 28400 transition count 11514
Reduce places removed 18483 places and 0 transitions.
Iterating post reduction 1 with 18483 rules applied. Total rules applied 41512 place count 9917 transition count 11514
Performed 2121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2121 Pre rules applied. Total rules applied 41512 place count 9917 transition count 9393
Deduced a syphon composed of 2121 places in 4 ms
Ensure Unique test removed 909 places
Reduce places removed 3030 places and 0 transitions.
Iterating global reduction 2 with 5151 rules applied. Total rules applied 46663 place count 6887 transition count 9393
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 2 with 606 rules applied. Total rules applied 47269 place count 6887 transition count 8787
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 3 with 606 rules applied. Total rules applied 47875 place count 6281 transition count 8787
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 47875 place count 6281 transition count 8686
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 48077 place count 6180 transition count 8686
Discarding 3030 places :
Symmetric choice reduction at 4 with 3030 rule applications. Total rules 51107 place count 3150 transition count 5656
Iterating global reduction 4 with 3030 rules applied. Total rules applied 54137 place count 3150 transition count 5656
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 4 with 202 rules applied. Total rules applied 54339 place count 3150 transition count 5454
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 5 with 202 rules applied. Total rules applied 54541 place count 2948 transition count 5454
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 101 Pre rules applied. Total rules applied 54541 place count 2948 transition count 5353
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 54743 place count 2847 transition count 5353
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 54758 place count 2832 transition count 3838
Iterating global reduction 6 with 15 rules applied. Total rules applied 54773 place count 2832 transition count 3838
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 6 with 1010 rules applied. Total rules applied 55783 place count 2529 transition count 3131
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 7 with 202 rules applied. Total rules applied 55985 place count 2327 transition count 3131
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 55985 place count 2327 transition count 2929
Deduced a syphon composed of 202 places in 0 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 56389 place count 2125 transition count 2929
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 57399 place count 1115 transition count 1919
Iterating global reduction 8 with 1010 rules applied. Total rules applied 58409 place count 1115 transition count 1919
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 8 with 1010 rules applied. Total rules applied 59419 place count 1115 transition count 909
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 59419 place count 1115 transition count 808
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 303 rules applied. Total rules applied 59722 place count 913 transition count 808
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 9 with 101 rules applied. Total rules applied 59823 place count 812 transition count 707
Applied a total of 59823 rules in 1984 ms. Remains 812 /34164 variables (removed 33352) and now considering 707/31114 (removed 30407) transitions.
// Phase 1: matrix 707 rows 812 cols
[2022-05-16 12:51:43] [INFO ] Computed 105 place invariants in 7 ms
[2022-05-16 12:51:43] [INFO ] Implicit Places using invariants in 442 ms returned [304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 608, 710]
Discarding 103 places :
Implicit Place search using SMT only with invariants took 446 ms to find 103 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 709/34164 places, 707/31114 transitions.
Reduce places removed 101 places and 101 transitions.
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 101 Pre rules applied. Total rules applied 0 place count 608 transition count 505
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 507 transition count 505
Applied a total of 202 rules in 10 ms. Remains 507 /709 variables (removed 202) and now considering 505/707 (removed 202) transitions.
// Phase 1: matrix 505 rows 507 cols
[2022-05-16 12:51:43] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 12:51:43] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 505 rows 507 cols
[2022-05-16 12:51:44] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 12:51:44] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 507/34164 places, 505/31114 transitions.
Finished structural reductions, in 2 iterations. Remains : 507/34164 places, 505/31114 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-10 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:(OR (GEQ s359 1) (GEQ s355 1) (GEQ s351 1) (GEQ s347 1) (GEQ s343 1) (GEQ s339 1) (GEQ s404 1) (GEQ s335 1) (GEQ s400 1) (GEQ s331 1) (GEQ s396 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 309 steps with 0 reset in 8 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-10 finished in 3105 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X(G(X(p0)))&&F(p1))))))'
Support contains 505 out of 34164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Graph (complete) has 48884 edges and 34164 vertex of which 33248 are kept as prefixes of interest. Removing 916 places using SCC suffix rule.68 ms
Discarding 916 places :
Also discarding 915 output transitions
Drop transitions removed 915 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 4444 places :
Implicit places reduction removed 4444 places
Drop transitions removed 17574 transitions
Trivial Post-agglo rules discarded 17574 transitions
Performed 17574 trivial Post agglomeration. Transition count delta: 17574
Iterating post reduction 0 with 22018 rules applied. Total rules applied 22019 place count 28703 transition count 12524
Reduce places removed 17574 places and 0 transitions.
Performed 707 Post agglomeration using F-continuation condition.Transition count delta: 707
Iterating post reduction 1 with 18281 rules applied. Total rules applied 40300 place count 11129 transition count 11817
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 2 with 707 rules applied. Total rules applied 41007 place count 10422 transition count 11817
Performed 2121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2121 Pre rules applied. Total rules applied 41007 place count 10422 transition count 9696
Deduced a syphon composed of 2121 places in 4 ms
Ensure Unique test removed 909 places
Reduce places removed 3030 places and 0 transitions.
Iterating global reduction 3 with 5151 rules applied. Total rules applied 46158 place count 7392 transition count 9696
Performed 606 Post agglomeration using F-continuation condition.Transition count delta: 606
Iterating post reduction 3 with 606 rules applied. Total rules applied 46764 place count 7392 transition count 9090
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 47370 place count 6786 transition count 9090
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 47370 place count 6786 transition count 8989
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 47572 place count 6685 transition count 8989
Discarding 3030 places :
Symmetric choice reduction at 5 with 3030 rule applications. Total rules 50602 place count 3655 transition count 5959
Iterating global reduction 5 with 3030 rules applied. Total rules applied 53632 place count 3655 transition count 5959
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 5 with 101 rules applied. Total rules applied 53733 place count 3655 transition count 5858
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 6 with 101 rules applied. Total rules applied 53834 place count 3554 transition count 5858
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 202 Pre rules applied. Total rules applied 53834 place count 3554 transition count 5656
Deduced a syphon composed of 202 places in 2 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 7 with 404 rules applied. Total rules applied 54238 place count 3352 transition count 5656
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 54253 place count 3337 transition count 4141
Iterating global reduction 7 with 15 rules applied. Total rules applied 54268 place count 3337 transition count 4141
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Iterating post reduction 7 with 808 rules applied. Total rules applied 55076 place count 3034 transition count 3636
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 55076 place count 3034 transition count 3434
Deduced a syphon composed of 202 places in 1 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 55480 place count 2832 transition count 3434
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 56490 place count 1822 transition count 2424
Iterating global reduction 8 with 1010 rules applied. Total rules applied 57500 place count 1822 transition count 2424
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 8 with 1010 rules applied. Total rules applied 58510 place count 1822 transition count 1414
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 58510 place count 1822 transition count 1313
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 303 rules applied. Total rules applied 58813 place count 1620 transition count 1313
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 9 with 101 rules applied. Total rules applied 58914 place count 1519 transition count 1212
Applied a total of 58914 rules in 2761 ms. Remains 1519 /34164 variables (removed 32645) and now considering 1212/31114 (removed 29902) transitions.
// Phase 1: matrix 1212 rows 1519 cols
[2022-05-16 12:51:47] [INFO ] Computed 307 place invariants in 19 ms
[2022-05-16 12:51:47] [INFO ] Implicit Places using invariants in 578 ms returned [404, 1113, 1417]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 579 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1516/34164 places, 1212/31114 transitions.
Reduce places removed 101 places and 101 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1415 transition count 1010
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 1314 transition count 1010
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 1314 transition count 909
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 1213 transition count 909
Applied a total of 404 rules in 51 ms. Remains 1213 /1516 variables (removed 303) and now considering 909/1212 (removed 303) transitions.
// Phase 1: matrix 909 rows 1213 cols
[2022-05-16 12:51:47] [INFO ] Computed 304 place invariants in 7 ms
[2022-05-16 12:51:48] [INFO ] Implicit Places using invariants in 344 ms returned [303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 346 ms to find 101 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1112/34164 places, 909/31114 transitions.
Applied a total of 0 rules in 17 ms. Remains 1112 /1112 variables (removed 0) and now considering 909/909 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 1112/34164 places, 909/31114 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s1000 1) (GEQ s939 1) (GEQ s996 1) (GEQ s935 1) (GEQ s992 1) (GEQ s931 1) (GEQ s988 1) (GEQ s927 1) (GEQ s984 1) (GEQ s923 1) (GEQ s980 1) (GE...], 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 341 reset in 2481 ms.
Product exploration explored 100000 steps with 340 reset in 2487 ms.
Computed a total of 1112 stabilizing places and 909 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1112 transition count 909
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 p1), (X p0), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 310 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), (X p1), (X p0), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 6 factoid took 286 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 909 rows 1112 cols
[2022-05-16 12:51:54] [INFO ] Computed 203 place invariants in 7 ms
[2022-05-16 12:51:55] [INFO ] [Real]Absence check using 0 positive and 203 generalized place invariants in 131 ms returned sat
[2022-05-16 12:51:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:51:56] [INFO ] [Real]Absence check using state equation in 994 ms returned sat
[2022-05-16 12:51:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:51:57] [INFO ] [Nat]Absence check using 0 positive and 203 generalized place invariants in 144 ms returned sat
[2022-05-16 12:51:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:51:58] [INFO ] [Nat]Absence check using state equation in 1098 ms returned sat
[2022-05-16 12:51:58] [INFO ] Computed and/alt/rep : 808/1010/808 causal constraints (skipped 0 transitions) in 44 ms.
[2022-05-16 12:52:02] [INFO ] Added : 374 causal constraints over 75 iterations in 4481 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 101 out of 1112 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 : 1112/1112 places, 909/909 transitions.
Applied a total of 0 rules in 13 ms. Remains 1112 /1112 variables (removed 0) and now considering 909/909 (removed 0) transitions.
// Phase 1: matrix 909 rows 1112 cols
[2022-05-16 12:52:02] [INFO ] Computed 203 place invariants in 8 ms
[2022-05-16 12:52:03] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 909 rows 1112 cols
[2022-05-16 12:52:03] [INFO ] Computed 203 place invariants in 10 ms
[2022-05-16 12:52:03] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2022-05-16 12:52:03] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 909 rows 1112 cols
[2022-05-16 12:52:03] [INFO ] Computed 203 place invariants in 10 ms
[2022-05-16 12:52:04] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1112/1112 places, 909/909 transitions.
Computed a total of 1112 stabilizing places and 909 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1112 transition count 909
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 p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), (X p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 909 rows 1112 cols
[2022-05-16 12:52:04] [INFO ] Computed 203 place invariants in 11 ms
[2022-05-16 12:52:05] [INFO ] [Real]Absence check using 0 positive and 203 generalized place invariants in 112 ms returned sat
[2022-05-16 12:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:52:06] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2022-05-16 12:52:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 12:52:07] [INFO ] [Nat]Absence check using 0 positive and 203 generalized place invariants in 162 ms returned sat
[2022-05-16 12:52:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 12:52:08] [INFO ] [Nat]Absence check using state equation in 1307 ms returned sat
[2022-05-16 12:52:08] [INFO ] Computed and/alt/rep : 808/1010/808 causal constraints (skipped 0 transitions) in 46 ms.
[2022-05-16 12:52:13] [INFO ] Added : 374 causal constraints over 75 iterations in 4592 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 1178 steps with 1 reset in 11 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-11 finished in 28897 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(!(X((p0 U p1)) U p2))))'
Support contains 1111 out of 34164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Discarding 3535 places :
Implicit places reduction removed 3535 places
Iterating post reduction 0 with 3535 rules applied. Total rules applied 3535 place count 30629 transition count 31114
Applied a total of 3535 rules in 331 ms. Remains 30629 /34164 variables (removed 3535) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 30629 cols
[2022-05-16 12:52:15] [INFO ] Computed 2631 place invariants in 1465 ms
[2022-05-16 12:52:17] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:52:17] [INFO ] Implicit Places using invariants in 4147 ms returned []
Implicit Place search using SMT only with invariants took 4148 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 30629 cols
[2022-05-16 12:52:19] [INFO ] Computed 2631 place invariants in 1497 ms
[2022-05-16 12:52:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:52:22] [INFO ] Dead Transitions using invariants and state equation in 4422 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30629/34164 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 30629/34164 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, p2, p2]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(OR (GEQ s11128 1) (GEQ s10998 1) (GEQ s10478 1) (GEQ s10348 1) (GEQ s11388 1) (GEQ s11258 1) (GEQ s10689 1) (GEQ s10819 1) (GEQ s11047 1) (GEQ s10917 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 361 steps with 0 reset in 32 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-12 finished in 9210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((G(F(X(p1)))||p0) U p2)))'
Support contains 707 out of 34164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Discarding 4646 places :
Implicit places reduction removed 4646 places
Iterating post reduction 0 with 4646 rules applied. Total rules applied 4646 place count 29518 transition count 31114
Applied a total of 4646 rules in 279 ms. Remains 29518 /34164 variables (removed 4646) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:52:24] [INFO ] Computed 1520 place invariants in 1130 ms
[2022-05-16 12:52:26] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:52:26] [INFO ] Implicit Places using invariants in 3773 ms returned []
Implicit Place search using SMT only with invariants took 3774 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:52:27] [INFO ] Computed 1520 place invariants in 1152 ms
[2022-05-16 12:52:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:52:30] [INFO ] Dead Transitions using invariants and state equation in 3742 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29518/34164 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/34164 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 179 ms :[p2, p2, true, (AND p2 p1), p1]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s24635 1) (GEQ s24196 1) (GEQ s24586 1) (GEQ s24131 1) (GEQ s24521 1) (GEQ s24456 1) (GEQ s24391 1) (GEQ s24326 1) (GEQ s24261 1) (GEQ s24619 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 17 reset in 4141 ms.
Product exploration explored 100000 steps with 17 reset in 4075 ms.
Computed a total of 29518 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29518 transition count 31114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 11 factoid took 537 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-13 finished in 49940 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 101 out of 34164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Discarding 4646 places :
Implicit places reduction removed 4646 places
Iterating post reduction 0 with 4646 rules applied. Total rules applied 4646 place count 29518 transition count 31114
Applied a total of 4646 rules in 305 ms. Remains 29518 /34164 variables (removed 4646) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:53:14] [INFO ] Computed 1520 place invariants in 1162 ms
[2022-05-16 12:53:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:53:16] [INFO ] Implicit Places using invariants in 3678 ms returned []
Implicit Place search using SMT only with invariants took 3681 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:53:17] [INFO ] Computed 1520 place invariants in 1136 ms
[2022-05-16 12:53:20] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:53:20] [INFO ] Dead Transitions using invariants and state equation in 3632 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29518/34164 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/34164 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s131 1) (GEQ s192 1) (GEQ s135 1) (GEQ s196 1) (GEQ s139 1) (GEQ s200 1) (GEQ s143 1) (GEQ s147 1) (GEQ s151 1) (GEQ s155 1) (GEQ s159 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 79 reset in 2622 ms.
Product exploration explored 100000 steps with 78 reset in 2779 ms.
Computed a total of 29518 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29518 transition count 31114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 301 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1372 steps, including 0 resets, run visited all 1 properties in 33 ms. (steps per millisecond=41 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:54:03] [INFO ] Computed 1520 place invariants in 1210 ms
Could not prove EG (NOT p0)
Support contains 101 out of 29518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29518/29518 places, 31114/31114 transitions.
Applied a total of 0 rules in 130 ms. Remains 29518 /29518 variables (removed 0) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:54:19] [INFO ] Computed 1520 place invariants in 1128 ms
[2022-05-16 12:54:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:54:22] [INFO ] Implicit Places using invariants in 3640 ms returned []
Implicit Place search using SMT only with invariants took 3646 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:54:23] [INFO ] Computed 1520 place invariants in 1107 ms
[2022-05-16 12:54:25] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:54:25] [INFO ] Dead Transitions using invariants and state equation in 3599 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/29518 places, 31114/31114 transitions.
Computed a total of 29518 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29518 transition count 31114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1231 steps, including 0 resets, run visited all 1 properties in 30 ms. (steps per millisecond=41 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:55:02] [INFO ] Computed 1520 place invariants in 1250 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 78 reset in 2338 ms.
Product exploration explored 100000 steps with 77 reset in 2368 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 101 out of 29518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29518/29518 places, 31114/31114 transitions.
Graph (complete) has 39592 edges and 29518 vertex of which 19807 are kept as prefixes of interest. Removing 9711 places using SCC suffix rule.27 ms
Discarding 9711 places :
Also discarding 9500 output transitions
Drop transitions removed 9500 transitions
Performed 8989 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8989 rules applied. Total rules applied 8990 place count 19807 transition count 21614
Performed 5656 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5656 Pre rules applied. Total rules applied 8990 place count 19807 transition count 21614
Deduced a syphon composed of 14645 places in 10 ms
Iterating global reduction 1 with 5656 rules applied. Total rules applied 14646 place count 19807 transition count 21614
Performed 2323 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 16968 places in 10 ms
Iterating global reduction 1 with 2323 rules applied. Total rules applied 16969 place count 19807 transition count 22624
Deduced a syphon composed of 16968 places in 10 ms
Applied a total of 16969 rules in 9196 ms. Remains 19807 /29518 variables (removed 9711) and now considering 22624/31114 (removed 8490) transitions.
// Phase 1: matrix 22624 rows 19807 cols
[2022-05-16 12:55:35] [INFO ] Computed 203 place invariants in 3902 ms
[2022-05-16 12:55:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:55:37] [INFO ] Dead Transitions using invariants and state equation in 5646 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19807/29518 places, 22624/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 19807/29518 places, 22624/31114 transitions.
Product exploration explored 100000 steps with 564 reset in 5654 ms.
Product exploration explored 100000 steps with 565 reset in 5706 ms.
Built C files in :
/tmp/ltsmin4650336429349264002
[2022-05-16 12:55:49] [INFO ] Built C files in 307ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4650336429349264002
Running compilation step : cd /tmp/ltsmin4650336429349264002;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4650336429349264002;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4650336429349264002;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 101 out of 29518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29518/29518 places, 31114/31114 transitions.
Applied a total of 0 rules in 141 ms. Remains 29518 /29518 variables (removed 0) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:55:53] [INFO ] Computed 1520 place invariants in 1303 ms
[2022-05-16 12:55:56] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:55:56] [INFO ] Implicit Places using invariants in 3934 ms returned []
Implicit Place search using SMT only with invariants took 3935 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 12:55:57] [INFO ] Computed 1520 place invariants in 1182 ms
[2022-05-16 12:56:00] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:56:00] [INFO ] Dead Transitions using invariants and state equation in 3954 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/29518 places, 31114/31114 transitions.
Built C files in :
/tmp/ltsmin18330421446757577253
[2022-05-16 12:56:00] [INFO ] Built C files in 251ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18330421446757577253
Running compilation step : cd /tmp/ltsmin18330421446757577253;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18330421446757577253;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18330421446757577253;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 12:56:05] [INFO ] Flatten gal took : 902 ms
[2022-05-16 12:56:06] [INFO ] Flatten gal took : 942 ms
[2022-05-16 12:56:06] [INFO ] Time to serialize gal into /tmp/LTL6575030527813596439.gal : 175 ms
[2022-05-16 12:56:06] [INFO ] Time to serialize properties into /tmp/LTL1747548556919590813.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6575030527813596439.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1747548556919590813.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6575030...266
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((((((((l12_30>=1)||(l12_91>=1))||((l12_34>=1)||(l12_95>=1)))||(((l12_38>=1)||(l12_99>=1))||((l12_42>=1)||(l12_46>=1))))||((...1539
Formula 0 simplified : !XXF"((((((((l12_30>=1)||(l12_91>=1))||((l12_34>=1)||(l12_95>=1)))||(((l12_38>=1)||(l12_99>=1))||((l12_42>=1)||(l12_46>=1))))||((((l...1531
Detected timeout of ITS tools.
[2022-05-16 12:56:22] [INFO ] Flatten gal took : 830 ms
[2022-05-16 12:56:22] [INFO ] Applying decomposition
[2022-05-16 12:56:23] [INFO ] Flatten gal took : 875 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17724195289263395116.txt' '-o' '/tmp/graph17724195289263395116.bin' '-w' '/tmp/graph17724195289263395116.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17724195289263395116.bin' '-l' '-1' '-v' '-w' '/tmp/graph17724195289263395116.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:56:26] [INFO ] Decomposing Gal with order
[2022-05-16 12:56:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 13:01:42] [INFO ] Removed a total of 9218 redundant transitions.
[2022-05-16 13:01:43] [INFO ] Flatten gal took : 1886 ms
[2022-05-16 13:01:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 604 labels/synchronizations in 276 ms.
[2022-05-16 13:01:45] [INFO ] Time to serialize gal into /tmp/LTL16686675981158149670.gal : 321 ms
[2022-05-16 13:01:45] [INFO ] Time to serialize properties into /tmp/LTL16965382252216120324.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16686675981158149670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16965382252216120324.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1668667...247
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((((((((i92.i11.i1.u8767.l12_30>=1)||(i82.i9.i1.u8813.l12_91>=1))||((i37.i10.i1.u8771.l12_34>=1)||(i96.i10.i1.u8816.l12_95>=...3135
Formula 0 simplified : !XXF"((((((((i92.i11.i1.u8767.l12_30>=1)||(i82.i9.i1.u8813.l12_91>=1))||((i37.i10.i1.u8771.l12_34>=1)||(i96.i10.i1.u8816.l12_95>=1))...3127
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10664616820212549741
[2022-05-16 13:02:00] [INFO ] Built C files in 225ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10664616820212549741
Running compilation step : cd /tmp/ltsmin10664616820212549741;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10664616820212549741;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10664616820212549741;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-14 finished in 531323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)&&(G(p1)||F(p2))))'
Support contains 2525 out of 34164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Discarding 3535 places :
Implicit places reduction removed 3535 places
Iterating post reduction 0 with 3535 rules applied. Total rules applied 3535 place count 30629 transition count 31114
Applied a total of 3535 rules in 372 ms. Remains 30629 /34164 variables (removed 3535) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 30629 cols
[2022-05-16 13:02:06] [INFO ] Computed 2631 place invariants in 1844 ms
[2022-05-16 13:02:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:02:08] [INFO ] Implicit Places using invariants in 4004 ms returned []
Implicit Place search using SMT only with invariants took 4006 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 30629 cols
[2022-05-16 13:02:09] [INFO ] Computed 2631 place invariants in 1644 ms
[2022-05-16 13:02:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:02:12] [INFO ] Dead Transitions using invariants and state equation in 3801 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30629/34164 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 30629/34164 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s16638 1) (GEQ s17749 1)) (AND (GEQ s17230 1) (GEQ s18341 1)) (AND (GEQ s17240 1) (GEQ s18351 1)) (AND (GEQ s16628 1) (GEQ s17739 1)) (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-15 finished in 8478 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a CL insensitive property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-14
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 101 out of 34164 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 34164/34164 places, 31114/31114 transitions.
Graph (complete) has 48884 edges and 34164 vertex of which 24251 are kept as prefixes of interest. Removing 9913 places using SCC suffix rule.37 ms
Discarding 9913 places :
Also discarding 9500 output transitions
Drop transitions removed 9500 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 4444 places :
Implicit places reduction removed 4444 places
Drop transitions removed 15655 transitions
Trivial Post-agglo rules discarded 15655 transitions
Performed 15655 trivial Post agglomeration. Transition count delta: 15655
Iterating post reduction 0 with 20099 rules applied. Total rules applied 20100 place count 19706 transition count 5858
Reduce places removed 15655 places and 0 transitions.
Iterating post reduction 1 with 15655 rules applied. Total rules applied 35755 place count 4051 transition count 5858
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 35755 place count 4051 transition count 5757
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 35957 place count 3950 transition count 5757
Discarding 2020 places :
Symmetric choice reduction at 2 with 2020 rule applications. Total rules 37977 place count 1930 transition count 3737
Iterating global reduction 2 with 2020 rules applied. Total rules applied 39997 place count 1930 transition count 3737
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 39997 place count 1930 transition count 3636
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 40199 place count 1829 transition count 3636
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 40209 place count 1819 transition count 2626
Iterating global reduction 2 with 10 rules applied. Total rules applied 40219 place count 1819 transition count 2626
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 2 with 101 rules applied. Total rules applied 40320 place count 1718 transition count 2626
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 40320 place count 1718 transition count 2525
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 40522 place count 1617 transition count 2525
Discarding 1010 places :
Symmetric choice reduction at 3 with 1010 rule applications. Total rules 41532 place count 607 transition count 1515
Iterating global reduction 3 with 1010 rules applied. Total rules applied 42542 place count 607 transition count 1515
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 3 with 1010 rules applied. Total rules applied 43552 place count 607 transition count 505
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 43552 place count 607 transition count 404
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 4 with 303 rules applied. Total rules applied 43855 place count 405 transition count 404
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 4 with 101 rules applied. Total rules applied 43956 place count 304 transition count 303
Applied a total of 43956 rules in 730 ms. Remains 304 /34164 variables (removed 33860) and now considering 303/31114 (removed 30811) transitions.
// Phase 1: matrix 303 rows 304 cols
[2022-05-16 13:02:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 13:02:13] [INFO ] Implicit Places using invariants in 152 ms returned [202]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 303/34164 places, 303/31114 transitions.
Reduce places removed 101 places and 101 transitions.
Applied a total of 0 rules in 1 ms. Remains 202 /303 variables (removed 101) and now considering 202/303 (removed 101) transitions.
Finished structural reductions, in 2 iterations. Remains : 202/34164 places, 202/31114 transitions.
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s30 1) (GEQ s91 1) (GEQ s34 1) (GEQ s95 1) (GEQ s38 1) (GEQ s99 1) (GEQ s42 1) (GEQ s46 1) (GEQ s50 1) (GEQ s54 1) (GEQ s58 1) (GEQ s62 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33225 reset in 591 ms.
Product exploration explored 100000 steps with 33218 reset in 569 ms.
Computed a total of 202 stabilizing places and 202 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 202 transition count 202
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 202 rows 202 cols
[2022-05-16 13:02:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 13:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:02:15] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-16 13:02:15] [INFO ] Computed and/alt/rep : 101/101/101 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 13:02:15] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 101 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 202 /202 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 202 cols
[2022-05-16 13:02:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 13:02:15] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 202 rows 202 cols
[2022-05-16 13:02:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 13:02:15] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 202 cols
[2022-05-16 13:02:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 13:02:15] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 202/202 transitions.
Computed a total of 202 stabilizing places and 202 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 202 transition count 202
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 202 rows 202 cols
[2022-05-16 13:02:16] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 13:02:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:02:16] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-16 13:02:16] [INFO ] Computed and/alt/rep : 101/101/101 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 13:02:16] [INFO ] Added : 0 causal constraints over 0 iterations in 35 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33214 reset in 620 ms.
Product exploration explored 100000 steps with 33218 reset in 598 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 101 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 202 /202 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2022-05-16 13:02:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 202 rows 202 cols
[2022-05-16 13:02:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 13:02:18] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 202/202 transitions.
Product exploration explored 100000 steps with 33225 reset in 1127 ms.
Product exploration explored 100000 steps with 33220 reset in 1151 ms.
Built C files in :
/tmp/ltsmin7013874967231167382
[2022-05-16 13:02:20] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7013874967231167382
Running compilation step : cd /tmp/ltsmin7013874967231167382;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 288 ms.
Running link step : cd /tmp/ltsmin7013874967231167382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7013874967231167382;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3325979107515676123.hoa' '--buchi-type=spotba'
LTSmin run took 807 ms.
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-14 finished in 9427 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLFireability-14 TRUE TECHNIQUES CL_INSENSITIVE
[2022-05-16 13:02:22] [INFO ] Flatten gal took : 980 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 776412 ms.

BK_STOP 1652706143293

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-L00100M0010C005P005G002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-COL-L00100M0010C005P005G002, 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 r078-tall-165260110600644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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