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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 8.0K Apr 30 08:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 30 08:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 08:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 30 08:15 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.8K May 9 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 135K 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-L00020M0002C001P001G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652700608759

Running Version 202205111006
[2022-05-16 11:30:09] [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 11:30:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 11:30:09] [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 11:30:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 11:30:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 646 ms
[2022-05-16 11:30:10] [INFO ] Detected 5 constant HL places corresponding to 11 PT places.
[2022-05-16 11:30:10] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 3292 PT places and 2774.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 11:30:10] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 6 ms.
[2022-05-16 11:30:10] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-04 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 15 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 10004 steps, including 7 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 31) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 99 cols
[2022-05-16 11:30:10] [INFO ] Computed 33 place invariants in 18 ms
[2022-05-16 11:30:11] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2022-05-16 11:30:11] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-16 11:30:11] [INFO ] After 30ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 11:30:11] [INFO ] After 44ms 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 11:30:11] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 214 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=107 )
Parikh walk visited 1 properties in 2 ms.
[2022-05-16 11:30:11] [INFO ] Flatten gal took : 25 ms
[2022-05-16 11:30:11] [INFO ] Flatten gal took : 9 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
[2022-05-16 11:30:11] [INFO ] Unfolded HLPN to a Petri net with 3095 places and 2438 transitions 6997 arcs in 32 ms.
[2022-05-16 11:30:11] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Deduced a syphon composed of 21 places in 17 ms
Reduce places removed 30 places and 0 transitions.
Support contains 1287 out of 3065 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3065/3065 places, 2438/2438 transitions.
Reduce places removed 51 places and 0 transitions.
Discarding 315 places :
Implicit places reduction removed 315 places
Iterating post reduction 0 with 366 rules applied. Total rules applied 366 place count 2699 transition count 2438
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 386 place count 2679 transition count 2418
Iterating global reduction 1 with 20 rules applied. Total rules applied 406 place count 2679 transition count 2418
Applied a total of 406 rules in 308 ms. Remains 2679 /3065 variables (removed 386) and now considering 2418/2438 (removed 20) transitions.
// Phase 1: matrix 2418 rows 2679 cols
[2022-05-16 11:30:11] [INFO ] Computed 405 place invariants in 72 ms
[2022-05-16 11:30:13] [INFO ] Implicit Places using invariants in 2095 ms returned [462, 1346, 1431, 1432, 1433, 1434, 1435, 1436, 1437, 1438, 1439, 1440, 1441, 1442, 1443, 1444, 1445, 1446, 1447, 1448, 1449, 1450, 1451, 1813, 1814, 1815, 1816, 1817, 1818, 1819, 1820, 1821, 1822, 1823, 1824, 1825, 1826, 1827, 1828, 1829, 1830, 1831, 1832, 1833, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2427, 2428, 2429, 2430, 2431, 2432, 2433, 2434, 2435, 2436, 2437, 2438, 2439, 2440, 2441, 2442, 2443, 2444, 2445, 2446, 2447]
Discarding 86 places :
Implicit Place search using SMT only with invariants took 2101 ms to find 86 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2593/3065 places, 2418/2438 transitions.
Applied a total of 0 rules in 64 ms. Remains 2593 /2593 variables (removed 0) and now considering 2418/2418 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2593/3065 places, 2418/2438 transitions.
Support contains 1287 out of 2593 places after structural reductions.
[2022-05-16 11:30:14] [INFO ] Flatten gal took : 139 ms
[2022-05-16 11:30:14] [INFO ] Flatten gal took : 102 ms
[2022-05-16 11:30:14] [INFO ] Input system was already deterministic with 2418 transitions.
Support contains 1203 out of 2593 places (down from 1287) after GAL structural reductions.
Finished random walk after 1031 steps, including 0 resets, run visited all 27 properties in 62 ms. (steps per millisecond=16 )
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2593 stabilizing places and 2418 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2593 transition count 2418
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' '!(X((G(F(!F(G(X(p0))))) U G((G(p1)||p1)))))'
Support contains 126 out of 2593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 147 places :
Implicit places reduction removed 147 places
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 2424 transition count 2418
Discarding 169 places :
Symmetric choice reduction at 1 with 169 rule applications. Total rules 338 place count 2255 transition count 2249
Iterating global reduction 1 with 169 rules applied. Total rules applied 507 place count 2255 transition count 2249
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 591 place count 2171 transition count 2145
Iterating global reduction 1 with 84 rules applied. Total rules applied 675 place count 2171 transition count 2145
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 737 place count 2109 transition count 2063
Iterating global reduction 1 with 62 rules applied. Total rules applied 799 place count 2109 transition count 2063
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 821 place count 2087 transition count 2001
Iterating global reduction 1 with 22 rules applied. Total rules applied 843 place count 2087 transition count 2001
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 905 place count 2025 transition count 1939
Iterating global reduction 1 with 62 rules applied. Total rules applied 967 place count 2025 transition count 1939
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1029 place count 1963 transition count 1877
Iterating global reduction 1 with 62 rules applied. Total rules applied 1091 place count 1963 transition count 1877
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1153 place count 1901 transition count 1815
Iterating global reduction 1 with 62 rules applied. Total rules applied 1215 place count 1901 transition count 1815
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1235 place count 1881 transition count 1795
Iterating global reduction 1 with 20 rules applied. Total rules applied 1255 place count 1881 transition count 1795
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1275 place count 1861 transition count 1775
Iterating global reduction 1 with 20 rules applied. Total rules applied 1295 place count 1861 transition count 1775
Applied a total of 1295 rules in 2058 ms. Remains 1861 /2593 variables (removed 732) and now considering 1775/2418 (removed 643) transitions.
// Phase 1: matrix 1775 rows 1861 cols
[2022-05-16 11:30:16] [INFO ] Computed 150 place invariants in 23 ms
[2022-05-16 11:30:17] [INFO ] Implicit Places using invariants in 399 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 1061, 1608]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 402 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1838/2593 places, 1775/2418 transitions.
Applied a total of 0 rules in 71 ms. Remains 1838 /1838 variables (removed 0) and now considering 1775/1775 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1838/2593 places, 1775/2418 transitions.
Stuttering acceptance computed with spot in 635 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 (ADD s822 s823 s824 s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835 s836 s837 s838 s839 s840 s841 s842 s843 s844 s845 s846 s847 s848 s849...], 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 337 reset in 523 ms.
Product exploration explored 100000 steps with 392 reset in 363 ms.
Computed a total of 1838 stabilizing places and 1775 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1838 transition count 1775
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 353 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Finished random walk after 465 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (AND p1 p0)), (F p1), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 482 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
// Phase 1: matrix 1775 rows 1838 cols
[2022-05-16 11:30:20] [INFO ] Computed 127 place invariants in 13 ms
[2022-05-16 11:30:21] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 65 ms returned sat
[2022-05-16 11:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:30:23] [INFO ] [Real]Absence check using state equation in 2049 ms returned sat
[2022-05-16 11:30:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:30:24] [INFO ] [Nat]Absence check using 0 positive and 127 generalized place invariants in 62 ms returned sat
[2022-05-16 11:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:30:26] [INFO ] [Nat]Absence check using state equation in 1788 ms returned sat
[2022-05-16 11:30:26] [INFO ] Computed and/alt/rep : 1752/1942/1752 causal constraints (skipped 2 transitions) in 98 ms.
[2022-05-16 11:30:29] [INFO ] Added : 189 causal constraints over 38 iterations in 3429 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 1775 rows 1838 cols
[2022-05-16 11:30:29] [INFO ] Computed 127 place invariants in 7 ms
[2022-05-16 11:30:30] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 77 ms returned sat
[2022-05-16 11:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:30:32] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2022-05-16 11:30:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:30:32] [INFO ] [Nat]Absence check using 0 positive and 127 generalized place invariants in 70 ms returned sat
[2022-05-16 11:30:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:30:34] [INFO ] [Nat]Absence check using state equation in 1531 ms returned sat
[2022-05-16 11:30:34] [INFO ] Computed and/alt/rep : 1752/1942/1752 causal constraints (skipped 2 transitions) in 86 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 11:30:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG p0
Could not prove EG p0
Support contains 126 out of 1838 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1838/1838 places, 1775/1775 transitions.
Graph (complete) has 2069 edges and 1838 vertex of which 1638 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.9 ms
Discarding 200 places :
Also discarding 179 output transitions
Drop transitions removed 179 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 987 transitions
Trivial Post-agglo rules discarded 987 transitions
Performed 987 trivial Post agglomeration. Transition count delta: 987
Iterating post reduction 0 with 987 rules applied. Total rules applied 988 place count 1617 transition count 588
Reduce places removed 987 places and 0 transitions.
Iterating post reduction 1 with 987 rules applied. Total rules applied 1975 place count 630 transition count 588
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 210 Pre rules applied. Total rules applied 1975 place count 630 transition count 378
Deduced a syphon composed of 210 places in 0 ms
Ensure Unique test removed 84 places
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 2479 place count 336 transition count 378
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 2500 place count 315 transition count 378
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 2500 place count 315 transition count 357
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2542 place count 294 transition count 357
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2584 place count 273 transition count 378
Applied a total of 2584 rules in 84 ms. Remains 273 /1838 variables (removed 1565) and now considering 378/1775 (removed 1397) transitions.
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 11:30:47] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:30:47] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 11:30:47] [INFO ] Computed 0 place invariants in 13 ms
[2022-05-16 11:30:47] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2022-05-16 11:30:47] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 11:30:47] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:30:47] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 273/1838 places, 378/1775 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/1838 places, 378/1775 transitions.
Computed a total of 273 stabilizing places and 378 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 273 transition count 378
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 955 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Finished random walk after 30 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (AND p1 p0)), (F p1), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 532 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 11:30:49] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:30:49] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2022-05-16 11:30:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:30:50] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2022-05-16 11:30:50] [INFO ] Computed and/alt/rep : 315/420/315 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-16 11:30:50] [INFO ] Added : 0 causal constraints over 0 iterations in 47 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 378 rows 273 cols
[2022-05-16 11:30:50] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-16 11:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:30:50] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2022-05-16 11:30:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:30:50] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2022-05-16 11:30:50] [INFO ] Computed and/alt/rep : 315/420/315 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-16 11:30:50] [INFO ] Added : 42 causal constraints over 9 iterations in 216 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) p0), (NOT p1), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 5697 reset in 369 ms.
Stuttering criterion allowed to conclude after 11736 steps with 692 reset in 43 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-00 finished in 36649 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U X(p1)))'
Support contains 42 out of 2593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 147 places :
Implicit places reduction removed 147 places
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 2424 transition count 2418
Discarding 169 places :
Symmetric choice reduction at 1 with 169 rule applications. Total rules 338 place count 2255 transition count 2249
Iterating global reduction 1 with 169 rules applied. Total rules applied 507 place count 2255 transition count 2249
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 591 place count 2171 transition count 2145
Iterating global reduction 1 with 84 rules applied. Total rules applied 675 place count 2171 transition count 2145
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 758 place count 2088 transition count 2042
Iterating global reduction 1 with 83 rules applied. Total rules applied 841 place count 2088 transition count 2042
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 884 place count 2045 transition count 1959
Iterating global reduction 1 with 43 rules applied. Total rules applied 927 place count 2045 transition count 1959
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 989 place count 1983 transition count 1897
Iterating global reduction 1 with 62 rules applied. Total rules applied 1051 place count 1983 transition count 1897
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1113 place count 1921 transition count 1835
Iterating global reduction 1 with 62 rules applied. Total rules applied 1175 place count 1921 transition count 1835
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1237 place count 1859 transition count 1773
Iterating global reduction 1 with 62 rules applied. Total rules applied 1299 place count 1859 transition count 1773
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1361 place count 1797 transition count 1711
Iterating global reduction 1 with 62 rules applied. Total rules applied 1423 place count 1797 transition count 1711
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1485 place count 1735 transition count 1649
Iterating global reduction 1 with 62 rules applied. Total rules applied 1547 place count 1735 transition count 1649
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1589 place count 1693 transition count 1607
Iterating global reduction 1 with 42 rules applied. Total rules applied 1631 place count 1693 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1673 place count 1651 transition count 1565
Iterating global reduction 1 with 42 rules applied. Total rules applied 1715 place count 1651 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1757 place count 1609 transition count 1523
Iterating global reduction 1 with 42 rules applied. Total rules applied 1799 place count 1609 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1841 place count 1567 transition count 1481
Iterating global reduction 1 with 42 rules applied. Total rules applied 1883 place count 1567 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1925 place count 1525 transition count 1439
Iterating global reduction 1 with 42 rules applied. Total rules applied 1967 place count 1525 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 2009 place count 1483 transition count 1397
Iterating global reduction 1 with 42 rules applied. Total rules applied 2051 place count 1483 transition count 1397
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 2093 place count 1441 transition count 1355
Iterating global reduction 1 with 42 rules applied. Total rules applied 2135 place count 1441 transition count 1355
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 2177 place count 1399 transition count 1313
Iterating global reduction 1 with 42 rules applied. Total rules applied 2219 place count 1399 transition count 1313
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 63 rules applied. Total rules applied 2282 place count 1378 transition count 1271
Applied a total of 2282 rules in 1419 ms. Remains 1378 /2593 variables (removed 1215) and now considering 1271/2418 (removed 1147) transitions.
// Phase 1: matrix 1271 rows 1378 cols
[2022-05-16 11:30:52] [INFO ] Computed 129 place invariants in 16 ms
[2022-05-16 11:30:53] [INFO ] Implicit Places using invariants in 279 ms returned [620, 1125]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 280 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1376/2593 places, 1271/2418 transitions.
Applied a total of 0 rules in 38 ms. Remains 1376 /1376 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1376/2593 places, 1271/2418 transitions.
Stuttering acceptance computed with spot in 1449 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s893 s894 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s905 s906 s907 s908 s909 s910 s911 s912 s913 s914 s915 s916 s917 s918 s919 s920...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 458 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-01 finished in 3223 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 42 out of 2593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 147 places :
Implicit places reduction removed 147 places
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 2424 transition count 2418
Discarding 169 places :
Symmetric choice reduction at 1 with 169 rule applications. Total rules 338 place count 2255 transition count 2249
Iterating global reduction 1 with 169 rules applied. Total rules applied 507 place count 2255 transition count 2249
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 591 place count 2171 transition count 2145
Iterating global reduction 1 with 84 rules applied. Total rules applied 675 place count 2171 transition count 2145
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 758 place count 2088 transition count 2042
Iterating global reduction 1 with 83 rules applied. Total rules applied 841 place count 2088 transition count 2042
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 884 place count 2045 transition count 1959
Iterating global reduction 1 with 43 rules applied. Total rules applied 927 place count 2045 transition count 1959
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 989 place count 1983 transition count 1897
Iterating global reduction 1 with 62 rules applied. Total rules applied 1051 place count 1983 transition count 1897
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1113 place count 1921 transition count 1835
Iterating global reduction 1 with 62 rules applied. Total rules applied 1175 place count 1921 transition count 1835
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1237 place count 1859 transition count 1773
Iterating global reduction 1 with 62 rules applied. Total rules applied 1299 place count 1859 transition count 1773
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1361 place count 1797 transition count 1711
Iterating global reduction 1 with 62 rules applied. Total rules applied 1423 place count 1797 transition count 1711
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1485 place count 1735 transition count 1649
Iterating global reduction 1 with 62 rules applied. Total rules applied 1547 place count 1735 transition count 1649
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1589 place count 1693 transition count 1607
Iterating global reduction 1 with 42 rules applied. Total rules applied 1631 place count 1693 transition count 1607
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1673 place count 1651 transition count 1565
Iterating global reduction 1 with 42 rules applied. Total rules applied 1715 place count 1651 transition count 1565
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1757 place count 1609 transition count 1523
Iterating global reduction 1 with 42 rules applied. Total rules applied 1799 place count 1609 transition count 1523
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1841 place count 1567 transition count 1481
Iterating global reduction 1 with 42 rules applied. Total rules applied 1883 place count 1567 transition count 1481
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 1925 place count 1525 transition count 1439
Iterating global reduction 1 with 42 rules applied. Total rules applied 1967 place count 1525 transition count 1439
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 2009 place count 1483 transition count 1397
Iterating global reduction 1 with 42 rules applied. Total rules applied 2051 place count 1483 transition count 1397
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 2093 place count 1441 transition count 1355
Iterating global reduction 1 with 42 rules applied. Total rules applied 2135 place count 1441 transition count 1355
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 2177 place count 1399 transition count 1313
Iterating global reduction 1 with 42 rules applied. Total rules applied 2219 place count 1399 transition count 1313
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 63 rules applied. Total rules applied 2282 place count 1378 transition count 1271
Applied a total of 2282 rules in 1165 ms. Remains 1378 /2593 variables (removed 1215) and now considering 1271/2418 (removed 1147) transitions.
// Phase 1: matrix 1271 rows 1378 cols
[2022-05-16 11:30:55] [INFO ] Computed 129 place invariants in 10 ms
[2022-05-16 11:30:56] [INFO ] Implicit Places using invariants in 261 ms returned [620, 1125]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 263 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1376/2593 places, 1271/2418 transitions.
Applied a total of 0 rules in 43 ms. Remains 1376 /1376 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1376/2593 places, 1271/2418 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-02 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 2 (ADD s977 s978 s979 s980 s981 s982 s983 s984 s985 s986 s987 s988 s989 s990 s991 s992 s993 s994 s995 s996 s997 s998 s999 s1000 s1001 s1002 s1003 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 182 reset in 261 ms.
Product exploration explored 100000 steps with 181 reset in 314 ms.
Computed a total of 1376 stabilizing places and 1271 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1376 transition count 1271
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 538 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=134 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 1271 rows 1376 cols
[2022-05-16 11:30:57] [INFO ] Computed 127 place invariants in 9 ms
[2022-05-16 11:30:58] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 61 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (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 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-02 finished in 3614 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&p1) U X(G(!p1))))'
Support contains 64 out of 2593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Reduce places removed 21 places and 0 transitions.
Discarding 147 places :
Implicit places reduction removed 147 places
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 2425 transition count 2418
Discarding 169 places :
Symmetric choice reduction at 1 with 169 rule applications. Total rules 337 place count 2256 transition count 2249
Iterating global reduction 1 with 169 rules applied. Total rules applied 506 place count 2256 transition count 2249
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 590 place count 2172 transition count 2145
Iterating global reduction 1 with 84 rules applied. Total rules applied 674 place count 2172 transition count 2145
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 757 place count 2089 transition count 2042
Iterating global reduction 1 with 83 rules applied. Total rules applied 840 place count 2089 transition count 2042
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 883 place count 2046 transition count 1959
Iterating global reduction 1 with 43 rules applied. Total rules applied 926 place count 2046 transition count 1959
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 988 place count 1984 transition count 1897
Iterating global reduction 1 with 62 rules applied. Total rules applied 1050 place count 1984 transition count 1897
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1112 place count 1922 transition count 1835
Iterating global reduction 1 with 62 rules applied. Total rules applied 1174 place count 1922 transition count 1835
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1236 place count 1860 transition count 1773
Iterating global reduction 1 with 62 rules applied. Total rules applied 1298 place count 1860 transition count 1773
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1360 place count 1798 transition count 1711
Iterating global reduction 1 with 62 rules applied. Total rules applied 1422 place count 1798 transition count 1711
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1484 place count 1736 transition count 1649
Iterating global reduction 1 with 62 rules applied. Total rules applied 1546 place count 1736 transition count 1649
Applied a total of 1546 rules in 757 ms. Remains 1736 /2593 variables (removed 857) and now considering 1649/2418 (removed 769) transitions.
// Phase 1: matrix 1649 rows 1736 cols
[2022-05-16 11:30:59] [INFO ] Computed 151 place invariants in 19 ms
[2022-05-16 11:30:59] [INFO ] Implicit Places using invariants in 382 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 977, 1483]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 384 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1713/2593 places, 1649/2418 transitions.
Applied a total of 0 rules in 56 ms. Remains 1713 /1713 variables (removed 0) and now considering 1649/1649 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1713/2593 places, 1649/2418 transitions.
Stuttering acceptance computed with spot in 142 ms :[p1, true, p1, p1]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT s1103 (ADD s693 s694 s695 s696 s697 s698 s699 s700 s701 s702 s703 s704 s705 s706 s707 s708 s709 s710 s711 s712 s713 s714 s715 s716 s717 s718 s719 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 405 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-03 finished in 1364 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(F(X(p0))))))'
Support contains 84 out of 2593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Graph (complete) has 3360 edges and 2593 vertex of which 2589 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.10 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 147 places :
Implicit places reduction removed 147 places
Drop transitions removed 1407 transitions
Trivial Post-agglo rules discarded 1407 transitions
Performed 1407 trivial Post agglomeration. Transition count delta: 1407
Iterating post reduction 0 with 1554 rules applied. Total rules applied 1555 place count 2421 transition count 987
Reduce places removed 1407 places and 0 transitions.
Iterating post reduction 1 with 1407 rules applied. Total rules applied 2962 place count 1014 transition count 987
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 2962 place count 1014 transition count 693
Deduced a syphon composed of 294 places in 0 ms
Ensure Unique test removed 126 places
Reduce places removed 420 places and 0 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 3676 place count 594 transition count 693
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 2 with 63 rules applied. Total rules applied 3739 place count 594 transition count 630
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 3802 place count 531 transition count 630
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 3802 place count 531 transition count 609
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 3844 place count 510 transition count 609
Discarding 85 places :
Symmetric choice reduction at 4 with 85 rule applications. Total rules 3929 place count 425 transition count 504
Iterating global reduction 4 with 85 rules applied. Total rules applied 4014 place count 425 transition count 504
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 63 rules applied. Total rules applied 4077 place count 425 transition count 441
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 4098 place count 404 transition count 441
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 42 Pre rules applied. Total rules applied 4098 place count 404 transition count 399
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 4182 place count 362 transition count 399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 4224 place count 341 transition count 378
Applied a total of 4224 rules in 156 ms. Remains 341 /2593 variables (removed 2252) and now considering 378/2418 (removed 2040) transitions.
// Phase 1: matrix 378 rows 341 cols
[2022-05-16 11:30:59] [INFO ] Computed 45 place invariants in 7 ms
[2022-05-16 11:30:59] [INFO ] Implicit Places using invariants in 132 ms returned [84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 319]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 133 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 319/2593 places, 378/2418 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 319 transition count 315
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 256 transition count 315
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 126 place count 256 transition count 294
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 168 place count 235 transition count 294
Applied a total of 168 rules in 13 ms. Remains 235 /319 variables (removed 84) and now considering 294/378 (removed 84) transitions.
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 11:30:59] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 11:31:00] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 11:31:00] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-16 11:31:00] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 235/2593 places, 294/2418 transitions.
Finished structural reductions, in 2 iterations. Remains : 235/2593 places, 294/2418 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-05 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 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87) (ADD s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 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 1173 reset in 432 ms.
Product exploration explored 100000 steps with 1172 reset in 443 ms.
Computed a total of 235 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 235 transition count 294
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 158 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 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 11:31:01] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-16 11:31:01] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2022-05-16 11:31:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:31:01] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-05-16 11:31:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:31:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2022-05-16 11:31:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:31:02] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2022-05-16 11:31:02] [INFO ] Computed and/alt/rep : 168/210/168 causal constraints (skipped 63 transitions) in 16 ms.
[2022-05-16 11:31:02] [INFO ] Added : 48 causal constraints over 10 iterations in 184 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 84 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 294/294 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 11:31:02] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-16 11:31:02] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 11:31:02] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 11:31:02] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2022-05-16 11:31:02] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 11:31:02] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 11:31:02] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 294/294 transitions.
Computed a total of 235 stabilizing places and 294 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 235 transition count 294
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 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 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 2385 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 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 11:31:05] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 11:31:05] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2022-05-16 11:31:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:31:05] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2022-05-16 11:31:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:31:05] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2022-05-16 11:31:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:31:06] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2022-05-16 11:31:06] [INFO ] Computed and/alt/rep : 168/210/168 causal constraints (skipped 63 transitions) in 14 ms.
[2022-05-16 11:31:06] [INFO ] Added : 48 causal constraints over 10 iterations in 185 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 369 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1172 reset in 394 ms.
Product exploration explored 100000 steps with 1171 reset in 392 ms.
Built C files in :
/tmp/ltsmin15677045519970485934
[2022-05-16 11:31:07] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2022-05-16 11:31:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:31:07] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2022-05-16 11:31:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:31:07] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2022-05-16 11:31:07] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:31:07] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15677045519970485934
Running compilation step : cd /tmp/ltsmin15677045519970485934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 553 ms.
Running link step : cd /tmp/ltsmin15677045519970485934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15677045519970485934;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4555813676795448003.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 84 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 294/294 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 11:31:22] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-16 11:31:22] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 11:31:22] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 11:31:22] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2022-05-16 11:31:22] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 294 rows 235 cols
[2022-05-16 11:31:22] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 11:31:22] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 294/294 transitions.
Built C files in :
/tmp/ltsmin15639168740193561499
[2022-05-16 11:31:22] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2022-05-16 11:31:22] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:31:22] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2022-05-16 11:31:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:31:22] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2022-05-16 11:31:22] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:31:22] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15639168740193561499
Running compilation step : cd /tmp/ltsmin15639168740193561499;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 491 ms.
Running link step : cd /tmp/ltsmin15639168740193561499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15639168740193561499;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13325739177882087581.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 11:31:38] [INFO ] Flatten gal took : 10 ms
[2022-05-16 11:31:38] [INFO ] Flatten gal took : 10 ms
[2022-05-16 11:31:38] [INFO ] Time to serialize gal into /tmp/LTL13396605709559932250.gal : 3 ms
[2022-05-16 11:31:38] [INFO ] Time to serialize properties into /tmp/LTL399551719568324181.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/LTL13396605709559932250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL399551719568324181.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/LTL1339660...266
Read 1 LTL properties
Checking formula 0 : !((X(G(F(F(X("((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_...776
Formula 0 simplified : !XGFX"((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_14+l38...763
Detected timeout of ITS tools.
[2022-05-16 11:31:53] [INFO ] Flatten gal took : 14 ms
[2022-05-16 11:31:53] [INFO ] Applying decomposition
[2022-05-16 11:31:53] [INFO ] Flatten gal took : 10 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/graph8158686770527212412.txt' '-o' '/tmp/graph8158686770527212412.bin' '-w' '/tmp/graph8158686770527212412.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8158686770527212412.bin' '-l' '-1' '-v' '-w' '/tmp/graph8158686770527212412.weights' '-q' '0' '-e' '0.001'
[2022-05-16 11:31:53] [INFO ] Decomposing Gal with order
[2022-05-16 11:31:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:31:53] [INFO ] Removed a total of 212 redundant transitions.
[2022-05-16 11:31:53] [INFO ] Flatten gal took : 89 ms
[2022-05-16 11:31:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 9 ms.
[2022-05-16 11:31:53] [INFO ] Time to serialize gal into /tmp/LTL16681574558931498699.gal : 4 ms
[2022-05-16 11:31:53] [INFO ] Time to serialize properties into /tmp/LTL14287485693165254443.ltl : 0 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/LTL16681574558931498699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14287485693165254443.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/LTL1668157...268
Read 1 LTL properties
Checking formula 0 : !((X(G(F(F(X("((((((gu22.l38_0+gu22.l38_1)+(gu22.l38_2+gu22.l38_3))+((gu22.l38_4+gu22.l38_5)+(gu22.l38_6+gu22.l38_7)))+(((gu22.l38_8+g...1196
Formula 0 simplified : !XGFX"((((((gu22.l38_0+gu22.l38_1)+(gu22.l38_2+gu22.l38_3))+((gu22.l38_4+gu22.l38_5)+(gu22.l38_6+gu22.l38_7)))+(((gu22.l38_8+gu22.l3...1183
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15254315852204232752
[2022-05-16 11:32:08] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15254315852204232752
Running compilation step : cd /tmp/ltsmin15254315852204232752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 381 ms.
Running link step : cd /tmp/ltsmin15254315852204232752;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15254315852204232752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>(<>(X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-05 finished in 83859 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1)||p2)))'
Support contains 150 out of 2593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 147 places :
Implicit places reduction removed 147 places
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 2424 transition count 2418
Discarding 169 places :
Symmetric choice reduction at 1 with 169 rule applications. Total rules 338 place count 2255 transition count 2249
Iterating global reduction 1 with 169 rules applied. Total rules applied 507 place count 2255 transition count 2249
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 591 place count 2171 transition count 2145
Iterating global reduction 1 with 84 rules applied. Total rules applied 675 place count 2171 transition count 2145
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 758 place count 2088 transition count 2042
Iterating global reduction 1 with 83 rules applied. Total rules applied 841 place count 2088 transition count 2042
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 882 place count 2047 transition count 2001
Iterating global reduction 1 with 41 rules applied. Total rules applied 923 place count 2047 transition count 2001
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 943 place count 2027 transition count 1981
Iterating global reduction 1 with 20 rules applied. Total rules applied 963 place count 2027 transition count 1981
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 983 place count 2007 transition count 1961
Iterating global reduction 1 with 20 rules applied. Total rules applied 1003 place count 2007 transition count 1961
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1023 place count 1987 transition count 1941
Iterating global reduction 1 with 20 rules applied. Total rules applied 1043 place count 1987 transition count 1941
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1063 place count 1967 transition count 1921
Iterating global reduction 1 with 20 rules applied. Total rules applied 1083 place count 1967 transition count 1921
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1103 place count 1947 transition count 1901
Iterating global reduction 1 with 20 rules applied. Total rules applied 1123 place count 1947 transition count 1901
Applied a total of 1123 rules in 718 ms. Remains 1947 /2593 variables (removed 646) and now considering 1901/2418 (removed 517) transitions.
// Phase 1: matrix 1901 rows 1947 cols
[2022-05-16 11:32:24] [INFO ] Computed 150 place invariants in 13 ms
[2022-05-16 11:32:24] [INFO ] Implicit Places using invariants in 376 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 1694]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 377 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1925/2593 places, 1901/2418 transitions.
Applied a total of 0 rules in 66 ms. Remains 1925 /1925 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1925/2593 places, 1901/2418 transitions.
Stuttering acceptance computed with spot in 1373 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (LEQ (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41) (ADD s1337 s1338 s1339 s1340 s1341 s1342 s1343 s134...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1360 ms.
Product exploration explored 100000 steps with 50000 reset in 1426 ms.
Computed a total of 1925 stabilizing places and 1901 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1925 transition count 1901
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 p2), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))
Knowledge based reduction with 9 factoid took 142 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-06 finished in 5834 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(F(p0) U p1))))'
Support contains 105 out of 2593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 84 places :
Implicit places reduction removed 84 places
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 2487 transition count 2418
Discarding 169 places :
Symmetric choice reduction at 1 with 169 rule applications. Total rules 275 place count 2318 transition count 2249
Iterating global reduction 1 with 169 rules applied. Total rules applied 444 place count 2318 transition count 2249
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 528 place count 2234 transition count 2145
Iterating global reduction 1 with 84 rules applied. Total rules applied 612 place count 2234 transition count 2145
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 695 place count 2151 transition count 2042
Iterating global reduction 1 with 83 rules applied. Total rules applied 778 place count 2151 transition count 2042
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 821 place count 2108 transition count 1959
Iterating global reduction 1 with 43 rules applied. Total rules applied 864 place count 2108 transition count 1959
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 926 place count 2046 transition count 1897
Iterating global reduction 1 with 62 rules applied. Total rules applied 988 place count 2046 transition count 1897
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1050 place count 1984 transition count 1835
Iterating global reduction 1 with 62 rules applied. Total rules applied 1112 place count 1984 transition count 1835
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1174 place count 1922 transition count 1773
Iterating global reduction 1 with 62 rules applied. Total rules applied 1236 place count 1922 transition count 1773
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1256 place count 1902 transition count 1753
Iterating global reduction 1 with 20 rules applied. Total rules applied 1276 place count 1902 transition count 1753
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1296 place count 1882 transition count 1733
Iterating global reduction 1 with 20 rules applied. Total rules applied 1316 place count 1882 transition count 1733
Applied a total of 1316 rules in 777 ms. Remains 1882 /2593 variables (removed 711) and now considering 1733/2418 (removed 685) transitions.
// Phase 1: matrix 1733 rows 1882 cols
[2022-05-16 11:32:30] [INFO ] Computed 213 place invariants in 27 ms
[2022-05-16 11:32:30] [INFO ] Implicit Places using invariants in 412 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 1124, 1629]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 413 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1859/2593 places, 1733/2418 transitions.
Applied a total of 0 rules in 70 ms. Remains 1859 /1859 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1859/2593 places, 1733/2418 transitions.
Stuttering acceptance computed with spot in 99 ms :[p1, p1, (AND p0 p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s1271 s1272 s1273 s1274 s1275 s1276 s1277 s1278 s1279 s1280 s1281 s1282 s1283 s1284 s1285 s1286 s1287 s1288 s1289 s1290 s1291) (ADD s1838 s18...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1215 steps with 0 reset in 10 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-07 finished in 1394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 105 out of 2593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Graph (complete) has 3360 edges and 2593 vertex of which 1830 are kept as prefixes of interest. Removing 763 places using SCC suffix rule.7 ms
Discarding 763 places :
Also discarding 696 output transitions
Drop transitions removed 696 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 147 places :
Implicit places reduction removed 147 places
Drop transitions removed 966 transitions
Trivial Post-agglo rules discarded 966 transitions
Performed 966 trivial Post agglomeration. Transition count delta: 966
Iterating post reduction 0 with 1113 rules applied. Total rules applied 1114 place count 1662 transition count 735
Reduce places removed 966 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 1 with 1029 rules applied. Total rules applied 2143 place count 696 transition count 672
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 2206 place count 633 transition count 672
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 168 Pre rules applied. Total rules applied 2206 place count 633 transition count 504
Deduced a syphon composed of 168 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 3 with 378 rules applied. Total rules applied 2584 place count 423 transition count 504
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 2628 place count 379 transition count 420
Iterating global reduction 3 with 44 rules applied. Total rules applied 2672 place count 379 transition count 420
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 2672 place count 379 transition count 399
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2714 place count 358 transition count 399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2756 place count 337 transition count 378
Applied a total of 2756 rules in 55 ms. Remains 337 /2593 variables (removed 2256) and now considering 378/2418 (removed 2040) transitions.
// Phase 1: matrix 378 rows 337 cols
[2022-05-16 11:32:30] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-16 11:32:30] [INFO ] Implicit Places using invariants in 107 ms returned [84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 252]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 108 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 315/2593 places, 378/2418 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 315 transition count 315
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 252 transition count 315
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 168 place count 231 transition count 336
Applied a total of 168 rules in 7 ms. Remains 231 /315 variables (removed 84) and now considering 336/378 (removed 42) transitions.
// Phase 1: matrix 336 rows 231 cols
[2022-05-16 11:32:30] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 11:32:30] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 336 rows 231 cols
[2022-05-16 11:32:30] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 11:32:31] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 231/2593 places, 336/2418 transitions.
Finished structural reductions, in 2 iterations. Remains : 231/2593 places, 336/2418 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-08 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 (ADD s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 943 reset in 435 ms.
Product exploration explored 100000 steps with 943 reset in 465 ms.
Computed a total of 231 stabilizing places and 336 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 231 transition count 336
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-08 finished in 1388 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(G(p0))||X(G(p1))))'
Support contains 147 out of 2593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 147 places :
Implicit places reduction removed 147 places
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 2424 transition count 2418
Discarding 127 places :
Symmetric choice reduction at 1 with 127 rule applications. Total rules 296 place count 2297 transition count 2291
Iterating global reduction 1 with 127 rules applied. Total rules applied 423 place count 2297 transition count 2291
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 507 place count 2213 transition count 2187
Iterating global reduction 1 with 84 rules applied. Total rules applied 591 place count 2213 transition count 2187
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 674 place count 2130 transition count 2084
Iterating global reduction 1 with 83 rules applied. Total rules applied 757 place count 2130 transition count 2084
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 800 place count 2087 transition count 2001
Iterating global reduction 1 with 43 rules applied. Total rules applied 843 place count 2087 transition count 2001
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 863 place count 2067 transition count 1981
Iterating global reduction 1 with 20 rules applied. Total rules applied 883 place count 2067 transition count 1981
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 903 place count 2047 transition count 1961
Iterating global reduction 1 with 20 rules applied. Total rules applied 923 place count 2047 transition count 1961
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 943 place count 2027 transition count 1941
Iterating global reduction 1 with 20 rules applied. Total rules applied 963 place count 2027 transition count 1941
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 983 place count 2007 transition count 1921
Iterating global reduction 1 with 20 rules applied. Total rules applied 1003 place count 2007 transition count 1921
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1023 place count 1987 transition count 1901
Iterating global reduction 1 with 20 rules applied. Total rules applied 1043 place count 1987 transition count 1901
Applied a total of 1043 rules in 776 ms. Remains 1987 /2593 variables (removed 606) and now considering 1901/2418 (removed 517) transitions.
// Phase 1: matrix 1901 rows 1987 cols
[2022-05-16 11:32:32] [INFO ] Computed 150 place invariants in 23 ms
[2022-05-16 11:32:33] [INFO ] Implicit Places using invariants in 404 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 1229, 1734]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 408 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1964/2593 places, 1901/2418 transitions.
Applied a total of 0 rules in 68 ms. Remains 1964 /1964 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1964/2593 places, 1901/2418 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT (ADD s1078 s1079 s1080 s1081 s1082 s1083 s1084 s1085 s1086 s1087 s1088 s1089 s1090 s1091 s1092 s1093 s1094 s1095 s1096 s1097 s1098 s1099 s1100 s110...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-09 finished in 1416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(X(p1))))'
Support contains 128 out of 2593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 147 places :
Implicit places reduction removed 147 places
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 2424 transition count 2418
Discarding 167 places :
Symmetric choice reduction at 1 with 167 rule applications. Total rules 336 place count 2257 transition count 2251
Iterating global reduction 1 with 167 rules applied. Total rules applied 503 place count 2257 transition count 2251
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 587 place count 2173 transition count 2147
Iterating global reduction 1 with 84 rules applied. Total rules applied 671 place count 2173 transition count 2147
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 754 place count 2090 transition count 2044
Iterating global reduction 1 with 83 rules applied. Total rules applied 837 place count 2090 transition count 2044
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 859 place count 2068 transition count 1982
Iterating global reduction 1 with 22 rules applied. Total rules applied 881 place count 2068 transition count 1982
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 943 place count 2006 transition count 1920
Iterating global reduction 1 with 62 rules applied. Total rules applied 1005 place count 2006 transition count 1920
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1067 place count 1944 transition count 1858
Iterating global reduction 1 with 62 rules applied. Total rules applied 1129 place count 1944 transition count 1858
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1149 place count 1924 transition count 1838
Iterating global reduction 1 with 20 rules applied. Total rules applied 1169 place count 1924 transition count 1838
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1189 place count 1904 transition count 1818
Iterating global reduction 1 with 20 rules applied. Total rules applied 1209 place count 1904 transition count 1818
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1229 place count 1884 transition count 1798
Iterating global reduction 1 with 20 rules applied. Total rules applied 1249 place count 1884 transition count 1798
Applied a total of 1249 rules in 708 ms. Remains 1884 /2593 variables (removed 709) and now considering 1798/2418 (removed 620) transitions.
// Phase 1: matrix 1798 rows 1884 cols
[2022-05-16 11:32:34] [INFO ] Computed 150 place invariants in 21 ms
[2022-05-16 11:32:34] [INFO ] Implicit Places using invariants in 368 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 1103, 1631]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 370 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1861/2593 places, 1798/2418 transitions.
Applied a total of 0 rules in 59 ms. Remains 1861 /1861 variables (removed 0) and now considering 1798/1798 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1861/2593 places, 1798/2418 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GT 3 (ADD s1586 s1587)) (GT 2 (ADD s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-10 finished in 1274 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X(X(((p0 U G(p1))&&p2)))))))'
Support contains 315 out of 2593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Graph (complete) has 3360 edges and 2593 vertex of which 2252 are kept as prefixes of interest. Removing 341 places using SCC suffix rule.4 ms
Discarding 341 places :
Also discarding 318 output transitions
Drop transitions removed 318 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 147 places :
Implicit places reduction removed 147 places
Drop transitions removed 861 transitions
Trivial Post-agglo rules discarded 861 transitions
Performed 861 trivial Post agglomeration. Transition count delta: 861
Iterating post reduction 0 with 1008 rules applied. Total rules applied 1009 place count 2084 transition count 1218
Reduce places removed 861 places and 0 transitions.
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Iterating post reduction 1 with 987 rules applied. Total rules applied 1996 place count 1223 transition count 1092
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 2122 place count 1097 transition count 1092
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 252 Pre rules applied. Total rules applied 2122 place count 1097 transition count 840
Deduced a syphon composed of 252 places in 0 ms
Ensure Unique test removed 105 places
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 609 rules applied. Total rules applied 2731 place count 740 transition count 840
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 42 rules applied. Total rules applied 2773 place count 740 transition count 798
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 2815 place count 698 transition count 798
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2815 place count 698 transition count 777
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 2857 place count 677 transition count 777
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2880 place count 654 transition count 714
Iterating global reduction 5 with 23 rules applied. Total rules applied 2903 place count 654 transition count 714
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2903 place count 654 transition count 693
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 2945 place count 633 transition count 693
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 2987 place count 612 transition count 672
Applied a total of 2987 rules in 127 ms. Remains 612 /2593 variables (removed 1981) and now considering 672/2418 (removed 1746) transitions.
// Phase 1: matrix 672 rows 612 cols
[2022-05-16 11:32:34] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-16 11:32:35] [INFO ] Implicit Places using invariants in 138 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 525]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 140 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 590/2593 places, 672/2418 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 569 transition count 693
Applied a total of 42 rules in 11 ms. Remains 569 /590 variables (removed 21) and now considering 693/672 (removed -21) transitions.
// Phase 1: matrix 693 rows 569 cols
[2022-05-16 11:32:35] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 11:32:35] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 693 rows 569 cols
[2022-05-16 11:32:35] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 11:32:35] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/2593 places, 693/2418 transitions.
Finished structural reductions, in 2 iterations. Remains : 569/2593 places, 693/2418 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p0))), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND p1 (NOT p0))), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ (ADD s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 395 reset in 855 ms.
Product exploration explored 100000 steps with 395 reset in 820 ms.
Computed a total of 569 stabilizing places and 693 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 569 transition count 693
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (OR (NOT p2) (AND (NOT p1) (NOT p0))))), (X (AND p2 p1 (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (NOT p2) (AND (NOT p1) (NOT p0)))))), (X (X (AND p2 p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p0)))))), (X (X (OR (AND (NOT p2) p1) (AND p1 (NOT p0))))), (F (G p2)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 819 ms. Reduced automaton from 4 states, 15 edges and 3 AP to 4 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Finished random walk after 202 steps, including 0 resets, run visited all 10 properties in 33 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (OR (NOT p2) (AND (NOT p1) (NOT p0))))), (X (AND p2 p1 (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (NOT p2) (AND (NOT p1) (NOT p0)))))), (X (X (AND p2 p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p0)))))), (X (X (OR (AND (NOT p2) p1) (AND p1 (NOT p0))))), (F (G p2)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0) p2))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F (OR (AND (NOT p1) (NOT p0)) (NOT p2))), (F (AND p1 p0 p2)), (F (AND (NOT p1) p0 p2)), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR (AND p1 (NOT p0)) (AND p1 (NOT p2)))))]
Knowledge based reduction with 22 factoid took 3084 ms. Reduced automaton from 4 states, 15 edges and 3 AP to 4 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Support contains 315 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 693/693 transitions.
Applied a total of 0 rules in 13 ms. Remains 569 /569 variables (removed 0) and now considering 693/693 (removed 0) transitions.
// Phase 1: matrix 693 rows 569 cols
[2022-05-16 11:32:41] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-16 11:32:41] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 693 rows 569 cols
[2022-05-16 11:32:41] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 11:32:42] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2022-05-16 11:32:42] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 693 rows 569 cols
[2022-05-16 11:32:42] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 11:32:42] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 569/569 places, 693/693 transitions.
Computed a total of 569 stabilizing places and 693 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 569 transition count 693
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0) p2)), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (OR (AND p1 (NOT p0)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0) p2))), (F (G p1)), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 788 ms. Reduced automaton from 4 states, 15 edges and 3 AP to 4 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Finished random walk after 169 steps, including 0 resets, run visited all 10 properties in 9 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0) p2)), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (OR (AND p1 (NOT p0)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0) p2))), (F (G p1)), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 p2 (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F (OR (AND (NOT p1) (NOT p0)) (NOT p2))), (F (AND p1 p2 p0)), (F (AND (NOT p1) p2 p0)), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0)))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p0)))))]
Knowledge based reduction with 22 factoid took 1241 ms. Reduced automaton from 4 states, 15 edges and 3 AP to 4 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 395 reset in 1083 ms.
Product exploration explored 100000 steps with 395 reset in 1089 ms.
Built C files in :
/tmp/ltsmin8586691745959115518
[2022-05-16 11:32:47] [INFO ] Computing symmetric may disable matrix : 693 transitions.
[2022-05-16 11:32:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:32:47] [INFO ] Computing symmetric may enable matrix : 693 transitions.
[2022-05-16 11:32:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:32:47] [INFO ] Computing Do-Not-Accords matrix : 693 transitions.
[2022-05-16 11:32:47] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:32:47] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8586691745959115518
Running compilation step : cd /tmp/ltsmin8586691745959115518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1503 ms.
Running link step : cd /tmp/ltsmin8586691745959115518;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8586691745959115518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16501063369855026219.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 315 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 693/693 transitions.
Applied a total of 0 rules in 11 ms. Remains 569 /569 variables (removed 0) and now considering 693/693 (removed 0) transitions.
// Phase 1: matrix 693 rows 569 cols
[2022-05-16 11:33:02] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 11:33:02] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 693 rows 569 cols
[2022-05-16 11:33:02] [INFO ] Computed 1 place invariants in 8 ms
[2022-05-16 11:33:02] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2022-05-16 11:33:02] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 693 rows 569 cols
[2022-05-16 11:33:02] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 11:33:03] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 569/569 places, 693/693 transitions.
Built C files in :
/tmp/ltsmin13169581358994474009
[2022-05-16 11:33:03] [INFO ] Computing symmetric may disable matrix : 693 transitions.
[2022-05-16 11:33:03] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:33:03] [INFO ] Computing symmetric may enable matrix : 693 transitions.
[2022-05-16 11:33:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:33:03] [INFO ] Computing Do-Not-Accords matrix : 693 transitions.
[2022-05-16 11:33:03] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 11:33:03] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13169581358994474009
Running compilation step : cd /tmp/ltsmin13169581358994474009;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1385 ms.
Running link step : cd /tmp/ltsmin13169581358994474009;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13169581358994474009;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6240911606181508776.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 11:33:18] [INFO ] Flatten gal took : 33 ms
[2022-05-16 11:33:18] [INFO ] Flatten gal took : 17 ms
[2022-05-16 11:33:18] [INFO ] Time to serialize gal into /tmp/LTL11070937924255681534.gal : 3 ms
[2022-05-16 11:33:18] [INFO ] Time to serialize properties into /tmp/LTL10403618532600487818.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/LTL11070937924255681534.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10403618532600487818.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/LTL1107093...268
Read 1 LTL properties
Checking formula 0 : !((G(F(X(X(X((("((((((l32_0+l32_1)+(l32_2+l32_3))+((l32_4+l32_5)+(l32_6+l32_7)))+(((l32_8+l32_9)+(l32_10+l32_11))+((l32_12+l32_13)+(l3...2766
Formula 0 simplified : !GFXXX("(((((((m5_0+m5_1)+(m5_2+m5_3))+((m5_4+m5_5)+(m5_6+m5_7)))+(((m5_8+m5_9)+(m5_10+m5_11))+((m5_12+m5_13)+(m5_14+m5_15))))+((((m...2751
Detected timeout of ITS tools.
[2022-05-16 11:33:33] [INFO ] Flatten gal took : 20 ms
[2022-05-16 11:33:33] [INFO ] Applying decomposition
[2022-05-16 11:33:33] [INFO ] Flatten gal took : 16 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/graph5625934610851252178.txt' '-o' '/tmp/graph5625934610851252178.bin' '-w' '/tmp/graph5625934610851252178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5625934610851252178.bin' '-l' '-1' '-v' '-w' '/tmp/graph5625934610851252178.weights' '-q' '0' '-e' '0.001'
[2022-05-16 11:33:33] [INFO ] Decomposing Gal with order
[2022-05-16 11:33:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:33:33] [INFO ] Flatten gal took : 89 ms
[2022-05-16 11:33:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-16 11:33:33] [INFO ] Time to serialize gal into /tmp/LTL18057254275514605565.gal : 3 ms
[2022-05-16 11:33:33] [INFO ] Time to serialize properties into /tmp/LTL17516894690081761051.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/LTL18057254275514605565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17516894690081761051.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/LTL1805725...268
Read 1 LTL properties
Checking formula 0 : !((G(F(X(X(X((("((((((gi0.gi0.gu21.l32_0+gi0.gi0.gu21.l32_1)+(gi0.gi0.gu21.l32_2+gi0.gi0.gu21.l32_3))+((gi0.gi0.gu21.l32_4+gi0.gi0.gu2...5013
Formula 0 simplified : !GFXXX("(((((((gu22.m5_0+gu22.m5_1)+(gu22.m5_2+gu22.m5_3))+((gu22.m5_4+gu22.m5_5)+(gu22.m5_6+gu22.m5_7)))+(((gu22.m5_8+gu22.m5_9)+(g...4998
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16215745755427492628
[2022-05-16 11:33:48] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16215745755427492628
Running compilation step : cd /tmp/ltsmin16215745755427492628;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 874 ms.
Running link step : cd /tmp/ltsmin16215745755427492628;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16215745755427492628;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X(X(X((((LTLAPp0==true) U []((LTLAPp1==true)))&&(LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-12 finished in 88940 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 168 out of 2593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 126 places :
Implicit places reduction removed 126 places
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 2445 transition count 2418
Discarding 127 places :
Symmetric choice reduction at 1 with 127 rule applications. Total rules 275 place count 2318 transition count 2291
Iterating global reduction 1 with 127 rules applied. Total rules applied 402 place count 2318 transition count 2291
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 444 place count 2276 transition count 2229
Iterating global reduction 1 with 42 rules applied. Total rules applied 486 place count 2276 transition count 2229
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 527 place count 2235 transition count 2168
Iterating global reduction 1 with 41 rules applied. Total rules applied 568 place count 2235 transition count 2168
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 609 place count 2194 transition count 2127
Iterating global reduction 1 with 41 rules applied. Total rules applied 650 place count 2194 transition count 2127
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 670 place count 2174 transition count 2107
Iterating global reduction 1 with 20 rules applied. Total rules applied 690 place count 2174 transition count 2107
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 710 place count 2154 transition count 2087
Iterating global reduction 1 with 20 rules applied. Total rules applied 730 place count 2154 transition count 2087
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 750 place count 2134 transition count 2067
Iterating global reduction 1 with 20 rules applied. Total rules applied 770 place count 2134 transition count 2067
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 790 place count 2114 transition count 2047
Iterating global reduction 1 with 20 rules applied. Total rules applied 810 place count 2114 transition count 2047
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 830 place count 2094 transition count 2027
Iterating global reduction 1 with 20 rules applied. Total rules applied 850 place count 2094 transition count 2027
Applied a total of 850 rules in 784 ms. Remains 2094 /2593 variables (removed 499) and now considering 2027/2418 (removed 391) transitions.
// Phase 1: matrix 2027 rows 2094 cols
[2022-05-16 11:34:04] [INFO ] Computed 171 place invariants in 16 ms
[2022-05-16 11:34:04] [INFO ] Implicit Places using invariants in 424 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 1841]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 426 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2072/2593 places, 2027/2418 transitions.
Applied a total of 0 rules in 71 ms. Remains 2072 /2072 variables (removed 0) and now considering 2027/2027 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2072/2593 places, 2027/2418 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13 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}]], initial=1, aps=[p0:(AND (GT (ADD s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s1023 s1024 s1025 s1026 s1027 s1028 s1029 s1030 s1031 s1032 s1033 s1034 s1035 s1036 s1037...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-13 finished in 1384 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 21 out of 2593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Graph (complete) has 3360 edges and 2593 vertex of which 2147 are kept as prefixes of interest. Removing 446 places using SCC suffix rule.3 ms
Discarding 446 places :
Also discarding 423 output transitions
Drop transitions removed 423 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 147 places :
Implicit places reduction removed 147 places
Drop transitions removed 1281 transitions
Trivial Post-agglo rules discarded 1281 transitions
Performed 1281 trivial Post agglomeration. Transition count delta: 1281
Iterating post reduction 0 with 1428 rules applied. Total rules applied 1429 place count 1979 transition count 693
Reduce places removed 1281 places and 0 transitions.
Iterating post reduction 1 with 1281 rules applied. Total rules applied 2710 place count 698 transition count 693
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 210 Pre rules applied. Total rules applied 2710 place count 698 transition count 483
Deduced a syphon composed of 210 places in 0 ms
Ensure Unique test removed 84 places
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 3214 place count 404 transition count 483
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 2 with 63 rules applied. Total rules applied 3277 place count 383 transition count 441
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 3319 place count 341 transition count 441
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 3319 place count 341 transition count 420
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 3361 place count 320 transition count 420
Discarding 66 places :
Symmetric choice reduction at 4 with 66 rule applications. Total rules 3427 place count 254 transition count 294
Iterating global reduction 4 with 66 rules applied. Total rules applied 3493 place count 254 transition count 294
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 42 rules applied. Total rules applied 3535 place count 254 transition count 252
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 3556 place count 233 transition count 252
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 42 Pre rules applied. Total rules applied 3556 place count 233 transition count 210
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 3640 place count 191 transition count 210
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 3682 place count 149 transition count 168
Iterating global reduction 6 with 42 rules applied. Total rules applied 3724 place count 149 transition count 168
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 3766 place count 149 transition count 126
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 3766 place count 149 transition count 105
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 63 rules applied. Total rules applied 3829 place count 107 transition count 105
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 7 with 21 rules applied. Total rules applied 3850 place count 86 transition count 84
Applied a total of 3850 rules in 49 ms. Remains 86 /2593 variables (removed 2507) and now considering 84/2418 (removed 2334) transitions.
// Phase 1: matrix 84 rows 86 cols
[2022-05-16 11:34:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 11:34:05] [INFO ] Implicit Places using invariants in 48 ms returned [21, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/2593 places, 84/2418 transitions.
Reduce places removed 21 places and 21 transitions.
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 21 Pre rules applied. Total rules applied 0 place count 63 transition count 42
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 42 transition count 42
Applied a total of 42 rules in 1 ms. Remains 42 /84 variables (removed 42) and now considering 42/84 (removed 42) transitions.
// Phase 1: matrix 42 rows 42 cols
[2022-05-16 11:34:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 11:34:05] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 42 rows 42 cols
[2022-05-16 11:34:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 11:34:05] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/2593 places, 42/2418 transitions.
Finished structural reductions, in 2 iterations. Remains : 42/2593 places, 42/2418 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-14 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:(LEQ 1 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-14 finished in 219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((!G(p0) U F(F(p0)))))))'
Support contains 63 out of 2593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Reduce places removed 22 places and 0 transitions.
Discarding 84 places :
Implicit places reduction removed 84 places
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 2487 transition count 2418
Discarding 169 places :
Symmetric choice reduction at 1 with 169 rule applications. Total rules 275 place count 2318 transition count 2249
Iterating global reduction 1 with 169 rules applied. Total rules applied 444 place count 2318 transition count 2249
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 528 place count 2234 transition count 2145
Iterating global reduction 1 with 84 rules applied. Total rules applied 612 place count 2234 transition count 2145
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 695 place count 2151 transition count 2042
Iterating global reduction 1 with 83 rules applied. Total rules applied 778 place count 2151 transition count 2042
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 821 place count 2108 transition count 1959
Iterating global reduction 1 with 43 rules applied. Total rules applied 864 place count 2108 transition count 1959
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 926 place count 2046 transition count 1897
Iterating global reduction 1 with 62 rules applied. Total rules applied 988 place count 2046 transition count 1897
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1050 place count 1984 transition count 1835
Iterating global reduction 1 with 62 rules applied. Total rules applied 1112 place count 1984 transition count 1835
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1174 place count 1922 transition count 1773
Iterating global reduction 1 with 62 rules applied. Total rules applied 1236 place count 1922 transition count 1773
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1298 place count 1860 transition count 1711
Iterating global reduction 1 with 62 rules applied. Total rules applied 1360 place count 1860 transition count 1711
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 1422 place count 1798 transition count 1649
Iterating global reduction 1 with 62 rules applied. Total rules applied 1484 place count 1798 transition count 1649
Applied a total of 1484 rules in 750 ms. Remains 1798 /2593 variables (removed 795) and now considering 1649/2418 (removed 769) transitions.
// Phase 1: matrix 1649 rows 1798 cols
[2022-05-16 11:34:06] [INFO ] Computed 213 place invariants in 17 ms
[2022-05-16 11:34:06] [INFO ] Implicit Places using invariants in 415 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 1040, 1545]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 417 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1775/2593 places, 1649/2418 transitions.
Applied a total of 0 rules in 56 ms. Remains 1775 /1775 variables (removed 0) and now considering 1649/1649 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1775/2593 places, 1649/2418 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 (ADD s756 s757 s758 s759 s760 s761 s762 s763 s764 s765 s766 s767 s768 s769 s770 s771 s772 s773 s774 s775 s776 s777 s778 s779 s780 s781 s782 s783...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1454 reset in 366 ms.
Product exploration explored 100000 steps with 1460 reset in 395 ms.
Computed a total of 1775 stabilizing places and 1649 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1775 transition count 1649
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 1649 rows 1775 cols
[2022-05-16 11:34:08] [INFO ] Computed 190 place invariants in 15 ms
[2022-05-16 11:34:09] [INFO ] [Real]Absence check using 0 positive and 190 generalized place invariants in 151 ms returned sat
[2022-05-16 11:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:34:11] [INFO ] [Real]Absence check using state equation in 1798 ms returned sat
[2022-05-16 11:34:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:34:12] [INFO ] [Nat]Absence check using 0 positive and 190 generalized place invariants in 80 ms returned sat
[2022-05-16 11:34:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:34:13] [INFO ] [Nat]Absence check using state equation in 1430 ms returned sat
[2022-05-16 11:34:14] [INFO ] Computed and/alt/rep : 1626/1879/1626 causal constraints (skipped 2 transitions) in 87 ms.
[2022-05-16 11:34:15] [INFO ] Added : 105 causal constraints over 21 iterations in 1717 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 63 out of 1775 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1775/1775 places, 1649/1649 transitions.
Applied a total of 0 rules in 62 ms. Remains 1775 /1775 variables (removed 0) and now considering 1649/1649 (removed 0) transitions.
// Phase 1: matrix 1649 rows 1775 cols
[2022-05-16 11:34:15] [INFO ] Computed 190 place invariants in 12 ms
[2022-05-16 11:34:16] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 1649 rows 1775 cols
[2022-05-16 11:34:16] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 11:34:17] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
// Phase 1: matrix 1649 rows 1775 cols
[2022-05-16 11:34:17] [INFO ] Computed 190 place invariants in 15 ms
[2022-05-16 11:34:17] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1775/1775 places, 1649/1649 transitions.
Computed a total of 1775 stabilizing places and 1649 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1775 transition count 1649
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=73 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 1649 rows 1775 cols
[2022-05-16 11:34:18] [INFO ] Computed 190 place invariants in 17 ms
[2022-05-16 11:34:20] [INFO ] [Real]Absence check using 0 positive and 190 generalized place invariants in 153 ms returned sat
[2022-05-16 11:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:34:22] [INFO ] [Real]Absence check using state equation in 1810 ms returned sat
[2022-05-16 11:34:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:34:23] [INFO ] [Nat]Absence check using 0 positive and 190 generalized place invariants in 76 ms returned sat
[2022-05-16 11:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:34:24] [INFO ] [Nat]Absence check using state equation in 1373 ms returned sat
[2022-05-16 11:34:24] [INFO ] Computed and/alt/rep : 1626/1879/1626 causal constraints (skipped 2 transitions) in 72 ms.
[2022-05-16 11:34:26] [INFO ] Added : 105 causal constraints over 21 iterations in 1704 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1462 reset in 366 ms.
Product exploration explored 100000 steps with 1451 reset in 379 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 63 out of 1775 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1775/1775 places, 1649/1649 transitions.
Graph (complete) has 2048 edges and 1775 vertex of which 609 are kept as prefixes of interest. Removing 1166 places using SCC suffix rule.4 ms
Discarding 1166 places :
Also discarding 1061 output transitions
Drop transitions removed 1061 transitions
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 189 rules applied. Total rules applied 190 place count 609 transition count 588
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 210 Pre rules applied. Total rules applied 190 place count 609 transition count 630
Deduced a syphon composed of 399 places in 0 ms
Iterating global reduction 1 with 210 rules applied. Total rules applied 400 place count 609 transition count 630
Discarding 189 places :
Symmetric choice reduction at 1 with 189 rule applications. Total rules 589 place count 420 transition count 441
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 1 with 189 rules applied. Total rules applied 778 place count 420 transition count 441
Deduced a syphon composed of 210 places in 0 ms
Applied a total of 778 rules in 88 ms. Remains 420 /1775 variables (removed 1355) and now considering 441/1649 (removed 1208) transitions.
[2022-05-16 11:34:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 441 rows 420 cols
[2022-05-16 11:34:27] [INFO ] Computed 63 place invariants in 1 ms
[2022-05-16 11:34:27] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/1775 places, 441/1649 transitions.
Finished structural reductions, in 1 iterations. Remains : 420/1775 places, 441/1649 transitions.
Product exploration explored 100000 steps with 8120 reset in 801 ms.
Product exploration explored 100000 steps with 8090 reset in 763 ms.
Built C files in :
/tmp/ltsmin15809264205322404142
[2022-05-16 11:34:29] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15809264205322404142
Running compilation step : cd /tmp/ltsmin15809264205322404142;'/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/ltsmin15809264205322404142;'/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/ltsmin15809264205322404142;'/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 63 out of 1775 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1775/1775 places, 1649/1649 transitions.
Applied a total of 0 rules in 66 ms. Remains 1775 /1775 variables (removed 0) and now considering 1649/1649 (removed 0) transitions.
// Phase 1: matrix 1649 rows 1775 cols
[2022-05-16 11:34:32] [INFO ] Computed 190 place invariants in 13 ms
[2022-05-16 11:34:32] [INFO ] Implicit Places using invariants in 322 ms returned []
// Phase 1: matrix 1649 rows 1775 cols
[2022-05-16 11:34:32] [INFO ] Computed 190 place invariants in 6 ms
[2022-05-16 11:34:33] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
// Phase 1: matrix 1649 rows 1775 cols
[2022-05-16 11:34:33] [INFO ] Computed 190 place invariants in 7 ms
[2022-05-16 11:34:34] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1775/1775 places, 1649/1649 transitions.
Built C files in :
/tmp/ltsmin11049532283393605179
[2022-05-16 11:34:34] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11049532283393605179
Running compilation step : cd /tmp/ltsmin11049532283393605179;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2723 ms.
Running link step : cd /tmp/ltsmin11049532283393605179;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11049532283393605179;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13419070644111688542.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 11:34:49] [INFO ] Flatten gal took : 38 ms
[2022-05-16 11:34:49] [INFO ] Flatten gal took : 39 ms
[2022-05-16 11:34:49] [INFO ] Time to serialize gal into /tmp/LTL16207304179999693183.gal : 4 ms
[2022-05-16 11:34:49] [INFO ] Time to serialize properties into /tmp/LTL17650673835003056703.ltl : 0 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/LTL16207304179999693183.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17650673835003056703.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/LTL1620730...268
Read 1 LTL properties
Checking formula 0 : !((X(F(X((!(G("(((((((m4_0+m4_1)+(m4_2+m4_3))+((m4_4+m4_5)+(m4_6+m4_7)))+(((m4_8+m4_9)+(m4_10+m4_11))+((m4_12+m4_13)+(m4_14+m4_15))))+...1048
Formula 0 simplified : !XFX(!G"(((((((m4_0+m4_1)+(m4_2+m4_3))+((m4_4+m4_5)+(m4_6+m4_7)))+(((m4_8+m4_9)+(m4_10+m4_11))+((m4_12+m4_13)+(m4_14+m4_15))))+((((m...1031
Detected timeout of ITS tools.
[2022-05-16 11:35:04] [INFO ] Flatten gal took : 36 ms
[2022-05-16 11:35:04] [INFO ] Applying decomposition
[2022-05-16 11:35:04] [INFO ] Flatten gal took : 37 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/graph10806417573158616719.txt' '-o' '/tmp/graph10806417573158616719.bin' '-w' '/tmp/graph10806417573158616719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10806417573158616719.bin' '-l' '-1' '-v' '-w' '/tmp/graph10806417573158616719.weights' '-q' '0' '-e' '0.001'
[2022-05-16 11:35:05] [INFO ] Decomposing Gal with order
[2022-05-16 11:35:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:35:05] [INFO ] Removed a total of 124 redundant transitions.
[2022-05-16 11:35:05] [INFO ] Flatten gal took : 118 ms
[2022-05-16 11:35:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-16 11:35:05] [INFO ] Time to serialize gal into /tmp/LTL13470221559031685628.gal : 11 ms
[2022-05-16 11:35:05] [INFO ] Time to serialize properties into /tmp/LTL970587627872507010.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/LTL13470221559031685628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL970587627872507010.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/LTL1347022...266
Read 1 LTL properties
Checking formula 0 : !((X(F(X((!(G("(((((((gu309.m4_0+gu309.m4_1)+(gu309.m4_2+gu309.m4_3))+((gu309.m4_4+gu309.m4_5)+(gu309.m4_6+gu309.m4_7)))+(((gu309.m4_8...1804
Formula 0 simplified : !XFX(!G"(((((((gu309.m4_0+gu309.m4_1)+(gu309.m4_2+gu309.m4_3))+((gu309.m4_4+gu309.m4_5)+(gu309.m4_6+gu309.m4_7)))+(((gu309.m4_8+gu30...1787
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7586621560274869896
[2022-05-16 11:35:20] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7586621560274869896
Running compilation step : cd /tmp/ltsmin7586621560274869896;'/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/ltsmin7586621560274869896;'/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/ltsmin7586621560274869896;'/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-L00020M0002C001P001G001-LTLCardinality-15 finished in 78416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(F(X(p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X(X(((p0 U G(p1))&&p2)))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((!G(p0) U F(F(p0)))))))'
Found a CL insensitive property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-15
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 63 out of 2593 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2593/2593 places, 2418/2418 transitions.
Graph (complete) has 3360 edges and 2593 vertex of which 630 are kept as prefixes of interest. Removing 1963 places using SCC suffix rule.12 ms
Discarding 1963 places :
Also discarding 1830 output transitions
Drop transitions removed 1830 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 253 place count 609 transition count 315
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 1 with 252 rules applied. Total rules applied 505 place count 357 transition count 315
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 505 place count 357 transition count 252
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 63 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 189 rules applied. Total rules applied 694 place count 231 transition count 252
Applied a total of 694 rules in 29 ms. Remains 231 /2593 variables (removed 2362) and now considering 252/2418 (removed 2166) transitions.
// Phase 1: matrix 252 rows 231 cols
[2022-05-16 11:35:24] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-16 11:35:24] [INFO ] Implicit Places using invariants in 76 ms returned [84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 76 ms to find 21 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 210/2593 places, 252/2418 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 210 transition count 189
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 147 transition count 189
Applied a total of 126 rules in 3 ms. Remains 147 /210 variables (removed 63) and now considering 189/252 (removed 63) transitions.
// Phase 1: matrix 189 rows 147 cols
[2022-05-16 11:35:24] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 11:35:24] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 189 rows 147 cols
[2022-05-16 11:35:24] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 11:35:24] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 147/2593 places, 189/2418 transitions.
Finished structural reductions, in 2 iterations. Remains : 147/2593 places, 189/2418 transitions.
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 (ADD s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 9654 reset in 360 ms.
Product exploration explored 100000 steps with 9682 reset in 368 ms.
Computed a total of 147 stabilizing places and 189 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 189
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 189 rows 147 cols
[2022-05-16 11:35:26] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 11:35:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:35:26] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-16 11:35:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:35:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:35:26] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-16 11:35:26] [INFO ] Computed and/alt/rep : 126/126/126 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 11:35:26] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 63 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 189/189 transitions.
Applied a total of 0 rules in 0 ms. Remains 147 /147 variables (removed 0) and now considering 189/189 (removed 0) transitions.
// Phase 1: matrix 189 rows 147 cols
[2022-05-16 11:35:26] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:35:26] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 189 rows 147 cols
[2022-05-16 11:35:26] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 11:35:26] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 189 rows 147 cols
[2022-05-16 11:35:26] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 11:35:26] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 189/189 transitions.
Computed a total of 147 stabilizing places and 189 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 189
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 189 rows 147 cols
[2022-05-16 11:35:27] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:35:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 11:35:27] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-05-16 11:35:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 11:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 11:35:27] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-16 11:35:27] [INFO ] Computed and/alt/rep : 126/126/126 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 11:35:27] [INFO ] Added : 0 causal constraints over 0 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9621 reset in 359 ms.
Product exploration explored 100000 steps with 9613 reset in 368 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 1061 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 63 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 189/189 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2022-05-16 11:35:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 189 rows 147 cols
[2022-05-16 11:35:29] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 11:35:29] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 189/189 transitions.
Product exploration explored 100000 steps with 9589 reset in 457 ms.
Product exploration explored 100000 steps with 9650 reset in 465 ms.
Built C files in :
/tmp/ltsmin10907191685898248589
[2022-05-16 11:35:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10907191685898248589
Running compilation step : cd /tmp/ltsmin10907191685898248589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 231 ms.
Running link step : cd /tmp/ltsmin10907191685898248589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10907191685898248589;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1865853919677297909.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 63 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 189/189 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 189/189 (removed 0) transitions.
// Phase 1: matrix 189 rows 147 cols
[2022-05-16 11:35:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 11:35:45] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 189 rows 147 cols
[2022-05-16 11:35:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 11:35:45] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 189 rows 147 cols
[2022-05-16 11:35:45] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-16 11:35:46] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 189/189 transitions.
Built C files in :
/tmp/ltsmin10180405119300295709
[2022-05-16 11:35:46] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10180405119300295709
Running compilation step : cd /tmp/ltsmin10180405119300295709;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 236 ms.
Running link step : cd /tmp/ltsmin10180405119300295709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10180405119300295709;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5379126697544927908.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 11:36:01] [INFO ] Flatten gal took : 3 ms
[2022-05-16 11:36:01] [INFO ] Flatten gal took : 3 ms
[2022-05-16 11:36:01] [INFO ] Time to serialize gal into /tmp/LTL3854737989566059604.gal : 1 ms
[2022-05-16 11:36:01] [INFO ] Time to serialize properties into /tmp/LTL2234359268938168048.ltl : 0 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/LTL3854737989566059604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2234359268938168048.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/LTL3854737...266
Read 1 LTL properties
Checking formula 0 : !((X(F(X((!(G("(((((((m4_0+m4_1)+(m4_2+m4_3))+((m4_4+m4_5)+(m4_6+m4_7)))+(((m4_8+m4_9)+(m4_10+m4_11))+((m4_12+m4_13)+(m4_14+m4_15))))+...1048
Formula 0 simplified : !XFX(!G"(((((((m4_0+m4_1)+(m4_2+m4_3))+((m4_4+m4_5)+(m4_6+m4_7)))+(((m4_8+m4_9)+(m4_10+m4_11))+((m4_12+m4_13)+(m4_14+m4_15))))+((((m...1031
Reverse transition relation is NOT exact ! Due to transitions t546.t651.t735, t567.t672.t756, t588.t693.t777, t547.t652.t736, t568.t673.t757, t589.t694.t77...1170
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
35 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.368687,33472,1,0,406,90417,404,213,3868,112458,591
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-15 finished in 37220 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-LTLCardinality-15 TRUE TECHNIQUES CL_INSENSITIVE
[2022-05-16 11:36:01] [INFO ] Flatten gal took : 52 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17966494109685288055
[2022-05-16 11:36:01] [INFO ] Too many transitions (2418) to apply POR reductions. Disabling POR matrices.
[2022-05-16 11:36:01] [INFO ] Applying decomposition
[2022-05-16 11:36:01] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17966494109685288055
Running compilation step : cd /tmp/ltsmin17966494109685288055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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 11:36:01] [INFO ] Flatten gal took : 53 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/graph7415817787499497355.txt' '-o' '/tmp/graph7415817787499497355.bin' '-w' '/tmp/graph7415817787499497355.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7415817787499497355.bin' '-l' '-1' '-v' '-w' '/tmp/graph7415817787499497355.weights' '-q' '0' '-e' '0.001'
[2022-05-16 11:36:01] [INFO ] Decomposing Gal with order
[2022-05-16 11:36:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:36:02] [INFO ] Removed a total of 397 redundant transitions.
[2022-05-16 11:36:02] [INFO ] Flatten gal took : 185 ms
[2022-05-16 11:36:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 18 ms.
[2022-05-16 11:36:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality8740645516571609682.gal : 14 ms
[2022-05-16 11:36:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality16723233890884558526.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/LTLCardinality8740645516571609682.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16723233890884558526.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 2 LTL properties
Checking formula 0 : !((X(G(F(F(X("((((((gu475.l38_0+gu475.l38_1)+(gu475.l38_2+gu475.l38_3))+((gu475.l38_4+gu475.l38_5)+(gu475.l38_6+gu475.l38_7)))+(((gu47...1280
Formula 0 simplified : !XGFX"((((((gu475.l38_0+gu475.l38_1)+(gu475.l38_2+gu475.l38_3))+((gu475.l38_4+gu475.l38_5)+(gu475.l38_6+gu475.l38_7)))+(((gu475.l38_...1267
Compilation finished in 4877 ms.
Running link step : cd /tmp/ltsmin17966494109685288055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17966494109685288055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>(<>(X((LTLAPp0==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 11:58:02] [INFO ] Applying decomposition
[2022-05-16 11:58:03] [INFO ] Flatten gal took : 220 ms
[2022-05-16 11:58:03] [INFO ] Decomposing Gal with order
[2022-05-16 11:58:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 11:58:03] [INFO ] Removed a total of 635 redundant transitions.
[2022-05-16 11:58:03] [INFO ] Flatten gal took : 336 ms
[2022-05-16 11:58:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2022-05-16 11:58:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality7510619079690492012.gal : 30 ms
[2022-05-16 11:58:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality17024195120140249941.ltl : 5 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/LTLCardinality7510619079690492012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17024195120140249941.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 2 LTL properties
Checking formula 0 : !((X(G(F(F(X("((((((gLegalResident0.l38_0+gLegalResident1.l38_1)+(gLegalResident2.l38_2+gLegalResident3.l38_3))+((gLegalResident4.l38_...2751
Formula 0 simplified : !XGFX"((((((gLegalResident0.l38_0+gLegalResident1.l38_1)+(gLegalResident2.l38_2+gLegalResident3.l38_3))+((gLegalResident4.l38_4+gLeg...2738
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin17966494109685288055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](<>(<>(X((LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17966494109685288055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X(X(X((((LTLAPp1==true) U []((LTLAPp2==true)))&&(LTLAPp3==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 12:20:02] [INFO ] Flatten gal took : 412 ms
[2022-05-16 12:20:04] [INFO ] Input system was already deterministic with 2418 transitions.
[2022-05-16 12:20:04] [INFO ] Transformed 2593 places.
[2022-05-16 12:20:04] [INFO ] Transformed 2418 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 12:20:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality1077913395857778561.gal : 23 ms
[2022-05-16 12:20:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality10999597461205129158.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/LTLCardinality1077913395857778561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10999597461205129158.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(F(F(X("((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_...776
Formula 0 simplified : !XGFX"((((((l38_0+l38_1)+(l38_2+l38_3))+((l38_4+l38_5)+(l38_6+l38_7)))+(((l38_8+l38_9)+(l38_10+l38_11))+((l38_12+l38_13)+(l38_14+l38...763

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

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