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-165260110600643.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110600643
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1652705196781

Running Version 202205111006
[2022-05-16 12:46:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:46:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 12:46:38] [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:46:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 12:46:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 670 ms
[2022-05-16 12:46:38] [INFO ] Detected 5 constant HL places corresponding to 31 PT places.
[2022-05-16 12:46:38] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 40706 PT places and 36972.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 12:46:40] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 10 ms.
[2022-05-16 12:46:40] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 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 10002 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 21) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 99 cols
[2022-05-16 12:46:40] [INFO ] Computed 33 place invariants in 18 ms
[2022-05-16 12:46:40] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-16 12:46:40] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-16 12:46:40] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 12:46:40] [INFO ] After 60ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-16 12:46:40] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 280 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=140 )
Parikh walk visited 1 properties in 2 ms.
[2022-05-16 12:46:40] [INFO ] Flatten gal took : 27 ms
[2022-05-16 12:46:40] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 12:46:40] [INFO ] Flatten gal took : 10 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:46:40] [INFO ] Unfolded HLPN to a Petri net with 37039 places and 31114 transitions 89397 arcs in 193 ms.
[2022-05-16 12:46:40] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Deduced a syphon composed of 101 places in 175 ms
Reduce places removed 122 places and 0 transitions.
Support contains 11010 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 5757 places :
Implicit places reduction removed 5757 places
Iterating post reduction 0 with 6086 rules applied. Total rules applied 6086 place count 30831 transition count 31114
Applied a total of 6086 rules in 911 ms. Remains 30831 /36917 variables (removed 6086) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 30831 cols
[2022-05-16 12:46:44] [INFO ] Computed 2833 place invariants in 1674 ms
[2022-05-16 12:46:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:46:46] [INFO ] Implicit Places using invariants in 4298 ms returned []
Implicit Place search using SMT only with invariants took 4299 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 30831 cols
[2022-05-16 12:46:48] [INFO ] Computed 2833 place invariants in 1545 ms
[2022-05-16 12:46:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:46:50] [INFO ] Dead Transitions using invariants and state equation in 4053 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30831/36917 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 30831/36917 places, 31114/31114 transitions.
Support contains 11010 out of 30831 places after structural reductions.
[2022-05-16 12:46:52] [INFO ] Flatten gal took : 1103 ms
[2022-05-16 12:46:53] [INFO ] Flatten gal took : 942 ms
[2022-05-16 12:46:54] [INFO ] Input system was already deterministic with 31114 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 777 ms. (steps per millisecond=12 ) properties (out of 19) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 31114 rows 30831 cols
[2022-05-16 12:46:57] [INFO ] Computed 2833 place invariants in 1470 ms
[2022-05-16 12:47:03] [INFO ] After 5592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 12:47:11] [INFO ] [Nat]Absence check using 0 positive and 2833 generalized place invariants in 2954 ms returned sat
[2022-05-16 12:47:28] [INFO ] After 15037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-16 12:47:28] [INFO ] After 15125ms 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:47:28] [INFO ] After 25117ms 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 1617 out of 30831 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Graph (complete) has 42218 edges and 30831 vertex of which 30118 are kept as prefixes of interest. Removing 713 places using SCC suffix rule.54 ms
Discarding 713 places :
Also discarding 713 output transitions
Drop transitions removed 713 transitions
Discarding 1212 places :
Implicit places reduction removed 1212 places
Drop transitions removed 14645 transitions
Trivial Post-agglo rules discarded 14645 transitions
Performed 14645 trivial Post agglomeration. Transition count delta: 14645
Iterating post reduction 0 with 15857 rules applied. Total rules applied 15858 place count 28906 transition count 15756
Reduce places removed 14645 places and 0 transitions.
Performed 1414 Post agglomeration using F-continuation condition.Transition count delta: 1414
Iterating post reduction 1 with 16059 rules applied. Total rules applied 31917 place count 14261 transition count 14342
Reduce places removed 1414 places and 0 transitions.
Iterating post reduction 2 with 1414 rules applied. Total rules applied 33331 place count 12847 transition count 14342
Performed 2222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2222 Pre rules applied. Total rules applied 33331 place count 12847 transition count 12120
Deduced a syphon composed of 2222 places in 6 ms
Ensure Unique test removed 1010 places
Reduce places removed 3232 places and 0 transitions.
Iterating global reduction 3 with 5454 rules applied. Total rules applied 38785 place count 9615 transition count 12120
Discarding 101 places :
Implicit places reduction removed 101 places
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 707 rules applied. Total rules applied 39492 place count 9514 transition count 11514
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 40098 place count 8908 transition count 11514
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 40098 place count 8908 transition count 11413
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 40300 place count 8807 transition count 11413
Discarding 3130 places :
Symmetric choice reduction at 5 with 3130 rule applications. Total rules 43430 place count 5677 transition count 8283
Iterating global reduction 5 with 3130 rules applied. Total rules applied 46560 place count 5677 transition count 8283
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 46661 place count 5677 transition count 8182
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 6 with 101 rules applied. Total rules applied 46762 place count 5576 transition count 8182
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 202 Pre rules applied. Total rules applied 46762 place count 5576 transition count 7980
Deduced a syphon composed of 202 places in 4 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 7 with 404 rules applied. Total rules applied 47166 place count 5374 transition count 7980
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 47171 place count 5369 transition count 7475
Iterating global reduction 7 with 5 rules applied. Total rules applied 47176 place count 5369 transition count 7475
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 7 with 808 rules applied. Total rules applied 47984 place count 5167 transition count 6869
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 8 with 101 rules applied. Total rules applied 48085 place count 5066 transition count 6869
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 48085 place count 5066 transition count 6768
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 48287 place count 4965 transition count 6768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 48489 place count 4864 transition count 6667
Free-agglomeration rule (complex) applied 1313 times.
Iterating global reduction 9 with 1313 rules applied. Total rules applied 49802 place count 4864 transition count 5354
Reduce places removed 1313 places and 0 transitions.
Iterating post reduction 9 with 1313 rules applied. Total rules applied 51115 place count 3551 transition count 5354
Applied a total of 51115 rules in 5727 ms. Remains 3551 /30831 variables (removed 27280) and now considering 5354/31114 (removed 25760) transitions.
Finished structural reductions, in 1 iterations. Remains : 3551/30831 places, 5354/31114 transitions.
Finished random walk after 783 steps, including 0 resets, run visited all 4 properties in 34 ms. (steps per millisecond=23 )
Computed a total of 30831 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30831 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(F(p0)))'
Support contains 1212 out of 30831 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Graph (complete) has 42218 edges and 30831 vertex of which 21625 are kept as prefixes of interest. Removing 9206 places using SCC suffix rule.69 ms
Discarding 9206 places :
Also discarding 8995 output transitions
Drop transitions removed 8995 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1313 places :
Implicit places reduction removed 1313 places
Drop transitions removed 12726 transitions
Trivial Post-agglo rules discarded 12726 transitions
Performed 12726 trivial Post agglomeration. Transition count delta: 12726
Iterating post reduction 0 with 14039 rules applied. Total rules applied 14040 place count 20211 transition count 9292
Reduce places removed 12726 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 13837 rules applied. Total rules applied 27877 place count 7485 transition count 8181
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 28988 place count 6374 transition count 8181
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 202 Pre rules applied. Total rules applied 28988 place count 6374 transition count 7979
Deduced a syphon composed of 202 places in 2 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 3 with 404 rules applied. Total rules applied 29392 place count 6172 transition count 7979
Discarding 2020 places :
Symmetric choice reduction at 3 with 2020 rule applications. Total rules 31412 place count 4152 transition count 5959
Iterating global reduction 3 with 2020 rules applied. Total rules applied 33432 place count 4152 transition count 5959
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 33432 place count 4152 transition count 5858
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 33634 place count 4051 transition count 5858
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 33644 place count 4041 transition count 4848
Iterating global reduction 3 with 10 rules applied. Total rules applied 33654 place count 4041 transition count 4848
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 3 with 101 rules applied. Total rules applied 33755 place count 3940 transition count 4848
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 33755 place count 3940 transition count 4747
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 33957 place count 3839 transition count 4747
Applied a total of 33957 rules in 1668 ms. Remains 3839 /30831 variables (removed 26992) and now considering 4747/31114 (removed 26367) transitions.
// Phase 1: matrix 4747 rows 3839 cols
[2022-05-16 12:47:36] [INFO ] Computed 102 place invariants in 52 ms
[2022-05-16 12:47:37] [INFO ] Implicit Places using invariants in 1070 ms returned [1234, 1255, 1265, 1291, 1296]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1073 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3834/30831 places, 4747/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 3834 transition count 4692
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 3779 transition count 4692
Applied a total of 110 rules in 230 ms. Remains 3779 /3834 variables (removed 55) and now considering 4692/4747 (removed 55) transitions.
// Phase 1: matrix 4692 rows 3779 cols
[2022-05-16 12:47:37] [INFO ] Computed 97 place invariants in 52 ms
[2022-05-16 12:47:39] [INFO ] Implicit Places using invariants in 1466 ms returned [1157, 1158, 1159, 1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 3576]
Discarding 97 places :
Implicit Place search using SMT only with invariants took 1472 ms to find 97 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3682/30831 places, 4692/31114 transitions.
Drop transitions removed 1056 transitions
Trivial Post-agglo rules discarded 1056 transitions
Performed 1056 trivial Post agglomeration. Transition count delta: 1056
Iterating post reduction 0 with 1056 rules applied. Total rules applied 1056 place count 3682 transition count 3636
Reduce places removed 1056 places and 0 transitions.
Iterating post reduction 1 with 1056 rules applied. Total rules applied 2112 place count 2626 transition count 3636
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 2112 place count 2626 transition count 3535
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 2314 place count 2525 transition count 3535
Applied a total of 2314 rules in 103 ms. Remains 2525 /3682 variables (removed 1157) and now considering 3535/4692 (removed 1157) transitions.
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 12:47:39] [INFO ] Computed 0 place invariants in 13 ms
[2022-05-16 12:47:39] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 12:47:39] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-16 12:47:40] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 2525/30831 places, 3535/31114 transitions.
Finished structural reductions, in 3 iterations. Remains : 2525/30831 places, 3535/31114 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s2424 s2425 s2426 s2427 s2428 s2429 s2430 s2431 s2432 s2433 s2434 s2435 s2436 s2437 s2438 s2439 s2440 s2441 s2442 s2443 s2444 s2445 s2446 s244...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 304 reset in 3465 ms.
Product exploration explored 100000 steps with 304 reset in 3360 ms.
Computed a total of 2525 stabilizing places and 3535 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2525 transition count 3535
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 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 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 342 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=26 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 172 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 12:48:06] [INFO ] Computed 0 place invariants in 8 ms
[2022-05-16 12:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:48:21] [INFO ] [Real]Absence check using state equation in 3188 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1212 out of 2525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2525/2525 places, 3535/3535 transitions.
Applied a total of 0 rules in 60 ms. Remains 2525 /2525 variables (removed 0) and now considering 3535/3535 (removed 0) transitions.
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 12:48:22] [INFO ] Computed 0 place invariants in 13 ms
[2022-05-16 12:48:22] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 12:48:22] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-16 12:48:22] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2022-05-16 12:48:23] [INFO ] Redundant transitions in 206 ms returned []
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 12:48:23] [INFO ] Computed 0 place invariants in 10 ms
[2022-05-16 12:48:24] [INFO ] Dead Transitions using invariants and state equation in 1334 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2525/2525 places, 3535/3535 transitions.
Computed a total of 2525 stabilizing places and 3535 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2525 transition count 3535
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 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 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 360 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 185 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 997 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 12:48:45] [INFO ] Computed 0 place invariants in 12 ms
[2022-05-16 12:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 12:49:00] [INFO ] [Real]Absence check using state equation in 3046 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 377 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 300 reset in 3296 ms.
Product exploration explored 100000 steps with 304 reset in 3353 ms.
Built C files in :
/tmp/ltsmin10863045888618797840
[2022-05-16 12:49:07] [INFO ] Too many transitions (3535) to apply POR reductions. Disabling POR matrices.
[2022-05-16 12:49:07] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10863045888618797840
Running compilation step : cd /tmp/ltsmin10863045888618797840;'/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/ltsmin10863045888618797840;'/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/ltsmin10863045888618797840;'/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 1212 out of 2525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2525/2525 places, 3535/3535 transitions.
Applied a total of 0 rules in 50 ms. Remains 2525 /2525 variables (removed 0) and now considering 3535/3535 (removed 0) transitions.
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 12:49:10] [INFO ] Computed 0 place invariants in 8 ms
[2022-05-16 12:49:10] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 12:49:10] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-16 12:49:11] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2022-05-16 12:49:11] [INFO ] Redundant transitions in 198 ms returned []
// Phase 1: matrix 3535 rows 2525 cols
[2022-05-16 12:49:11] [INFO ] Computed 0 place invariants in 11 ms
[2022-05-16 12:49:12] [INFO ] Dead Transitions using invariants and state equation in 1373 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2525/2525 places, 3535/3535 transitions.
Built C files in :
/tmp/ltsmin7954079041485826020
[2022-05-16 12:49:12] [INFO ] Too many transitions (3535) to apply POR reductions. Disabling POR matrices.
[2022-05-16 12:49:12] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7954079041485826020
Running compilation step : cd /tmp/ltsmin7954079041485826020;'/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/ltsmin7954079041485826020;'/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/ltsmin7954079041485826020;'/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:49:16] [INFO ] Flatten gal took : 69 ms
[2022-05-16 12:49:16] [INFO ] Flatten gal took : 70 ms
[2022-05-16 12:49:16] [INFO ] Time to serialize gal into /tmp/LTL5642782950684529658.gal : 26 ms
[2022-05-16 12:49:16] [INFO ] Time to serialize properties into /tmp/LTL9990698453086066896.ltl : 2 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/LTL5642782950684529658.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9990698453086066896.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/LTL5642782...266
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((l15_0+l15_1)+(l15_2+l15_3))+((l15_4+l15_5)+(l15_6+l15_7)))+(((l15_8+l15_9)+(l15_10+l15_11))+((l15_12+l15_13)+(l15_14+l...10931
Formula 0 simplified : !GF"((((((((l15_0+l15_1)+(l15_2+l15_3))+((l15_4+l15_5)+(l15_6+l15_7)))+(((l15_8+l15_9)+(l15_10+l15_11))+((l15_12+l15_13)+(l15_14+l15...10925
Detected timeout of ITS tools.
[2022-05-16 12:49:32] [INFO ] Flatten gal took : 84 ms
[2022-05-16 12:49:32] [INFO ] Applying decomposition
[2022-05-16 12:49:32] [INFO ] Flatten gal took : 74 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/graph6433542956758732213.txt' '-o' '/tmp/graph6433542956758732213.bin' '-w' '/tmp/graph6433542956758732213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6433542956758732213.bin' '-l' '-1' '-v' '-w' '/tmp/graph6433542956758732213.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:49:33] [INFO ] Decomposing Gal with order
[2022-05-16 12:49:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:49:36] [INFO ] Removed a total of 690 redundant transitions.
[2022-05-16 12:49:38] [INFO ] Flatten gal took : 4609 ms
[2022-05-16 12:49:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 759 labels/synchronizations in 124 ms.
[2022-05-16 12:49:39] [INFO ] Time to serialize gal into /tmp/LTL3683501841631206428.gal : 17 ms
[2022-05-16 12:49:39] [INFO ] Time to serialize properties into /tmp/LTL1469972087223193697.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/LTL3683501841631206428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1469972087223193697.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/LTL3683501...266
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((gu128.l15_0+gu128.l15_1)+(gu128.l15_2+gu128.l15_3))+((gu128.l15_4+gu128.l15_5)+(gu128.l15_6+gu128.l15_7)))+(((gu128.l1...18203
Formula 0 simplified : !GF"((((((((gu128.l15_0+gu128.l15_1)+(gu128.l15_2+gu128.l15_3))+((gu128.l15_4+gu128.l15_5)+(gu128.l15_6+gu128.l15_7)))+(((gu128.l15_...18197
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5093362129886484942
[2022-05-16 12:49:54] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5093362129886484942
Running compilation step : cd /tmp/ltsmin5093362129886484942;'/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/ltsmin5093362129886484942;'/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/ltsmin5093362129886484942;'/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-LTLCardinality-00 finished in 142512 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1111 out of 30831 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Graph (complete) has 42218 edges and 30831 vertex of which 20716 are kept as prefixes of interest. Removing 10115 places using SCC suffix rule.30 ms
Discarding 10115 places :
Also discarding 9702 output transitions
Drop transitions removed 9702 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Drop transitions removed 14544 transitions
Trivial Post-agglo rules discarded 14544 transitions
Performed 14544 trivial Post agglomeration. Transition count delta: 14544
Iterating post reduction 0 with 15655 rules applied. Total rules applied 15656 place count 19504 transition count 6767
Reduce places removed 14544 places and 0 transitions.
Iterating post reduction 1 with 14544 rules applied. Total rules applied 30200 place count 4960 transition count 6767
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 30200 place count 4960 transition count 6666
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 30402 place count 4859 transition count 6666
Discarding 1010 places :
Symmetric choice reduction at 2 with 1010 rule applications. Total rules 31412 place count 3849 transition count 5656
Iterating global reduction 2 with 1010 rules applied. Total rules applied 32422 place count 3849 transition count 5656
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 32624 place count 3748 transition count 5555
Applied a total of 32624 rules in 1727 ms. Remains 3748 /30831 variables (removed 27083) and now considering 5555/31114 (removed 25559) transitions.
// Phase 1: matrix 5555 rows 3748 cols
[2022-05-16 12:49:59] [INFO ] Computed 203 place invariants in 62 ms
[2022-05-16 12:50:00] [INFO ] Implicit Places using invariants in 2016 ms returned [1212, 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254, 1255, 1256, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303, 1304, 1305, 1306, 1307, 1308, 1309, 1310, 1311, 1312, 3647, 3648, 3649, 3650, 3651, 3652, 3653, 3654, 3655, 3656, 3657, 3658, 3659, 3660, 3661, 3662, 3663, 3664, 3665, 3666, 3667, 3668, 3669, 3670, 3671, 3672, 3673, 3674, 3675, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699, 3700, 3701, 3702, 3703, 3704, 3705, 3706, 3707, 3708, 3709, 3710, 3711, 3712, 3713, 3714, 3715, 3716, 3717, 3718, 3719, 3720, 3721, 3722, 3723, 3724, 3725, 3726, 3727, 3728, 3729, 3730, 3731, 3732, 3733, 3734, 3735, 3736, 3737, 3738, 3739, 3740, 3741, 3742, 3743, 3744, 3745, 3746, 3747]
Discarding 202 places :
Implicit Place search using SMT only with invariants took 2022 ms to find 202 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3546/30831 places, 5555/31114 transitions.
Drop transitions removed 1111 transitions
Trivial Post-agglo rules discarded 1111 transitions
Performed 1111 trivial Post agglomeration. Transition count delta: 1111
Iterating post reduction 0 with 1111 rules applied. Total rules applied 1111 place count 3546 transition count 4444
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 1 with 1111 rules applied. Total rules applied 2222 place count 2435 transition count 4444
Applied a total of 2222 rules in 140 ms. Remains 2435 /3546 variables (removed 1111) and now considering 4444/5555 (removed 1111) transitions.
// Phase 1: matrix 4444 rows 2435 cols
[2022-05-16 12:50:01] [INFO ] Computed 1 place invariants in 38 ms
[2022-05-16 12:50:01] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 4444 rows 2435 cols
[2022-05-16 12:50:01] [INFO ] Computed 1 place invariants in 36 ms
[2022-05-16 12:50:02] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2435/30831 places, 4444/31114 transitions.
Finished structural reductions, in 2 iterations. Remains : 2435/30831 places, 4444/31114 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s1324 s1325 s1326 s1327 s1328 s1329 s1330 s1331 s1332 s1333 s1334 s1335 s1336 s1337 s1338 s1339 s1340 s1341 s1342 s1343 s1344 s1345 s1346 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 253 reset in 4691 ms.
Product exploration explored 100000 steps with 253 reset in 4801 ms.
Computed a total of 2435 stabilizing places and 4444 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2435 transition count 4444
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-01 finished in 33030 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(p0)))))'
Support contains 202 out of 30831 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Graph (complete) has 42218 edges and 30831 vertex of which 28802 are kept as prefixes of interest. Removing 2029 places using SCC suffix rule.29 ms
Discarding 2029 places :
Also discarding 1925 output transitions
Drop transitions removed 1925 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1313 places :
Implicit places reduction removed 1313 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 19493 rules applied. Total rules applied 19494 place count 27388 transition count 10908
Reduce places removed 18180 places and 0 transitions.
Iterating post reduction 1 with 18180 rules applied. Total rules applied 37674 place count 9208 transition count 10908
Performed 1818 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1818 Pre rules applied. Total rules applied 37674 place count 9208 transition count 9090
Deduced a syphon composed of 1818 places in 3 ms
Ensure Unique test removed 909 places
Reduce places removed 2727 places and 0 transitions.
Iterating global reduction 2 with 4545 rules applied. Total rules applied 42219 place count 6481 transition count 9090
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 42825 place count 6481 transition count 8484
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 3 with 606 rules applied. Total rules applied 43431 place count 5875 transition count 8484
Discarding 3030 places :
Symmetric choice reduction at 4 with 3030 rule applications. Total rules 46461 place count 2845 transition count 5454
Iterating global reduction 4 with 3030 rules applied. Total rules applied 49491 place count 2845 transition count 5454
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 49693 place count 2845 transition count 5252
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 5 with 202 rules applied. Total rules applied 49895 place count 2643 transition count 5252
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 49910 place count 2628 transition count 3737
Iterating global reduction 6 with 15 rules applied. Total rules applied 49925 place count 2628 transition count 3737
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 50935 place count 2325 transition count 3030
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 7 with 202 rules applied. Total rules applied 51137 place count 2123 transition count 3030
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 51137 place count 2123 transition count 2828
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 51541 place count 1921 transition count 2828
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 52551 place count 911 transition count 1818
Iterating global reduction 8 with 1010 rules applied. Total rules applied 53561 place count 911 transition count 1818
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 8 with 1010 rules applied. Total rules applied 54571 place count 911 transition count 808
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 54571 place count 911 transition count 707
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 54874 place count 709 transition count 707
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 9 with 101 rules applied. Total rules applied 54975 place count 608 transition count 606
Applied a total of 54975 rules in 1441 ms. Remains 608 /30831 variables (removed 30223) and now considering 606/31114 (removed 30508) transitions.
// Phase 1: matrix 606 rows 608 cols
[2022-05-16 12:50:31] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 12:50:31] [INFO ] Implicit Places using invariants in 198 ms returned [202, 304]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 199 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 606/30831 places, 606/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 505 transition count 404
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 404 transition count 404
Applied a total of 202 rules in 8 ms. Remains 404 /606 variables (removed 202) and now considering 404/606 (removed 202) transitions.
// Phase 1: matrix 404 rows 404 cols
[2022-05-16 12:50:31] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 12:50:31] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 404 rows 404 cols
[2022-05-16 12:50:31] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 12:50:32] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 404/30831 places, 404/31114 transitions.
Finished structural reductions, in 2 iterations. Remains : 404/30831 places, 404/31114 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 404 steps with 0 reset in 10 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-04 finished in 1911 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(X((X(p0) U G(p1)))) U !(p2 U p3)))'
Support contains 1212 out of 30831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Discarding 1212 places :
Implicit places reduction removed 1212 places
Iterating post reduction 0 with 1212 rules applied. Total rules applied 1212 place count 29619 transition count 31114
Applied a total of 1212 rules in 163 ms. Remains 29619 /30831 variables (removed 1212) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29619 cols
[2022-05-16 12:50:33] [INFO ] Computed 1621 place invariants in 1076 ms
[2022-05-16 12:50:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:50:35] [INFO ] Implicit Places using invariants in 3425 ms returned []
Implicit Place search using SMT only with invariants took 3426 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29619 cols
[2022-05-16 12:50:36] [INFO ] Computed 1621 place invariants in 1049 ms
[2022-05-16 12:50:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:50:39] [INFO ] Dead Transitions using invariants and state equation in 3381 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29619/30831 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 29619/30831 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 234 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p3 p1), acceptance={} source=2 dest: 3}, { cond=p3, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GT (ADD s21830 s21831 s21832 s21833 s21834 s21835 s21836 s21837 s21838 s21839 s21840 s21841 s21842 s21843 s21844 s21845 s21846 s21847 s21848 s21849 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 43 reset in 3507 ms.
Product exploration explored 100000 steps with 42 reset in 3530 ms.
Computed a total of 29619 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29619 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 p2) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p3)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 914 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 219 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 31114 rows 29619 cols
[2022-05-16 12:51:24] [INFO ] Computed 1621 place invariants in 1078 ms
[2022-05-16 12:51:29] [INFO ] After 5574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 12:51:37] [INFO ] [Nat]Absence check using 0 positive and 1621 generalized place invariants in 2080 ms returned sat
[2022-05-16 12:51:54] [INFO ] After 15430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 12:51:54] [INFO ] After 15463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-16 12:51:54] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1212 out of 29619 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 29619/29619 places, 31114/31114 transitions.
Graph (complete) has 39794 edges and 29619 vertex of which 28501 are kept as prefixes of interest. Removing 1118 places using SCC suffix rule.12 ms
Discarding 1118 places :
Also discarding 1117 output transitions
Drop transitions removed 1117 transitions
Drop transitions removed 16160 transitions
Trivial Post-agglo rules discarded 16160 transitions
Performed 16160 trivial Post agglomeration. Transition count delta: 16160
Iterating post reduction 0 with 16160 rules applied. Total rules applied 16161 place count 28501 transition count 13837
Reduce places removed 16160 places and 0 transitions.
Performed 1212 Post agglomeration using F-continuation condition.Transition count delta: 1212
Iterating post reduction 1 with 17372 rules applied. Total rules applied 33533 place count 12341 transition count 12625
Reduce places removed 1212 places and 0 transitions.
Iterating post reduction 2 with 1212 rules applied. Total rules applied 34745 place count 11129 transition count 12625
Performed 2929 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2929 Pre rules applied. Total rules applied 34745 place count 11129 transition count 9696
Deduced a syphon composed of 2929 places in 4 ms
Ensure Unique test removed 1010 places
Reduce places removed 3939 places and 0 transitions.
Iterating global reduction 3 with 6868 rules applied. Total rules applied 41613 place count 7190 transition count 9696
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 3 with 101 rules applied. Total rules applied 41714 place count 7089 transition count 9696
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 41714 place count 7089 transition count 9595
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 41916 place count 6988 transition count 9595
Discarding 2525 places :
Symmetric choice reduction at 4 with 2525 rule applications. Total rules 44441 place count 4463 transition count 7070
Iterating global reduction 4 with 2525 rules applied. Total rules applied 46966 place count 4463 transition count 7070
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 46966 place count 4463 transition count 6969
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 47168 place count 4362 transition count 6969
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 47183 place count 4347 transition count 5454
Iterating global reduction 4 with 15 rules applied. Total rules applied 47198 place count 4347 transition count 5454
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 4 with 101 rules applied. Total rules applied 47299 place count 4246 transition count 5454
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 47299 place count 4246 transition count 5353
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 47501 place count 4145 transition count 5353
Discarding 1010 places :
Symmetric choice reduction at 5 with 1010 rule applications. Total rules 48511 place count 3135 transition count 4343
Iterating global reduction 5 with 1010 rules applied. Total rules applied 49521 place count 3135 transition count 4343
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 5 with 1212 rules applied. Total rules applied 50733 place count 3034 transition count 3232
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 6 with 101 rules applied. Total rules applied 50834 place count 2933 transition count 3232
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 51036 place count 2832 transition count 3131
Free-agglomeration rule (complex) applied 303 times.
Iterating global reduction 7 with 303 rules applied. Total rules applied 51339 place count 2832 transition count 2828
Ensure Unique test removed 101 places
Reduce places removed 404 places and 0 transitions.
Iterating post reduction 7 with 404 rules applied. Total rules applied 51743 place count 2428 transition count 2828
Applied a total of 51743 rules in 2707 ms. Remains 2428 /29619 variables (removed 27191) and now considering 2828/31114 (removed 28286) transitions.
Finished structural reductions, in 1 iterations. Remains : 2428/29619 places, 2828/31114 transitions.
Finished random walk after 1200 steps, including 0 resets, run visited all 5 properties in 56 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p3)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p3 p1)), (F (NOT p0)), (F (AND p2 (NOT p3))), (F p1), (F (NOT p3))]
Knowledge based reduction with 16 factoid took 1127 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 213 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 222 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
// Phase 1: matrix 31114 rows 29619 cols
[2022-05-16 12:52:00] [INFO ] Computed 1621 place invariants in 1089 ms
Could not prove EG p3
Support contains 1212 out of 29619 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29619/29619 places, 31114/31114 transitions.
Applied a total of 0 rules in 101 ms. Remains 29619 /29619 variables (removed 0) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29619 cols
[2022-05-16 12:52:16] [INFO ] Computed 1621 place invariants in 1059 ms
[2022-05-16 12:52:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:52:19] [INFO ] Implicit Places using invariants in 3479 ms returned []
Implicit Place search using SMT only with invariants took 3480 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29619 cols
[2022-05-16 12:52:20] [INFO ] Computed 1621 place invariants in 1058 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 3421 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29619/29619 places, 31114/31114 transitions.
Computed a total of 29619 stabilizing places and 31114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29619 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 p2) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X p3)), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 953 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 201 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 581 ms. (steps per millisecond=17 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 31114 rows 29619 cols
[2022-05-16 12:52:56] [INFO ] Computed 1621 place invariants in 1043 ms
[2022-05-16 12:53:01] [INFO ] After 5461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-16 12:53:09] [INFO ] [Nat]Absence check using 0 positive and 1621 generalized place invariants in 2044 ms returned sat
[2022-05-16 12:53:27] [INFO ] After 15602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 12:53:27] [INFO ] After 15619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 12:53:27] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1212 out of 29619 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 29619/29619 places, 31114/31114 transitions.
Graph (complete) has 39794 edges and 29619 vertex of which 28501 are kept as prefixes of interest. Removing 1118 places using SCC suffix rule.12 ms
Discarding 1118 places :
Also discarding 1117 output transitions
Drop transitions removed 1117 transitions
Drop transitions removed 16160 transitions
Trivial Post-agglo rules discarded 16160 transitions
Performed 16160 trivial Post agglomeration. Transition count delta: 16160
Iterating post reduction 0 with 16160 rules applied. Total rules applied 16161 place count 28501 transition count 13837
Reduce places removed 16160 places and 0 transitions.
Performed 1212 Post agglomeration using F-continuation condition.Transition count delta: 1212
Iterating post reduction 1 with 17372 rules applied. Total rules applied 33533 place count 12341 transition count 12625
Reduce places removed 1212 places and 0 transitions.
Iterating post reduction 2 with 1212 rules applied. Total rules applied 34745 place count 11129 transition count 12625
Performed 2929 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2929 Pre rules applied. Total rules applied 34745 place count 11129 transition count 9696
Deduced a syphon composed of 2929 places in 4 ms
Ensure Unique test removed 1010 places
Reduce places removed 3939 places and 0 transitions.
Iterating global reduction 3 with 6868 rules applied. Total rules applied 41613 place count 7190 transition count 9696
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 3 with 101 rules applied. Total rules applied 41714 place count 7089 transition count 9696
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 41714 place count 7089 transition count 9595
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 41916 place count 6988 transition count 9595
Discarding 2525 places :
Symmetric choice reduction at 4 with 2525 rule applications. Total rules 44441 place count 4463 transition count 7070
Iterating global reduction 4 with 2525 rules applied. Total rules applied 46966 place count 4463 transition count 7070
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 46966 place count 4463 transition count 6969
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 47168 place count 4362 transition count 6969
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 47183 place count 4347 transition count 5454
Iterating global reduction 4 with 15 rules applied. Total rules applied 47198 place count 4347 transition count 5454
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 4 with 101 rules applied. Total rules applied 47299 place count 4246 transition count 5454
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 47299 place count 4246 transition count 5353
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 47501 place count 4145 transition count 5353
Discarding 1010 places :
Symmetric choice reduction at 5 with 1010 rule applications. Total rules 48511 place count 3135 transition count 4343
Iterating global reduction 5 with 1010 rules applied. Total rules applied 49521 place count 3135 transition count 4343
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 5 with 1212 rules applied. Total rules applied 50733 place count 3034 transition count 3232
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 6 with 101 rules applied. Total rules applied 50834 place count 2933 transition count 3232
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 51036 place count 2832 transition count 3131
Free-agglomeration rule (complex) applied 303 times.
Iterating global reduction 7 with 303 rules applied. Total rules applied 51339 place count 2832 transition count 2828
Ensure Unique test removed 101 places
Reduce places removed 404 places and 0 transitions.
Iterating post reduction 7 with 404 rules applied. Total rules applied 51743 place count 2428 transition count 2828
Applied a total of 51743 rules in 2627 ms. Remains 2428 /29619 variables (removed 27191) and now considering 2828/31114 (removed 28286) transitions.
Finished structural reductions, in 1 iterations. Remains : 2428/29619 places, 2828/31114 transitions.
Finished random walk after 1185 steps, including 0 resets, run visited all 5 properties in 48 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X p3)), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p3 p1)), (F (NOT p0)), (F (AND p2 (NOT p3))), (F p1), (F (NOT p3))]
Knowledge based reduction with 16 factoid took 990 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 216 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 215 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
// Phase 1: matrix 31114 rows 29619 cols
[2022-05-16 12:53:32] [INFO ] Computed 1621 place invariants in 1091 ms
Could not prove EG p3
Stuttering acceptance computed with spot in 218 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Product exploration explored 100000 steps with 42 reset in 4714 ms.
Product exploration explored 100000 steps with 43 reset in 4771 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 181 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Support contains 1212 out of 29619 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29619/29619 places, 31114/31114 transitions.
Graph (complete) has 39794 edges and 29619 vertex of which 28501 are kept as prefixes of interest. Removing 1118 places using SCC suffix rule.29 ms
Discarding 1118 places :
Also discarding 1117 output transitions
Drop transitions removed 1117 transitions
Performed 10504 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10504 rules applied. Total rules applied 10505 place count 28501 transition count 29997
Performed 7676 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7676 Pre rules applied. Total rules applied 10505 place count 28501 transition count 30704
Deduced a syphon composed of 18180 places in 22 ms
Iterating global reduction 1 with 7676 rules applied. Total rules applied 18181 place count 28501 transition count 30704
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 1 with 101 rules applied. Total rules applied 18282 place count 28400 transition count 30704
Performed 1616 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 19796 places in 11 ms
Iterating global reduction 2 with 1616 rules applied. Total rules applied 19898 place count 28400 transition count 30704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -2525
Deduced a syphon composed of 19897 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 19999 place count 28400 transition count 33229
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 20100 place count 28299 transition count 32623
Deduced a syphon composed of 19796 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 20201 place count 28299 transition count 32623
Deduced a syphon composed of 19796 places in 10 ms
Applied a total of 20201 rules in 11879 ms. Remains 28299 /29619 variables (removed 1320) and now considering 32623/31114 (removed -1509) transitions.
// Phase 1: matrix 32623 rows 28299 cols
[2022-05-16 12:54:13] [INFO ] Computed 1418 place invariants in 3874 ms
[2022-05-16 12:54:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:54:15] [INFO ] Dead Transitions using invariants and state equation in 6160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28299/29619 places, 32623/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 28299/29619 places, 32623/31114 transitions.
Product exploration explored 100000 steps with 264 reset in 5104 ms.
Product exploration explored 100000 steps with 264 reset in 5050 ms.
Built C files in :
/tmp/ltsmin8239849805739182013
[2022-05-16 12:54:25] [INFO ] Built C files in 279ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8239849805739182013
Running compilation step : cd /tmp/ltsmin8239849805739182013;'/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/ltsmin8239849805739182013;'/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/ltsmin8239849805739182013;'/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 1212 out of 29619 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29619/29619 places, 31114/31114 transitions.
Applied a total of 0 rules in 140 ms. Remains 29619 /29619 variables (removed 0) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29619 cols
[2022-05-16 12:54:30] [INFO ] Computed 1621 place invariants in 1055 ms
[2022-05-16 12:54:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:54:32] [INFO ] Implicit Places using invariants in 3390 ms returned []
Implicit Place search using SMT only with invariants took 3392 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29619 cols
[2022-05-16 12:54:33] [INFO ] Computed 1621 place invariants in 1067 ms
[2022-05-16 12:54:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 12:54:35] [INFO ] Dead Transitions using invariants and state equation in 3383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29619/29619 places, 31114/31114 transitions.
Built C files in :
/tmp/ltsmin12809519962639048449
[2022-05-16 12:54:36] [INFO ] Built C files in 229ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12809519962639048449
Running compilation step : cd /tmp/ltsmin12809519962639048449;'/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/ltsmin12809519962639048449;'/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/ltsmin12809519962639048449;'/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:54:40] [INFO ] Flatten gal took : 780 ms
[2022-05-16 12:54:41] [INFO ] Flatten gal took : 856 ms
[2022-05-16 12:54:42] [INFO ] Time to serialize gal into /tmp/LTL5747784374128766286.gal : 1242 ms
[2022-05-16 12:54:42] [INFO ] Time to serialize properties into /tmp/LTL2257652143980965820.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/LTL5747784374128766286.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2257652143980965820.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/LTL5747784...266
Read 1 LTL properties
Checking formula 0 : !(((!(G(X((X("(((((((((((pl0_0+pl0_1)+(pl0_2+pl0_3))+((pl0_4+pl0_5)+(pl0_6+pl0_7)))+(((pl0_8+pl0_9)+(pl0_10+pl0_11))+((pl0_12+pl0_13)+...12307
Formula 0 simplified : !(!GX(X"(((((((((((pl0_0+pl0_1)+(pl0_2+pl0_3))+((pl0_4+pl0_5)+(pl0_6+pl0_7)))+(((pl0_8+pl0_9)+(pl0_10+pl0_11))+((pl0_12+pl0_13)+(pl0...12293
Detected timeout of ITS tools.
[2022-05-16 12:54:58] [INFO ] Flatten gal took : 850 ms
[2022-05-16 12:54:58] [INFO ] Applying decomposition
[2022-05-16 12:54:59] [INFO ] Flatten gal took : 786 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/graph9486706261547162957.txt' '-o' '/tmp/graph9486706261547162957.bin' '-w' '/tmp/graph9486706261547162957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9486706261547162957.bin' '-l' '-1' '-v' '-w' '/tmp/graph9486706261547162957.weights' '-q' '0' '-e' '0.001'
[2022-05-16 12:55:02] [INFO ] Decomposing Gal with order
[2022-05-16 12:55:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 12:59:48] [INFO ] Removed a total of 9366 redundant transitions.
[2022-05-16 12:59:49] [INFO ] Flatten gal took : 3552 ms
[2022-05-16 12:59:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 6079 labels/synchronizations in 1553 ms.
[2022-05-16 13:00:01] [INFO ] Time to serialize gal into /tmp/LTL8849138997267378655.gal : 154 ms
[2022-05-16 13:00:01] [INFO ] Time to serialize properties into /tmp/LTL9861440637705428931.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/LTL8849138997267378655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9861440637705428931.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/LTL8849138...266
Read 1 LTL properties
Checking formula 0 : !(((!(G(X((X("(((((((((((gu10627.pl0_0+gu10627.pl0_1)+(gu10627.pl0_2+gu10627.pl0_3))+((gu10627.pl0_4+gu10627.pl0_5)+(gu10627.pl0_6+gu1...24629
Formula 0 simplified : !(!GX(X"(((((((((((gu10627.pl0_0+gu10627.pl0_1)+(gu10627.pl0_2+gu10627.pl0_3))+((gu10627.pl0_4+gu10627.pl0_5)+(gu10627.pl0_6+gu10627...24615
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15499757126251764966
[2022-05-16 13:00:16] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15499757126251764966
Running compilation step : cd /tmp/ltsmin15499757126251764966;'/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/ltsmin15499757126251764966;'/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/ltsmin15499757126251764966;'/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-LTLCardinality-05 finished in 587127 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 1 out of 30831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Discarding 1313 places :
Implicit places reduction removed 1313 places
Iterating post reduction 0 with 1313 rules applied. Total rules applied 1313 place count 29518 transition count 31114
Applied a total of 1313 rules in 295 ms. Remains 29518 /30831 variables (removed 1313) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:00:21] [INFO ] Computed 1520 place invariants in 1788 ms
[2022-05-16 13:00:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:00:23] [INFO ] Implicit Places using invariants in 4066 ms returned []
Implicit Place search using SMT only with invariants took 4067 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:00:24] [INFO ] Computed 1520 place invariants in 1287 ms
[2022-05-16 13:00:26] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:00:27] [INFO ] Dead Transitions using invariants and state equation in 3388 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29518/30831 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/30831 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 s16364)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-06 finished in 7974 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1212 out of 30831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Discarding 1313 places :
Implicit places reduction removed 1313 places
Iterating post reduction 0 with 1313 rules applied. Total rules applied 1313 place count 29518 transition count 31114
Applied a total of 1313 rules in 203 ms. Remains 29518 /30831 variables (removed 1313) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:00:28] [INFO ] Computed 1520 place invariants in 1288 ms
[2022-05-16 13:00:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:00:30] [INFO ] Implicit Places using invariants in 3447 ms returned []
Implicit Place search using SMT only with invariants took 3447 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:00:32] [INFO ] Computed 1520 place invariants in 1257 ms
[2022-05-16 13:00:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:00:34] [INFO ] Dead Transitions using invariants and state equation in 3354 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29518/30831 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/30831 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s14950 s14951 s14952 s14953 s14954 s14955 s14956 s14957 s14958 s14959 s14960 s14961 s14962 s14963 s14964 s14965 s14966 s14967 s14968 s14969 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 42030 steps with 21015 reset in 10002 ms.
Product exploration timeout after 40870 steps with 20435 reset in 10002 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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-07 finished in 63670 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 101 out of 30831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Discarding 1313 places :
Implicit places reduction removed 1313 places
Iterating post reduction 0 with 1313 rules applied. Total rules applied 1313 place count 29518 transition count 31114
Applied a total of 1313 rules in 198 ms. Remains 29518 /30831 variables (removed 1313) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:01:32] [INFO ] Computed 1520 place invariants in 1634 ms
[2022-05-16 13:01:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:01:34] [INFO ] Implicit Places using invariants in 3740 ms returned []
Implicit Place search using SMT only with invariants took 3740 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:01:36] [INFO ] Computed 1520 place invariants in 1676 ms
[2022-05-16 13:01:38] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:01:38] [INFO ] Dead Transitions using invariants and state equation in 3792 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29518/30831 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/30831 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ 6 (ADD s22335 s22336 s22337 s22338 s22339 s22340 s22341 s22342 s22343 s22344 s22345 s22346 s22347 s22348 s22349 s22350 s22351 s22352 s22353 s22354...], 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-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-08 finished in 7939 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1212 out of 30831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 30730 transition count 31114
Applied a total of 101 rules in 178 ms. Remains 30730 /30831 variables (removed 101) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 30730 cols
[2022-05-16 13:01:42] [INFO ] Computed 2732 place invariants in 3112 ms
[2022-05-16 13:01:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:01:44] [INFO ] Implicit Places using invariants in 5312 ms returned []
Implicit Place search using SMT only with invariants took 5312 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 30730 cols
[2022-05-16 13:01:47] [INFO ] Computed 2732 place invariants in 2977 ms
[2022-05-16 13:01:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:01:49] [INFO ] Dead Transitions using invariants and state equation in 5213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30730/30831 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 30730/30831 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-10 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:(LEQ (ADD s10202 s10203 s10204 s10205 s10206 s10207 s10208 s10209 s10210 s10211 s10212 s10213 s10214 s10215 s10216 s10217 s10218 s10219 s10220 s10221 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 288 steps with 0 reset in 21 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-10 finished in 10891 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G((p1||X(p2)))))))'
Support contains 2626 out of 30831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Discarding 1313 places :
Implicit places reduction removed 1313 places
Iterating post reduction 0 with 1313 rules applied. Total rules applied 1313 place count 29518 transition count 31114
Applied a total of 1313 rules in 225 ms. Remains 29518 /30831 variables (removed 1313) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:01:51] [INFO ] Computed 1520 place invariants in 1966 ms
[2022-05-16 13:01:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:01:54] [INFO ] Implicit Places using invariants in 4125 ms returned []
Implicit Place search using SMT only with invariants took 4126 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:01:55] [INFO ] Computed 1520 place invariants in 1647 ms
[2022-05-16 13:01:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:01:57] [INFO ] Dead Transitions using invariants and state equation in 3740 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29518/30831 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/30831 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s12728 s12729 s12730 s12731 s12732 s12733 s12734 s12735 s12736 s12737 s12738 s12739 s12740 s12741 s12742 s12743 s12744 s12745 s12746 s12747 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 40900 steps with 20450 reset in 10002 ms.
Product exploration timeout after 42090 steps with 21045 reset in 10001 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 p0 p1 p2), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 83 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-11 finished in 63698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1111 out of 30831 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Graph (complete) has 42218 edges and 30831 vertex of which 16968 are kept as prefixes of interest. Removing 13863 places using SCC suffix rule.26 ms
Discarding 13863 places :
Also discarding 14348 output transitions
Drop transitions removed 14348 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Drop transitions removed 12221 transitions
Trivial Post-agglo rules discarded 12221 transitions
Performed 12221 trivial Post agglomeration. Transition count delta: 12221
Iterating post reduction 0 with 13332 rules applied. Total rules applied 13333 place count 15756 transition count 4444
Reduce places removed 12221 places and 0 transitions.
Iterating post reduction 1 with 12221 rules applied. Total rules applied 25554 place count 3535 transition count 4444
Applied a total of 25554 rules in 491 ms. Remains 3535 /30831 variables (removed 27296) and now considering 4444/31114 (removed 26670) transitions.
// Phase 1: matrix 4444 rows 3535 cols
[2022-05-16 13:02:53] [INFO ] Computed 101 place invariants in 10 ms
[2022-05-16 13:02:55] [INFO ] Implicit Places using invariants in 1348 ms returned [1212, 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254, 1255, 1256, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303, 1304, 1305, 1306, 1307, 1308, 1309, 1310, 1311, 1312]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 1365 ms to find 101 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3434/30831 places, 4444/31114 transitions.
Drop transitions removed 1111 transitions
Trivial Post-agglo rules discarded 1111 transitions
Performed 1111 trivial Post agglomeration. Transition count delta: 1111
Iterating post reduction 0 with 1111 rules applied. Total rules applied 1111 place count 3434 transition count 3333
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 1 with 1111 rules applied. Total rules applied 2222 place count 2323 transition count 3333
Applied a total of 2222 rules in 78 ms. Remains 2323 /3434 variables (removed 1111) and now considering 3333/4444 (removed 1111) transitions.
// Phase 1: matrix 3333 rows 2323 cols
[2022-05-16 13:02:55] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 13:02:55] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 3333 rows 2323 cols
[2022-05-16 13:02:55] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-16 13:02:56] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2323/30831 places, 3333/31114 transitions.
Finished structural reductions, in 2 iterations. Remains : 2323/30831 places, 3333/31114 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s1212 s1213 s1214 s1215 s1216 s1217 s1218 s1219 s1220 s1221 s1222 s1223 s1224 s1225 s1226 s1227 s1228 s1229 s1230 s1231 s1232 s1233 s1234 s...], 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 1893 reset in 5926 ms.
Product exploration explored 100000 steps with 1914 reset in 5962 ms.
Computed a total of 2323 stabilizing places and 3333 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2323 transition count 3333
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 69 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 3333 rows 2323 cols
[2022-05-16 13:03:32] [INFO ] Computed 0 place invariants in 4 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-12 finished in 52750 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1111 out of 30831 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Graph (complete) has 42218 edges and 30831 vertex of which 6969 are kept as prefixes of interest. Removing 23862 places using SCC suffix rule.24 ms
Discarding 23862 places :
Also discarding 23236 output transitions
Drop transitions removed 23236 transitions
Reduce places removed 101 places and 101 transitions.
Drop transitions removed 3333 transitions
Trivial Post-agglo rules discarded 3333 transitions
Performed 3333 trivial Post agglomeration. Transition count delta: 3333
Iterating post reduction 0 with 3333 rules applied. Total rules applied 3334 place count 6868 transition count 4444
Reduce places removed 3333 places and 0 transitions.
Iterating post reduction 1 with 3333 rules applied. Total rules applied 6667 place count 3535 transition count 4444
Applied a total of 6667 rules in 287 ms. Remains 3535 /30831 variables (removed 27296) and now considering 4444/31114 (removed 26670) transitions.
// Phase 1: matrix 4444 rows 3535 cols
[2022-05-16 13:03:46] [INFO ] Computed 101 place invariants in 12 ms
[2022-05-16 13:03:47] [INFO ] Implicit Places using invariants in 1352 ms returned [1212, 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254, 1255, 1256, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303, 1304, 1305, 1306, 1307, 1308, 1309, 1310, 1311, 1312]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 1356 ms to find 101 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3434/30831 places, 4444/31114 transitions.
Drop transitions removed 1111 transitions
Trivial Post-agglo rules discarded 1111 transitions
Performed 1111 trivial Post agglomeration. Transition count delta: 1111
Iterating post reduction 0 with 1111 rules applied. Total rules applied 1111 place count 3434 transition count 3333
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 1 with 1111 rules applied. Total rules applied 2222 place count 2323 transition count 3333
Applied a total of 2222 rules in 81 ms. Remains 2323 /3434 variables (removed 1111) and now considering 3333/4444 (removed 1111) transitions.
// Phase 1: matrix 3333 rows 2323 cols
[2022-05-16 13:03:47] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 13:03:48] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 3333 rows 2323 cols
[2022-05-16 13:03:48] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-16 13:03:48] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2323/30831 places, 3333/31114 transitions.
Finished structural reductions, in 2 iterations. Remains : 2323/30831 places, 3333/31114 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s1212 s1213 s1214 s1215 s1216 s1217 s1218 s1219 s1220 s1221 s1222 s1223 s1224 s1225 s1226 s1227 s1228 s1229 s1230 s1231 s1232 s1233 s1234 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 303 steps with 0 reset in 16 ms.
FORMULA FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-14 finished in 2451 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(p0)||p1))&&F((!G((p0 U p1)) U p2)))))'
Support contains 1414 out of 30831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Discarding 1313 places :
Implicit places reduction removed 1313 places
Iterating post reduction 0 with 1313 rules applied. Total rules applied 1313 place count 29518 transition count 31114
Applied a total of 1313 rules in 187 ms. Remains 29518 /30831 variables (removed 1313) and now considering 31114/31114 (removed 0) transitions.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:03:50] [INFO ] Computed 1520 place invariants in 1281 ms
[2022-05-16 13:03:52] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:03:52] [INFO ] Implicit Places using invariants in 3379 ms returned []
Implicit Place search using SMT only with invariants took 3381 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:03:53] [INFO ] Computed 1520 place invariants in 1251 ms
[2022-05-16 13:03:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:03:55] [INFO ] Dead Transitions using invariants and state equation in 3347 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29518/30831 places, 31114/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/30831 places, 31114/31114 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 (ADD s22133 s22134 s22135 s22136 s22137 s22138 s22139 s22140 s22141 s22142 s22143 s22144 s22145 s22146 s22147 s22148 s22149 s22150 s22151 s22152...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 119 reset in 2247 ms.
Product exploration explored 100000 steps with 110 reset in 2314 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 p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT p2))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 653 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Finished random walk after 2810 steps, including 0 resets, run visited all 5 properties in 204 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT p2))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : [(F p2), (F p1), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 15 factoid took 622 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:04:39] [INFO ] Computed 1520 place invariants in 1214 ms
Could not prove EG (NOT p2)
Support contains 1414 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 122 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 13:04:55] [INFO ] Computed 1520 place invariants in 1145 ms
[2022-05-16 13:04:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:04:57] [INFO ] Implicit Places using invariants in 3212 ms returned []
Implicit Place search using SMT only with invariants took 3213 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:04:59] [INFO ] Computed 1520 place invariants in 1120 ms
[2022-05-16 13:05:01] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:05:01] [INFO ] Dead Transitions using invariants and state equation in 3213 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 : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT p2))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 459 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Finished random walk after 2679 steps, including 0 resets, run visited all 5 properties in 135 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT p2))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2), (F p1), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 498 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:05:38] [INFO ] Computed 1520 place invariants in 1108 ms
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 59 reset in 2226 ms.
Product exploration explored 100000 steps with 60 reset in 2291 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Support contains 1414 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 27489 are kept as prefixes of interest. Removing 2029 places using SCC suffix rule.29 ms
Discarding 2029 places :
Also discarding 1925 output transitions
Drop transitions removed 1925 transitions
Performed 9393 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9393 rules applied. Total rules applied 9394 place count 27489 transition count 29189
Performed 6161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6161 Pre rules applied. Total rules applied 9394 place count 27489 transition count 29896
Deduced a syphon composed of 15554 places in 28 ms
Iterating global reduction 1 with 6161 rules applied. Total rules applied 15555 place count 27489 transition count 29896
Performed 2323 Post agglomeration using F-continuation condition.Transition count delta: -1010
Deduced a syphon composed of 17877 places in 48 ms
Iterating global reduction 1 with 2323 rules applied. Total rules applied 17878 place count 27489 transition count 30906
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -2525
Deduced a syphon composed of 17978 places in 13 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 17979 place count 27489 transition count 33431
Discarding 303 places :
Symmetric choice reduction at 1 with 303 rule applications. Total rules 18282 place count 27186 transition count 31613
Deduced a syphon composed of 17675 places in 11 ms
Iterating global reduction 1 with 303 rules applied. Total rules applied 18585 place count 27186 transition count 31613
Deduced a syphon composed of 17675 places in 11 ms
Applied a total of 18585 rules in 12371 ms. Remains 27186 /29518 variables (removed 2332) and now considering 31613/31114 (removed -499) transitions.
// Phase 1: matrix 31613 rows 27186 cols
[2022-05-16 13:06:14] [INFO ] Computed 1315 place invariants in 3700 ms
[2022-05-16 13:06:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:06:16] [INFO ] Dead Transitions using invariants and state equation in 5673 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27186/29518 places, 31613/31114 transitions.
Finished structural reductions, in 1 iterations. Remains : 27186/29518 places, 31613/31114 transitions.
Product exploration explored 100000 steps with 278 reset in 3341 ms.
Product exploration explored 100000 steps with 282 reset in 3465 ms.
Built C files in :
/tmp/ltsmin5026346917423933209
[2022-05-16 13:06:23] [INFO ] Built C files in 201ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5026346917423933209
Running compilation step : cd /tmp/ltsmin5026346917423933209;'/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/ltsmin5026346917423933209;'/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/ltsmin5026346917423933209;'/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 1414 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 241 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 13:06:28] [INFO ] Computed 1520 place invariants in 1515 ms
[2022-05-16 13:06:31] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:06:31] [INFO ] Implicit Places using invariants in 4606 ms returned []
Implicit Place search using SMT only with invariants took 4606 ms to find 0 implicit places.
// Phase 1: matrix 31114 rows 29518 cols
[2022-05-16 13:06:32] [INFO ] Computed 1520 place invariants in 1390 ms
[2022-05-16 13:06:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:06:35] [INFO ] Dead Transitions using invariants and state equation in 4336 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29518/29518 places, 31114/31114 transitions.
Built C files in :
/tmp/ltsmin5226929228291161517
[2022-05-16 13:06:36] [INFO ] Built C files in 170ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5226929228291161517
Running compilation step : cd /tmp/ltsmin5226929228291161517;'/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/ltsmin5226929228291161517;'/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/ltsmin5226929228291161517;'/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 13:06:41] [INFO ] Flatten gal took : 1120 ms
[2022-05-16 13:06:42] [INFO ] Flatten gal took : 1155 ms
[2022-05-16 13:06:42] [INFO ] Time to serialize gal into /tmp/LTL12145646949482038952.gal : 86 ms
[2022-05-16 13:06:42] [INFO ] Time to serialize properties into /tmp/LTL10646216971962931295.ltl : 3 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/LTL12145646949482038952.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10646216971962931295.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/LTL1214564...268
Read 1 LTL properties
Detected timeout of ITS tools.
[2022-05-16 13:06:59] [INFO ] Flatten gal took : 1561 ms
[2022-05-16 13:06:59] [INFO ] Applying decomposition
[2022-05-16 13:07:00] [INFO ] Flatten gal took : 1111 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/graph13923153962199999210.txt' '-o' '/tmp/graph13923153962199999210.bin' '-w' '/tmp/graph13923153962199999210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13923153962199999210.bin' '-l' '-1' '-v' '-w' '/tmp/graph13923153962199999210.weights' '-q' '0' '-e' '0.001'
[2022-05-16 13:07:08] [INFO ] Decomposing Gal with order
[2022-05-16 13:07:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 13:12:43] [INFO ] Removed a total of 10143 redundant transitions.
[2022-05-16 13:12:43] [INFO ] Flatten gal took : 8688 ms
[2022-05-16 13:12:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2199 labels/synchronizations in 303 ms.
[2022-05-16 13:12:58] [INFO ] Time to serialize gal into /tmp/LTL2340141346277276133.gal : 206 ms
[2022-05-16 13:12:58] [INFO ] Time to serialize properties into /tmp/LTL11378642299016256412.ltl : 26 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/LTL2340141346277276133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11378642299016256412.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/LTL2340141...267
Read 1 LTL properties
Checking formula 0 : !((F((G((X("((((((((gu1320.l8_0+gu1320.l8_1)+(gu1320.l8_2+gu1320.l8_3))+((gu1320.l8_4+gu1320.l8_5)+(gu1320.l8_6+gu1320.l8_7)))+(((gu13...48717
Formula 0 simplified : !F(G("((((((((gi104.gu7733.l14_0+gi104.gu7733.l14_1)+(gi104.gu7733.l14_2+gi104.gu7733.l14_3))+((gi104.gu7733.l14_4+gi104.gu7733.l14_...48701
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15739254801755016145
[2022-05-16 13:13:14] [INFO ] Built C files in 392ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15739254801755016145
Running compilation step : cd /tmp/ltsmin15739254801755016145;'/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/ltsmin15739254801755016145;'/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/ltsmin15739254801755016145;'/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-LTLCardinality-15 finished in 568639 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(X((X(p0) U G(p1)))) U !(p2 U p3)))'
Found a CL insensitive property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-05
Stuttering acceptance computed with spot in 208 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Support contains 1212 out of 30831 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Graph (complete) has 42218 edges and 30831 vertex of which 29713 are kept as prefixes of interest. Removing 1118 places using SCC suffix rule.43 ms
Discarding 1118 places :
Also discarding 1117 output transitions
Drop transitions removed 1117 transitions
Discarding 1212 places :
Implicit places reduction removed 1212 places
Drop transitions removed 16160 transitions
Trivial Post-agglo rules discarded 16160 transitions
Performed 16160 trivial Post agglomeration. Transition count delta: 16160
Iterating post reduction 0 with 17372 rules applied. Total rules applied 17373 place count 28501 transition count 13837
Reduce places removed 16160 places and 0 transitions.
Performed 1212 Post agglomeration using F-continuation condition.Transition count delta: 1212
Iterating post reduction 1 with 17372 rules applied. Total rules applied 34745 place count 12341 transition count 12625
Reduce places removed 1212 places and 0 transitions.
Iterating post reduction 2 with 1212 rules applied. Total rules applied 35957 place count 11129 transition count 12625
Performed 2929 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2929 Pre rules applied. Total rules applied 35957 place count 11129 transition count 9696
Deduced a syphon composed of 2929 places in 5 ms
Ensure Unique test removed 1010 places
Reduce places removed 3939 places and 0 transitions.
Iterating global reduction 3 with 6868 rules applied. Total rules applied 42825 place count 7190 transition count 9696
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 3 with 101 rules applied. Total rules applied 42926 place count 7089 transition count 9696
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 42926 place count 7089 transition count 9595
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 43128 place count 6988 transition count 9595
Discarding 2525 places :
Symmetric choice reduction at 4 with 2525 rule applications. Total rules 45653 place count 4463 transition count 7070
Iterating global reduction 4 with 2525 rules applied. Total rules applied 48178 place count 4463 transition count 7070
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 48178 place count 4463 transition count 6969
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 48380 place count 4362 transition count 6969
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 48395 place count 4347 transition count 5454
Iterating global reduction 4 with 15 rules applied. Total rules applied 48410 place count 4347 transition count 5454
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 4 with 101 rules applied. Total rules applied 48511 place count 4246 transition count 5454
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 48511 place count 4246 transition count 5353
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 48713 place count 4145 transition count 5353
Discarding 1010 places :
Symmetric choice reduction at 5 with 1010 rule applications. Total rules 49723 place count 3135 transition count 4343
Iterating global reduction 5 with 1010 rules applied. Total rules applied 50733 place count 3135 transition count 4343
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 5 with 1212 rules applied. Total rules applied 51945 place count 3034 transition count 3232
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 6 with 101 rules applied. Total rules applied 52046 place count 2933 transition count 3232
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 52248 place count 2832 transition count 3131
Applied a total of 52248 rules in 4232 ms. Remains 2832 /30831 variables (removed 27999) and now considering 3131/31114 (removed 27983) transitions.
// Phase 1: matrix 3131 rows 2832 cols
[2022-05-16 13:13:22] [INFO ] Computed 206 place invariants in 45 ms
[2022-05-16 13:13:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:13:22] [INFO ] Implicit Places using invariants in 852 ms returned [1335, 1343, 1367]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 855 ms to find 3 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2829/30831 places, 3131/31114 transitions.
Applied a total of 0 rules in 65 ms. Remains 2829 /2829 variables (removed 0) and now considering 3131/3131 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2829/30831 places, 3131/31114 transitions.
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p3 p1), acceptance={} source=2 dest: 3}, { cond=p3, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GT (ADD s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1023 s1024 s1025 s1026 s1027 s1028 s1029 s1030 s1031 s1032 s1033 s1034 s1035 s103...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 423 reset in 2716 ms.
Product exploration explored 100000 steps with 424 reset in 2764 ms.
Computed a total of 2829 stabilizing places and 3131 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2829 transition count 3131
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p3)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1014 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 251 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Finished random walk after 1044 steps, including 0 resets, run visited all 6 properties in 49 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p3)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p3 p1)), (F (NOT p0)), (F (AND p2 (NOT p3))), (F p1), (F (NOT p3))]
Knowledge based reduction with 16 factoid took 995 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 167 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 321 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
// Phase 1: matrix 3131 rows 2829 cols
[2022-05-16 13:13:32] [INFO ] Computed 203 place invariants in 68 ms
[2022-05-16 13:13:39] [INFO ] [Real]Absence check using 0 positive and 203 generalized place invariants in 526 ms returned sat
[2022-05-16 13:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:13:47] [INFO ] [Real]Absence check using state equation in 8586 ms returned unknown
Could not prove EG p3
Support contains 1212 out of 2829 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2829/2829 places, 3131/3131 transitions.
Applied a total of 0 rules in 74 ms. Remains 2829 /2829 variables (removed 0) and now considering 3131/3131 (removed 0) transitions.
// Phase 1: matrix 3131 rows 2829 cols
[2022-05-16 13:13:47] [INFO ] Computed 203 place invariants in 41 ms
[2022-05-16 13:13:48] [INFO ] Implicit Places using invariants in 1004 ms returned [505, 911, 1316, 1317, 1318, 1319, 1320, 1321, 1322, 1323, 1324, 1325, 1326, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1344, 1345, 1346, 1347, 1348, 1349, 1350, 1351, 1352, 1353, 1354, 1355, 1356, 1357, 1358, 1359, 1360, 1361, 1362, 1363, 1364, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1402, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1413, 2626]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 1007 ms to find 101 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2728/2829 places, 3131/3131 transitions.
Applied a total of 0 rules in 71 ms. Remains 2728 /2728 variables (removed 0) and now considering 3131/3131 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2728/2829 places, 3131/3131 transitions.
Computed a total of 2728 stabilizing places and 3131 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2728 transition count 3131
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X p3)), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 647 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 155 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Finished random walk after 1486 steps, including 0 resets, run visited all 6 properties in 56 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) p0), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X p3)), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p3 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND p3 p1)), (F (NOT p0)), (F (AND p2 (NOT p3))), (F p1), (F (NOT p3))]
Knowledge based reduction with 16 factoid took 757 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 5 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 159 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 166 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
// Phase 1: matrix 3131 rows 2728 cols
[2022-05-16 13:13:51] [INFO ] Computed 102 place invariants in 10 ms
[2022-05-16 13:13:54] [INFO ] [Real]Absence check using 0 positive and 102 generalized place invariants in 207 ms returned sat
[2022-05-16 13:13:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:14:00] [INFO ] [Real]Absence check using state equation in 5664 ms returned sat
[2022-05-16 13:14:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:14:03] [INFO ] [Nat]Absence check using 0 positive and 102 generalized place invariants in 141 ms returned sat
[2022-05-16 13:14:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:14:08] [INFO ] [Nat]Absence check using state equation in 5625 ms returned sat
[2022-05-16 13:14:09] [INFO ] Computed and/alt/rep : 3030/3636/3030 causal constraints (skipped 0 transitions) in 133 ms.
[2022-05-16 13:14:15] [INFO ] Added : 220 causal constraints over 44 iterations in 6774 ms. Result :unknown
Could not prove EG p3
Stuttering acceptance computed with spot in 187 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Product exploration explored 100000 steps with 425 reset in 3753 ms.
Product exploration explored 100000 steps with 421 reset in 3767 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 168 ms :[p3, p1, (AND p1 p3), p1, (AND p1 p0)]
Support contains 1212 out of 2728 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2728/2728 places, 3131/3131 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 2728 transition count 3131
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 202 Pre rules applied. Total rules applied 101 place count 2728 transition count 3131
Deduced a syphon composed of 303 places in 1 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 303 place count 2728 transition count 3131
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 1 with 101 rules applied. Total rules applied 404 place count 2627 transition count 3131
Deduced a syphon composed of 303 places in 1 ms
Applied a total of 404 rules in 120 ms. Remains 2627 /2728 variables (removed 101) and now considering 3131/3131 (removed 0) transitions.
[2022-05-16 13:14:24] [INFO ] Redundant transitions in 299 ms returned []
// Phase 1: matrix 3131 rows 2627 cols
[2022-05-16 13:14:24] [INFO ] Computed 1 place invariants in 13 ms
[2022-05-16 13:14:25] [INFO ] Dead Transitions using invariants and state equation in 1425 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2627/2728 places, 3131/3131 transitions.
Finished structural reductions, in 1 iterations. Remains : 2627/2728 places, 3131/3131 transitions.
Product exploration explored 100000 steps with 545 reset in 2597 ms.
Product exploration explored 100000 steps with 543 reset in 2778 ms.
Built C files in :
/tmp/ltsmin4067189730306814802
[2022-05-16 13:14:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4067189730306814802
Running compilation step : cd /tmp/ltsmin4067189730306814802;'/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/ltsmin4067189730306814802;'/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/ltsmin4067189730306814802;'/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 1212 out of 2728 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2728/2728 places, 3131/3131 transitions.
Applied a total of 0 rules in 101 ms. Remains 2728 /2728 variables (removed 0) and now considering 3131/3131 (removed 0) transitions.
// Phase 1: matrix 3131 rows 2728 cols
[2022-05-16 13:14:34] [INFO ] Computed 102 place invariants in 10 ms
[2022-05-16 13:14:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:14:34] [INFO ] Implicit Places using invariants in 585 ms returned []
// Phase 1: matrix 3131 rows 2728 cols
[2022-05-16 13:14:34] [INFO ] Computed 102 place invariants in 9 ms
[2022-05-16 13:14:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:14:35] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
// Phase 1: matrix 3131 rows 2728 cols
[2022-05-16 13:14:35] [INFO ] Computed 102 place invariants in 9 ms
[2022-05-16 13:14:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:14:37] [INFO ] Dead Transitions using invariants and state equation in 1897 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2728/2728 places, 3131/3131 transitions.
Built C files in :
/tmp/ltsmin9107053036062666847
[2022-05-16 13:14:37] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9107053036062666847
Running compilation step : cd /tmp/ltsmin9107053036062666847;'/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/ltsmin9107053036062666847;'/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/ltsmin9107053036062666847;'/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 13:14:41] [INFO ] Flatten gal took : 59 ms
[2022-05-16 13:14:41] [INFO ] Flatten gal took : 95 ms
[2022-05-16 13:14:41] [INFO ] Time to serialize gal into /tmp/LTL7140828005047785936.gal : 7 ms
[2022-05-16 13:14:41] [INFO ] Time to serialize properties into /tmp/LTL17524662567965890865.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/LTL7140828005047785936.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17524662567965890865.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/LTL7140828...267
Read 1 LTL properties
Checking formula 0 : !(((!(G(X((X("(((((((((((pl0_0+pl0_1)+(pl0_2+pl0_3))+((pl0_4+pl0_5)+(pl0_6+pl0_7)))+(((pl0_8+pl0_9)+(pl0_10+pl0_11))+((pl0_12+pl0_13)+...12307
Formula 0 simplified : !(!GX(X"(((((((((((pl0_0+pl0_1)+(pl0_2+pl0_3))+((pl0_4+pl0_5)+(pl0_6+pl0_7)))+(((pl0_8+pl0_9)+(pl0_10+pl0_11))+((pl0_12+pl0_13)+(pl0...12293
Detected timeout of ITS tools.
[2022-05-16 13:14:56] [INFO ] Flatten gal took : 64 ms
[2022-05-16 13:14:56] [INFO ] Applying decomposition
[2022-05-16 13:14:56] [INFO ] Flatten gal took : 66 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/graph15406154526031573806.txt' '-o' '/tmp/graph15406154526031573806.bin' '-w' '/tmp/graph15406154526031573806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15406154526031573806.bin' '-l' '-1' '-v' '-w' '/tmp/graph15406154526031573806.weights' '-q' '0' '-e' '0.001'
[2022-05-16 13:14:57] [INFO ] Decomposing Gal with order
[2022-05-16 13:14:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 13:14:59] [INFO ] Removed a total of 605 redundant transitions.
[2022-05-16 13:14:59] [INFO ] Flatten gal took : 2287 ms
[2022-05-16 13:14:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 808 labels/synchronizations in 42 ms.
[2022-05-16 13:15:00] [INFO ] Time to serialize gal into /tmp/LTL10505709654731786900.gal : 12 ms
[2022-05-16 13:15:00] [INFO ] Time to serialize properties into /tmp/LTL18070915570067758106.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/LTL10505709654731786900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18070915570067758106.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/LTL1050570...268
Read 1 LTL properties
Checking formula 0 : !(((!(G(X((X("(((((((((((gu4.pl0_0+gu4.pl0_1)+(gu4.pl0_2+gu4.pl0_3))+((gu4.pl0_4+gu4.pl0_5)+(gu4.pl0_6+gu4.pl0_7)))+(((gu4.pl0_8+gu4.p...19983
Formula 0 simplified : !(!GX(X"(((((((((((gu4.pl0_0+gu4.pl0_1)+(gu4.pl0_2+gu4.pl0_3))+((gu4.pl0_4+gu4.pl0_5)+(gu4.pl0_6+gu4.pl0_7)))+(((gu4.pl0_8+gu4.pl0_9...19969
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4769671960845262238
[2022-05-16 13:15:15] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4769671960845262238
Running compilation step : cd /tmp/ltsmin4769671960845262238;'/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/ltsmin4769671960845262238;'/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/ltsmin4769671960845262238;'/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-LTLCardinality-05 finished in 120575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(p0)||p1))&&F((!G((p0 U p1)) U p2)))))'
Found a SL insensitive property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-15
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Support contains 1414 out of 30831 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 30831/30831 places, 31114/31114 transitions.
Graph (complete) has 42218 edges and 30831 vertex of which 28802 are kept as prefixes of interest. Removing 2029 places using SCC suffix rule.49 ms
Discarding 2029 places :
Also discarding 1925 output transitions
Drop transitions removed 1925 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 1313 places :
Implicit places reduction removed 1313 places
Drop transitions removed 14443 transitions
Trivial Post-agglo rules discarded 14443 transitions
Performed 14443 trivial Post agglomeration. Transition count delta: 14443
Iterating post reduction 0 with 15756 rules applied. Total rules applied 15757 place count 27388 transition count 14645
Reduce places removed 14443 places and 0 transitions.
Performed 1313 Post agglomeration using F-continuation condition.Transition count delta: 1313
Iterating post reduction 1 with 15756 rules applied. Total rules applied 31513 place count 12945 transition count 13332
Reduce places removed 1313 places and 0 transitions.
Iterating post reduction 2 with 1313 rules applied. Total rules applied 32826 place count 11632 transition count 13332
Performed 1818 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1818 Pre rules applied. Total rules applied 32826 place count 11632 transition count 11514
Deduced a syphon composed of 1818 places in 5 ms
Ensure Unique test removed 909 places
Reduce places removed 2727 places and 0 transitions.
Iterating global reduction 3 with 4545 rules applied. Total rules applied 37371 place count 8905 transition count 11514
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 37977 place count 8905 transition count 10908
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 38583 place count 8299 transition count 10908
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 101 Pre rules applied. Total rules applied 38583 place count 8299 transition count 10807
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 38785 place count 8198 transition count 10807
Discarding 3030 places :
Symmetric choice reduction at 5 with 3030 rule applications. Total rules 41815 place count 5168 transition count 7777
Iterating global reduction 5 with 3030 rules applied. Total rules applied 44845 place count 5168 transition count 7777
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 44946 place count 5168 transition count 7676
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 6 with 101 rules applied. Total rules applied 45047 place count 5067 transition count 7676
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 202 Pre rules applied. Total rules applied 45047 place count 5067 transition count 7474
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 45451 place count 4865 transition count 7474
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 45466 place count 4850 transition count 5959
Iterating global reduction 7 with 15 rules applied. Total rules applied 45481 place count 4850 transition count 5959
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 7 with 909 rules applied. Total rules applied 46390 place count 4547 transition count 5353
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 8 with 101 rules applied. Total rules applied 46491 place count 4446 transition count 5353
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 46491 place count 4446 transition count 5252
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 46693 place count 4345 transition count 5252
Applied a total of 46693 rules in 3724 ms. Remains 4345 /30831 variables (removed 26486) and now considering 5252/31114 (removed 25862) transitions.
// Phase 1: matrix 5252 rows 4345 cols
[2022-05-16 13:15:22] [INFO ] Computed 103 place invariants in 63 ms
[2022-05-16 13:15:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 13:15:23] [INFO ] Implicit Places using invariants in 1625 ms returned [1330, 1361, 1392, 1402, 1413]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1627 ms to find 5 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 4340/30831 places, 5252/31114 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 4340 transition count 5197
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 4285 transition count 5197
Applied a total of 110 rules in 222 ms. Remains 4285 /4340 variables (removed 55) and now considering 5197/5252 (removed 55) transitions.
// Phase 1: matrix 5197 rows 4285 cols
[2022-05-16 13:15:24] [INFO ] Computed 98 place invariants in 81 ms
[2022-05-16 13:15:25] [INFO ] Implicit Places using invariants in 1597 ms returned [1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303, 1304, 1305, 1306, 1307, 1308, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1317, 1318, 1319, 1320, 1321, 1322, 1323, 1324, 1325, 1326, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1344, 1345, 1346, 1347, 1348, 1349, 1350, 1351, 1352, 1353, 3879, 4183]
Discarding 98 places :
Implicit Place search using SMT only with invariants took 1601 ms to find 98 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 4187/30831 places, 5197/31114 transitions.
Drop transitions removed 1056 transitions
Trivial Post-agglo rules discarded 1056 transitions
Performed 1056 trivial Post agglomeration. Transition count delta: 1056
Iterating post reduction 0 with 1056 rules applied. Total rules applied 1056 place count 4187 transition count 4141
Reduce places removed 1056 places and 0 transitions.
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Iterating post reduction 1 with 1258 rules applied. Total rules applied 2314 place count 3131 transition count 3939
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 2 with 202 rules applied. Total rules applied 2516 place count 2929 transition count 3939
Applied a total of 2516 rules in 140 ms. Remains 2929 /4187 variables (removed 1258) and now considering 3939/5197 (removed 1258) transitions.
// Phase 1: matrix 3939 rows 2929 cols
[2022-05-16 13:15:25] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-16 13:15:26] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 3939 rows 2929 cols
[2022-05-16 13:15:26] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-16 13:15:26] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 3 : 2929/30831 places, 3939/31114 transitions.
Finished structural reductions, in 3 iterations. Remains : 2929/30831 places, 3939/31114 transitions.
Running random walk in product with property : FamilyReunion-COL-L00100M0010C005P005G002-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 (ADD s2727 s2728 s2729 s2730 s2731 s2732 s2733 s2734 s2735 s2736 s2737 s2738 s2739 s2740 s2741 s2742 s2743 s2744 s2745 s2746 s2747 s2748 s2749 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 933 reset in 2097 ms.
Product exploration explored 100000 steps with 837 reset in 2156 ms.
Computed a total of 2929 stabilizing places and 3939 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2929 transition count 3939
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT p2))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 544 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Finished random walk after 900 steps, including 0 resets, run visited all 5 properties in 39 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT p2))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : [(F p2), (F p1), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 15 factoid took 675 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
// Phase 1: matrix 3939 rows 2929 cols
[2022-05-16 13:16:52] [INFO ] Computed 0 place invariants in 8 ms
[2022-05-16 13:16:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:16:55] [INFO ] [Real]Absence check using state equation in 1416 ms returned sat
[2022-05-16 13:16:55] [INFO ] Computed and/alt/rep : 2727/2727/2727 causal constraints (skipped 101 transitions) in 192 ms.
[2022-05-16 13:17:07] [INFO ] Added : 365 causal constraints over 73 iterations in 12108 ms. Result :unknown
Could not prove EG (NOT p2)
Support contains 1414 out of 2929 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2929/2929 places, 3939/3939 transitions.
Applied a total of 0 rules in 73 ms. Remains 2929 /2929 variables (removed 0) and now considering 3939/3939 (removed 0) transitions.
// Phase 1: matrix 3939 rows 2929 cols
[2022-05-16 13:17:07] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-16 13:17:08] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 3939 rows 2929 cols
[2022-05-16 13:17:08] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-16 13:17:08] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
// Phase 1: matrix 3939 rows 2929 cols
[2022-05-16 13:17:08] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-16 13:17:10] [INFO ] Dead Transitions using invariants and state equation in 1659 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2929/2929 places, 3939/3939 transitions.
Computed a total of 2929 stabilizing places and 3939 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2929 transition count 3939
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 (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT p2))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 421 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Finished random walk after 338 steps, including 0 resets, run visited all 5 properties in 35 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT p2))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2), (F p1), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 625 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
// Phase 1: matrix 3939 rows 2929 cols
[2022-05-16 13:18:30] [INFO ] Computed 0 place invariants in 34 ms
[2022-05-16 13:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:18:33] [INFO ] [Real]Absence check using state equation in 1376 ms returned sat
[2022-05-16 13:18:33] [INFO ] Computed and/alt/rep : 2727/2727/2727 causal constraints (skipped 101 transitions) in 145 ms.
[2022-05-16 13:18:46] [INFO ] Added : 365 causal constraints over 73 iterations in 12187 ms. Result :unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 608 reset in 2057 ms.
Product exploration explored 100000 steps with 632 reset in 2158 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Support contains 1414 out of 2929 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2929/2929 places, 3939/3939 transitions.
Applied a total of 0 rules in 66 ms. Remains 2929 /2929 variables (removed 0) and now considering 3939/3939 (removed 0) transitions.
[2022-05-16 13:18:50] [INFO ] Redundant transitions in 176 ms returned []
// Phase 1: matrix 3939 rows 2929 cols
[2022-05-16 13:18:50] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-16 13:18:52] [INFO ] Dead Transitions using invariants and state equation in 1881 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2929/2929 places, 3939/3939 transitions.
Product exploration explored 100000 steps with 645 reset in 2319 ms.
Product exploration explored 100000 steps with 628 reset in 2250 ms.
Built C files in :
/tmp/ltsmin11220333187727165803
[2022-05-16 13:18:57] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11220333187727165803
Running compilation step : cd /tmp/ltsmin11220333187727165803;'/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/ltsmin11220333187727165803;'/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/ltsmin11220333187727165803;'/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 1414 out of 2929 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2929/2929 places, 3939/3939 transitions.
Applied a total of 0 rules in 94 ms. Remains 2929 /2929 variables (removed 0) and now considering 3939/3939 (removed 0) transitions.
// Phase 1: matrix 3939 rows 2929 cols
[2022-05-16 13:19:00] [INFO ] Computed 0 place invariants in 7 ms
[2022-05-16 13:19:00] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 3939 rows 2929 cols
[2022-05-16 13:19:00] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-16 13:19:01] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
// Phase 1: matrix 3939 rows 2929 cols
[2022-05-16 13:19:01] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-16 13:19:03] [INFO ] Dead Transitions using invariants and state equation in 2158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2929/2929 places, 3939/3939 transitions.
Built C files in :
/tmp/ltsmin14162359856933312545
[2022-05-16 13:19:03] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14162359856933312545
Running compilation step : cd /tmp/ltsmin14162359856933312545;'/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/ltsmin14162359856933312545;'/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/ltsmin14162359856933312545;'/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 13:19:07] [INFO ] Flatten gal took : 156 ms
[2022-05-16 13:19:07] [INFO ] Flatten gal took : 143 ms
[2022-05-16 13:19:07] [INFO ] Time to serialize gal into /tmp/LTL4325871611666984220.gal : 8 ms
[2022-05-16 13:19:07] [INFO ] Time to serialize properties into /tmp/LTL12286074749825468047.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/LTL4325871611666984220.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12286074749825468047.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/LTL4325871...267
Read 1 LTL properties
Checking formula 0 : !((F((G((X("((((((((l8_0+l8_1)+(l8_2+l8_3))+((l8_4+l8_5)+(l8_6+l8_7)))+(((l8_8+l8_9)+(l8_10+l8_11))+((l8_12+l8_13)+(l8_14+l8_15))))+((...26598
Formula 0 simplified : !F(G("((((((((l14_0+l14_1)+(l14_2+l14_3))+((l14_4+l14_5)+(l14_6+l14_7)))+(((l14_8+l14_9)+(l14_10+l14_11))+((l14_12+l14_13)+(l14_14+l...26582
Detected timeout of ITS tools.
[2022-05-16 13:19:22] [INFO ] Flatten gal took : 103 ms
[2022-05-16 13:19:22] [INFO ] Applying decomposition
[2022-05-16 13:19:22] [INFO ] Flatten gal took : 165 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/graph12727002592820093157.txt' '-o' '/tmp/graph12727002592820093157.bin' '-w' '/tmp/graph12727002592820093157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12727002592820093157.bin' '-l' '-1' '-v' '-w' '/tmp/graph12727002592820093157.weights' '-q' '0' '-e' '0.001'
[2022-05-16 13:19:26] [INFO ] Decomposing Gal with order
[2022-05-16 13:19:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 13:19:27] [INFO ] Flatten gal took : 1072 ms
[2022-05-16 13:19:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-16 13:19:27] [INFO ] Time to serialize gal into /tmp/LTL6881996127966163723.gal : 10 ms
[2022-05-16 13:19:27] [INFO ] Time to serialize properties into /tmp/LTL10292318684041888003.ltl : 24 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/LTL6881996127966163723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10292318684041888003.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/LTL6881996...267
Read 1 LTL properties
Checking formula 0 : !((F((G((X("((((((((gu102.l8_0+gu102.l8_1)+(gu102.l8_2+gu102.l8_3))+((gu102.l8_4+gu102.l8_5)+(gu102.l8_6+gu102.l8_7)))+(((gu102.l8_8+g...42859
Formula 0 simplified : !F(G("((((((((gu103.l14_0+gu103.l14_1)+(gu103.l14_2+gu103.l14_3))+((gu103.l14_4+gu103.l14_5)+(gu103.l14_6+gu103.l14_7)))+(((gu103.l1...42843
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15518382042256454017
[2022-05-16 13:19:42] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15518382042256454017
Running compilation step : cd /tmp/ltsmin15518382042256454017;'/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/ltsmin15518382042256454017;'/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/ltsmin15518382042256454017;'/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-LTLCardinality-15 finished in 267659 ms.
[2022-05-16 13:19:46] [INFO ] Flatten gal took : 787 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10483791695970024647
[2022-05-16 13:19:46] [INFO ] Too many transitions (31114) to apply POR reductions. Disabling POR matrices.
[2022-05-16 13:19:47] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10483791695970024647
Running compilation step : cd /tmp/ltsmin10483791695970024647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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'
[2022-05-16 13:19:47] [INFO ] Applying decomposition
[2022-05-16 13:19:48] [INFO ] Flatten gal took : 1177 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/graph11173465747415754940.txt' '-o' '/tmp/graph11173465747415754940.bin' '-w' '/tmp/graph11173465747415754940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11173465747415754940.bin' '-l' '-1' '-v' '-w' '/tmp/graph11173465747415754940.weights' '-q' '0' '-e' '0.001'
[2022-05-16 13:19:56] [INFO ] Decomposing Gal with order
[2022-05-16 13:20:04] [INFO ] Rewriting arrays to variables to allow decomposition.
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/ltsmin10483791695970024647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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 240 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10483791695970024647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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 240 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 13:24:18] [INFO ] Removed a total of 10341 redundant transitions.
[2022-05-16 13:24:18] [INFO ] Flatten gal took : 14185 ms
[2022-05-16 13:24:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 6144 labels/synchronizations in 1041 ms.
[2022-05-16 13:24:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality6295688081241215063.gal : 155 ms
[2022-05-16 13:24:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality17047279581017984552.ltl : 2 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/LTLCardinality6295688081241215063.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17047279581017984552.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/LTLCardina...289
Read 3 LTL properties
Checking formula 0 : !((G(F("((((((((gu6591.l15_0+gu6591.l15_1)+(gu6591.l15_2+gu6591.l15_3))+((gu6591.l15_4+gu6591.l15_5)+(gu6591.l15_6+gu6591.l15_7)))+(((...19415
Formula 0 simplified : !GF"((((((((gu6591.l15_0+gu6591.l15_1)+(gu6591.l15_2+gu6591.l15_3))+((gu6591.l15_4+gu6591.l15_5)+(gu6591.l15_6+gu6591.l15_7)))+(((gu...19409

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110600643"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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