Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280400313.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FamilyReunion-PT-L00050M0005C002P002G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280400313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 103K Apr 11 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 634K Apr 11 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 375K Apr 11 20:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 11 20:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 52K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 226K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 86K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 233K Apr 11 21:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 21:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 818K Apr 11 21:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.9M Apr 11 21:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.7M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716655467110

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00050M0005C002P002G001
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-25 16:44:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 16:44:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:44:30] [INFO ] Load time of PNML (sax parser for PT used): 527 ms
[2024-05-25 16:44:30] [INFO ] Transformed 12194 places.
[2024-05-25 16:44:30] [INFO ] Transformed 10560 transitions.
[2024-05-25 16:44:30] [INFO ] Parsed PT model containing 12194 places and 10560 transitions and 32238 arcs in 680 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 17 places and 0 transitions.
Support contains 3032 out of 12177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Reduce places removed 173 places and 0 transitions.
Discarding 1223 places :
Implicit places reduction removed 1223 places
Iterating post reduction 0 with 1396 rules applied. Total rules applied 1396 place count 10781 transition count 10560
Discarding 665 places :
Symmetric choice reduction at 1 with 665 rule applications. Total rules 2061 place count 10116 transition count 9844
Iterating global reduction 1 with 665 rules applied. Total rules applied 2726 place count 10116 transition count 9844
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2777 place count 10065 transition count 9844
Discarding 406 places :
Symmetric choice reduction at 2 with 406 rule applications. Total rules 3183 place count 9659 transition count 9438
Iterating global reduction 2 with 406 rules applied. Total rules applied 3589 place count 9659 transition count 9438
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 153 rules applied. Total rules applied 3742 place count 9608 transition count 9336
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 3996 place count 9354 transition count 9082
Iterating global reduction 3 with 254 rules applied. Total rules applied 4250 place count 9354 transition count 9082
Applied a total of 4250 rules in 6917 ms. Remains 9354 /12177 variables (removed 2823) and now considering 9082/10560 (removed 1478) transitions.
// Phase 1: matrix 9082 rows 9354 cols
[2024-05-25 16:44:38] [INFO ] Computed 1332 invariants in 745 ms
[2024-05-25 16:44:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:44:40] [INFO ] Implicit Places using invariants in 2646 ms returned []
[2024-05-25 16:44:40] [INFO ] Invariant cache hit.
[2024-05-25 16:44:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:44:42] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 4190 ms to find 0 implicit places.
[2024-05-25 16:44:42] [INFO ] Invariant cache hit.
[2024-05-25 16:44:43] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:44:43] [INFO ] Dead Transitions using invariants and state equation in 1417 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9354/12177 places, 9082/10560 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12528 ms. Remains : 9354/12177 places, 9082/10560 transitions.
Support contains 3032 out of 9354 places after structural reductions.
[2024-05-25 16:44:44] [INFO ] Flatten gal took : 696 ms
[2024-05-25 16:44:45] [INFO ] Flatten gal took : 365 ms
[2024-05-25 16:44:46] [INFO ] Input system was already deterministic with 9082 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1016 ms. (steps per millisecond=9 ) properties (out of 33) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-25 16:44:47] [INFO ] Invariant cache hit.
[2024-05-25 16:44:51] [INFO ] [Real]Absence check using 0 positive and 1332 generalized place invariants in 934 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:634)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-25 16:45:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 16:45:12] [INFO ] After 25077ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 9354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Graph (complete) has 13521 edges and 9354 vertex of which 9152 are kept as prefixes of interest. Removing 202 places using SCC suffix rule.28 ms
Discarding 202 places :
Also discarding 202 output transitions
Drop transitions removed 202 transitions
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Discarding 610 places :
Implicit places reduction removed 610 places
Drop transitions removed 5123 transitions
Trivial Post-agglo rules discarded 5123 transitions
Performed 5123 trivial Post agglomeration. Transition count delta: 5123
Iterating post reduction 0 with 5782 rules applied. Total rules applied 5783 place count 8542 transition count 3708
Reduce places removed 5123 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 5133 rules applied. Total rules applied 10916 place count 3419 transition count 3698
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 10926 place count 3409 transition count 3698
Performed 665 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 665 Pre rules applied. Total rules applied 10926 place count 3409 transition count 3033
Deduced a syphon composed of 665 places in 2 ms
Ensure Unique test removed 306 places
Reduce places removed 971 places and 0 transitions.
Iterating global reduction 3 with 1636 rules applied. Total rules applied 12562 place count 2438 transition count 3033
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 3 with 204 rules applied. Total rules applied 12766 place count 2438 transition count 2829
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 12970 place count 2234 transition count 2829
Discarding 565 places :
Symmetric choice reduction at 5 with 565 rule applications. Total rules 13535 place count 1669 transition count 2064
Iterating global reduction 5 with 565 rules applied. Total rules applied 14100 place count 1669 transition count 2064
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 5 with 103 rules applied. Total rules applied 14203 place count 1669 transition count 1961
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 6 with 103 rules applied. Total rules applied 14306 place count 1566 transition count 1961
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 50 Pre rules applied. Total rules applied 14306 place count 1566 transition count 1911
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 14406 place count 1516 transition count 1911
Discarding 205 places :
Symmetric choice reduction at 7 with 205 rule applications. Total rules 14611 place count 1311 transition count 1606
Iterating global reduction 7 with 205 rules applied. Total rules applied 14816 place count 1311 transition count 1606
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 7 with 507 rules applied. Total rules applied 15323 place count 1209 transition count 1201
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 8 with 102 rules applied. Total rules applied 15425 place count 1107 transition count 1201
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 52 Pre rules applied. Total rules applied 15425 place count 1107 transition count 1149
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 9 with 104 rules applied. Total rules applied 15529 place count 1055 transition count 1149
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 15531 place count 1053 transition count 1047
Iterating global reduction 9 with 2 rules applied. Total rules applied 15533 place count 1053 transition count 1047
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 9 with 204 rules applied. Total rules applied 15737 place count 1002 transition count 894
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 10 with 51 rules applied. Total rules applied 15788 place count 951 transition count 894
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 204
Deduced a syphon composed of 204 places in 1 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 11 with 408 rules applied. Total rules applied 16196 place count 747 transition count 690
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 16197 place count 747 transition count 689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 16198 place count 746 transition count 689
Free-agglomeration rule (complex) applied 105 times.
Iterating global reduction 12 with 105 rules applied. Total rules applied 16303 place count 746 transition count 584
Ensure Unique test removed 101 places
Reduce places removed 206 places and 0 transitions.
Iterating post reduction 12 with 206 rules applied. Total rules applied 16509 place count 540 transition count 584
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 16510 place count 540 transition count 584
Applied a total of 16510 rules in 1376 ms. Remains 540 /9354 variables (removed 8814) and now considering 584/9082 (removed 8498) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1376 ms. Remains : 540/9354 places, 584/9082 transitions.
Incomplete random walk after 10000 steps, including 46 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 584 rows 540 cols
[2024-05-25 16:45:14] [INFO ] Computed 112 invariants in 9 ms
[2024-05-25 16:45:14] [INFO ] [Real]Absence check using 0 positive and 112 generalized place invariants in 39 ms returned sat
[2024-05-25 16:45:14] [INFO ] After 388ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 16:45:15] [INFO ] After 506ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-25 16:45:15] [INFO ] After 788ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Finished Parikh walk after 161 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 6 ms.
Computed a total of 9354 stabilizing places and 9082 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9354 transition count 9082
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((!p0||X(F((F(p0)&&p1))))))))))'
Support contains 153 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8741 transition count 9082
Discarding 465 places :
Symmetric choice reduction at 1 with 465 rule applications. Total rules 1078 place count 8276 transition count 8367
Iterating global reduction 1 with 465 rules applied. Total rules applied 1543 place count 8276 transition count 8367
Discarding 258 places :
Symmetric choice reduction at 1 with 258 rule applications. Total rules 1801 place count 8018 transition count 8009
Iterating global reduction 1 with 258 rules applied. Total rules applied 2059 place count 8018 transition count 8009
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2110 place count 7967 transition count 8009
Discarding 308 places :
Symmetric choice reduction at 2 with 308 rule applications. Total rules 2418 place count 7659 transition count 7601
Iterating global reduction 2 with 308 rules applied. Total rules applied 2726 place count 7659 transition count 7601
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2777 place count 7608 transition count 7601
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3134 place count 7251 transition count 7244
Iterating global reduction 3 with 357 rules applied. Total rules applied 3491 place count 7251 transition count 7244
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3746 place count 6996 transition count 6989
Iterating global reduction 3 with 255 rules applied. Total rules applied 4001 place count 6996 transition count 6989
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4256 place count 6741 transition count 6734
Iterating global reduction 3 with 255 rules applied. Total rules applied 4511 place count 6741 transition count 6734
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4766 place count 6486 transition count 6479
Iterating global reduction 3 with 255 rules applied. Total rules applied 5021 place count 6486 transition count 6479
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5276 place count 6231 transition count 6224
Iterating global reduction 3 with 255 rules applied. Total rules applied 5531 place count 6231 transition count 6224
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5786 place count 5976 transition count 5969
Iterating global reduction 3 with 255 rules applied. Total rules applied 6041 place count 5976 transition count 5969
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6296 place count 5721 transition count 5714
Iterating global reduction 3 with 255 rules applied. Total rules applied 6551 place count 5721 transition count 5714
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6806 place count 5466 transition count 5459
Iterating global reduction 3 with 255 rules applied. Total rules applied 7061 place count 5466 transition count 5459
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7316 place count 5211 transition count 5204
Iterating global reduction 3 with 255 rules applied. Total rules applied 7571 place count 5211 transition count 5204
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7826 place count 4956 transition count 4949
Iterating global reduction 3 with 255 rules applied. Total rules applied 8081 place count 4956 transition count 4949
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8336 place count 4701 transition count 4694
Iterating global reduction 3 with 255 rules applied. Total rules applied 8591 place count 4701 transition count 4694
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 8795 place count 4701 transition count 4490
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 8846 place count 4650 transition count 4439
Iterating global reduction 4 with 51 rules applied. Total rules applied 8897 place count 4650 transition count 4439
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 8948 place count 4599 transition count 4388
Iterating global reduction 4 with 51 rules applied. Total rules applied 8999 place count 4599 transition count 4388
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 102 rules applied. Total rules applied 9101 place count 4548 transition count 4337
Applied a total of 9101 rules in 21010 ms. Remains 4548 /9354 variables (removed 4806) and now considering 4337/9082 (removed 4745) transitions.
// Phase 1: matrix 4337 rows 4548 cols
[2024-05-25 16:45:36] [INFO ] Computed 566 invariants in 81 ms
[2024-05-25 16:45:37] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:45:39] [INFO ] Implicit Places using invariants in 2639 ms returned [454, 2139, 3152, 3162]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2649 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4544/9354 places, 4337/9082 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4543 transition count 4336
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4543 transition count 4336
Applied a total of 2 rules in 1108 ms. Remains 4543 /4544 variables (removed 1) and now considering 4336/4337 (removed 1) transitions.
// Phase 1: matrix 4336 rows 4543 cols
[2024-05-25 16:45:40] [INFO ] Computed 562 invariants in 78 ms
[2024-05-25 16:45:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:45:42] [INFO ] Implicit Places using invariants in 2256 ms returned [429, 454, 3138, 3162]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2260 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4539/9354 places, 4336/9082 transitions.
Applied a total of 0 rules in 552 ms. Remains 4539 /4539 variables (removed 0) and now considering 4336/4336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 27581 ms. Remains : 4539/9354 places, 4336/9082 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 401 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(OR (GEQ s1587 1) (GEQ s1717 1) (GEQ s1648 1) (GEQ s1591 1) (GEQ s1713 1) (GEQ s1652 1) (GEQ s1709 1) (GEQ s1640 1) (GEQ s1583 1) (GEQ s1705 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 1987 ms.
Product exploration explored 100000 steps with 20000 reset in 1871 ms.
Computed a total of 4539 stabilizing places and 4336 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4539 transition count 4336
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), true, (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 23 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-00 finished in 33711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(G(p0))) U (F(p1)&&(F(!p3)||p2))))))'
Support contains 669 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8741 transition count 9082
Discarding 563 places :
Symmetric choice reduction at 1 with 563 rule applications. Total rules 1176 place count 8178 transition count 8469
Iterating global reduction 1 with 563 rules applied. Total rules applied 1739 place count 8178 transition count 8469
Discarding 156 places :
Symmetric choice reduction at 1 with 156 rule applications. Total rules 1895 place count 8022 transition count 8213
Iterating global reduction 1 with 156 rules applied. Total rules applied 2051 place count 8022 transition count 8213
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2102 place count 7971 transition count 8213
Discarding 105 places :
Symmetric choice reduction at 2 with 105 rule applications. Total rules 2207 place count 7866 transition count 7958
Iterating global reduction 2 with 105 rules applied. Total rules applied 2312 place count 7866 transition count 7958
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 2363 place count 7815 transition count 7958
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 2567 place count 7611 transition count 7754
Iterating global reduction 3 with 204 rules applied. Total rules applied 2771 place count 7611 transition count 7754
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 153 rules applied. Total rules applied 2924 place count 7560 transition count 7652
Applied a total of 2924 rules in 8413 ms. Remains 7560 /9354 variables (removed 1794) and now considering 7652/9082 (removed 1430) transitions.
// Phase 1: matrix 7652 rows 7560 cols
[2024-05-25 16:45:58] [INFO ] Computed 566 invariants in 132 ms
[2024-05-25 16:45:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:45:59] [INFO ] Implicit Places using invariants in 1214 ms returned []
[2024-05-25 16:45:59] [INFO ] Invariant cache hit.
[2024-05-25 16:46:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:46:00] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 2287 ms to find 0 implicit places.
[2024-05-25 16:46:00] [INFO ] Invariant cache hit.
[2024-05-25 16:46:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:46:01] [INFO ] Dead Transitions using invariants and state equation in 1095 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7560/9354 places, 7652/9082 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11800 ms. Remains : 7560/9354 places, 7652/9082 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p1) (AND (NOT p2) p3)), (OR (NOT p1) (AND (NOT p2) p3)), (NOT p1), (OR (AND (NOT p1) p3) (AND (NOT p2) p3) (AND (NOT p0) p3)), (AND p3 (NOT p0)), (AND (NOT p1) p3), p3]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=p3, acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={0} source=3 dest: 5}], [{ cond=(AND p3 p0), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=5 dest: 5}], [{ cond=p3, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (GEQ s6489 1) (GEQ s6420 1) (GEQ s6485 1) (GEQ s6424 1) (GEQ s6481 1) (GEQ s6412 1) (GEQ s6477 1) (GEQ s6416 1) (GEQ s6473 1) (GEQ s6404 1) (GEQ s6...], 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 97 reset in 1498 ms.
Product exploration explored 100000 steps with 95 reset in 1615 ms.
Computed a total of 7560 stabilizing places and 7652 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7560 transition count 7652
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT (AND (NOT p2) p3))), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 117 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1065 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=56 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT (AND (NOT p2) p3))), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 12 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01 finished in 19435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 210 out of 9354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Graph (complete) has 13521 edges and 9354 vertex of which 6180 are kept as prefixes of interest. Removing 3174 places using SCC suffix rule.30 ms
Discarding 3174 places :
Also discarding 3011 output transitions
Drop transitions removed 3011 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Drop transitions removed 3826 transitions
Trivial Post-agglo rules discarded 3826 transitions
Performed 3826 trivial Post agglomeration. Transition count delta: 3826
Iterating post reduction 0 with 4439 rules applied. Total rules applied 4440 place count 5516 transition count 2194
Reduce places removed 3826 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3827 rules applied. Total rules applied 8267 place count 1690 transition count 2193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8268 place count 1689 transition count 2193
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 203 Pre rules applied. Total rules applied 8268 place count 1689 transition count 1990
Deduced a syphon composed of 203 places in 0 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 3 with 406 rules applied. Total rules applied 8674 place count 1486 transition count 1990
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8929 place count 1231 transition count 1735
Iterating global reduction 3 with 255 rules applied. Total rules applied 9184 place count 1231 transition count 1735
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9186 place count 1230 transition count 1734
Applied a total of 9186 rules in 412 ms. Remains 1230 /9354 variables (removed 8124) and now considering 1734/9082 (removed 7348) transitions.
// Phase 1: matrix 1734 rows 1230 cols
[2024-05-25 16:46:09] [INFO ] Computed 103 invariants in 21 ms
[2024-05-25 16:46:10] [INFO ] Implicit Places using invariants in 920 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 822, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 841, 842, 843, 844, 845, 846, 847, 848, 849, 850, 851, 852, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 864, 865, 866, 867, 868, 869, 870, 871, 872]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 924 ms to find 102 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1128/9354 places, 1734/9082 transitions.
Drop transitions removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 1128 transition count 1428
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 1 with 306 rules applied. Total rules applied 612 place count 822 transition count 1428
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -459
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 714 place count 771 transition count 1887
Applied a total of 714 rules in 68 ms. Remains 771 /1128 variables (removed 357) and now considering 1887/1734 (removed -153) transitions.
// Phase 1: matrix 1887 rows 771 cols
[2024-05-25 16:46:10] [INFO ] Computed 1 invariants in 13 ms
[2024-05-25 16:46:10] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-25 16:46:10] [INFO ] Invariant cache hit.
[2024-05-25 16:46:11] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 771/9354 places, 1887/9082 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2460 ms. Remains : 771/9354 places, 1887/9082 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s698 1) (LT s633 1) (LT s759 1) (LT s694 1) (LT s629 1) (LT s755 1) (LT s690 1) (LT s625 1) (LT s751 1) (LT s686 1) (LT s621 1) (LT s747 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1040 reset in 2027 ms.
Product exploration explored 100000 steps with 1047 reset in 2021 ms.
Computed a total of 771 stabilizing places and 1887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 771 transition count 1887
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-02 finished in 9382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(G(!p1)))))'
Support contains 663 out of 9354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Graph (complete) has 13521 edges and 9354 vertex of which 9095 are kept as prefixes of interest. Removing 259 places using SCC suffix rule.14 ms
Discarding 259 places :
Also discarding 308 output transitions
Drop transitions removed 308 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 307 places :
Implicit places reduction removed 307 places
Drop transitions removed 4235 transitions
Trivial Post-agglo rules discarded 4235 transitions
Performed 4235 trivial Post agglomeration. Transition count delta: 4235
Iterating post reduction 0 with 4542 rules applied. Total rules applied 4543 place count 8737 transition count 4488
Reduce places removed 4235 places and 0 transitions.
Iterating post reduction 1 with 4235 rules applied. Total rules applied 8778 place count 4502 transition count 4488
Performed 866 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 866 Pre rules applied. Total rules applied 8778 place count 4502 transition count 3622
Deduced a syphon composed of 866 places in 2 ms
Ensure Unique test removed 306 places
Reduce places removed 1172 places and 0 transitions.
Iterating global reduction 2 with 2038 rules applied. Total rules applied 10816 place count 3330 transition count 3622
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 2 with 204 rules applied. Total rules applied 11020 place count 3330 transition count 3418
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 11224 place count 3126 transition count 3418
Discarding 311 places :
Symmetric choice reduction at 4 with 311 rule applications. Total rules 11535 place count 2815 transition count 2857
Iterating global reduction 4 with 311 rules applied. Total rules applied 11846 place count 2815 transition count 2857
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 4 with 154 rules applied. Total rules applied 12000 place count 2764 transition count 2754
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 5 with 103 rules applied. Total rules applied 12103 place count 2661 transition count 2754
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 102 Pre rules applied. Total rules applied 12103 place count 2661 transition count 2652
Deduced a syphon composed of 102 places in 2 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 6 with 204 rules applied. Total rules applied 12307 place count 2559 transition count 2652
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 12312 place count 2554 transition count 2397
Iterating global reduction 6 with 5 rules applied. Total rules applied 12317 place count 2554 transition count 2397
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Discarding 204 places :
Implicit places reduction removed 204 places
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 6 with 612 rules applied. Total rules applied 12929 place count 2350 transition count 1989
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 7 with 204 rules applied. Total rules applied 13133 place count 2146 transition count 1989
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 102 Pre rules applied. Total rules applied 13133 place count 2146 transition count 1887
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 8 with 204 rules applied. Total rules applied 13337 place count 2044 transition count 1887
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 7 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 13439 place count 1993 transition count 1836
Applied a total of 13439 rules in 962 ms. Remains 1993 /9354 variables (removed 7361) and now considering 1836/9082 (removed 7246) transitions.
// Phase 1: matrix 1836 rows 1993 cols
[2024-05-25 16:46:19] [INFO ] Computed 412 invariants in 31 ms
[2024-05-25 16:46:20] [INFO ] Implicit Places using invariants in 1487 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 408, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 1889, 1941]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 1491 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1888/9354 places, 1836/9082 transitions.
Drop transitions removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 1888 transition count 1428
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 1 with 408 rules applied. Total rules applied 816 place count 1480 transition count 1428
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 816 place count 1480 transition count 1377
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 918 place count 1429 transition count 1377
Applied a total of 918 rules in 55 ms. Remains 1429 /1888 variables (removed 459) and now considering 1377/1836 (removed 459) transitions.
// Phase 1: matrix 1377 rows 1429 cols
[2024-05-25 16:46:20] [INFO ] Computed 307 invariants in 12 ms
[2024-05-25 16:46:21] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-25 16:46:21] [INFO ] Invariant cache hit.
[2024-05-25 16:46:22] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1429/9354 places, 1377/9082 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4037 ms. Remains : 1429/9354 places, 1377/9082 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s870 1) (LT s1176 1)) (OR (LT s1013 1) (LT s1319 1)) (OR (LT s865 1) (LT s1171 1)) (OR (LT s1018 1) (LT s1324 1)) (OR (LT s1023 1) (LT s13...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 476 reset in 1772 ms.
Product exploration explored 100000 steps with 476 reset in 1861 ms.
Computed a total of 1429 stabilizing places and 1377 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1429 transition count 1377
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-03 finished in 11847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 357 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8741 transition count 9082
Discarding 465 places :
Symmetric choice reduction at 1 with 465 rule applications. Total rules 1078 place count 8276 transition count 8367
Iterating global reduction 1 with 465 rules applied. Total rules applied 1543 place count 8276 transition count 8367
Discarding 358 places :
Symmetric choice reduction at 1 with 358 rule applications. Total rules 1901 place count 7918 transition count 8009
Iterating global reduction 1 with 358 rules applied. Total rules applied 2259 place count 7918 transition count 8009
Discarding 208 places :
Symmetric choice reduction at 1 with 208 rule applications. Total rules 2467 place count 7710 transition count 7601
Iterating global reduction 1 with 208 rules applied. Total rules applied 2675 place count 7710 transition count 7601
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 102 rules applied. Total rules applied 2777 place count 7608 transition count 7601
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 3134 place count 7251 transition count 7244
Iterating global reduction 2 with 357 rules applied. Total rules applied 3491 place count 7251 transition count 7244
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 153 rules applied. Total rules applied 3644 place count 7200 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 3899 place count 6945 transition count 6887
Iterating global reduction 3 with 255 rules applied. Total rules applied 4154 place count 6945 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4409 place count 6690 transition count 6632
Iterating global reduction 3 with 255 rules applied. Total rules applied 4664 place count 6690 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4919 place count 6435 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 5174 place count 6435 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5429 place count 6180 transition count 6122
Iterating global reduction 3 with 255 rules applied. Total rules applied 5684 place count 6180 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5939 place count 5925 transition count 5867
Iterating global reduction 3 with 255 rules applied. Total rules applied 6194 place count 5925 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6449 place count 5670 transition count 5612
Iterating global reduction 3 with 255 rules applied. Total rules applied 6704 place count 5670 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6959 place count 5415 transition count 5357
Iterating global reduction 3 with 255 rules applied. Total rules applied 7214 place count 5415 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7469 place count 5160 transition count 5102
Iterating global reduction 3 with 255 rules applied. Total rules applied 7724 place count 5160 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7979 place count 4905 transition count 4847
Iterating global reduction 3 with 255 rules applied. Total rules applied 8234 place count 4905 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8489 place count 4650 transition count 4592
Iterating global reduction 3 with 255 rules applied. Total rules applied 8744 place count 4650 transition count 4592
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 8948 place count 4650 transition count 4388
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 8999 place count 4599 transition count 4337
Iterating global reduction 4 with 51 rules applied. Total rules applied 9050 place count 4599 transition count 4337
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 9101 place count 4548 transition count 4286
Iterating global reduction 4 with 51 rules applied. Total rules applied 9152 place count 4548 transition count 4286
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 102 rules applied. Total rules applied 9254 place count 4497 transition count 4235
Applied a total of 9254 rules in 18779 ms. Remains 4497 /9354 variables (removed 4857) and now considering 4235/9082 (removed 4847) transitions.
// Phase 1: matrix 4235 rows 4497 cols
[2024-05-25 16:46:48] [INFO ] Computed 515 invariants in 78 ms
[2024-05-25 16:46:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:46:51] [INFO ] Implicit Places using invariants in 2139 ms returned [1723, 2722]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2145 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4495/9354 places, 4235/9082 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4494 transition count 4234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4494 transition count 4234
Applied a total of 2 rules in 1057 ms. Remains 4494 /4495 variables (removed 1) and now considering 4234/4235 (removed 1) transitions.
// Phase 1: matrix 4234 rows 4494 cols
[2024-05-25 16:46:52] [INFO ] Computed 513 invariants in 80 ms
[2024-05-25 16:46:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:46:54] [INFO ] Implicit Places using invariants in 2375 ms returned [2722]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2379 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4493/9354 places, 4234/9082 transitions.
Applied a total of 0 rules in 656 ms. Remains 4493 /4493 variables (removed 0) and now considering 4234/4234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 25021 ms. Remains : 4493/9354 places, 4234/9082 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s3997 1) (GEQ s4099 1)) (AND (GEQ s3992 1) (GEQ s4094 1)) (AND (GEQ s4032 1) (GEQ s4236 1)) (AND (GEQ s4027 1) (GEQ s4231 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 34 reset in 2134 ms.
Product exploration explored 100000 steps with 34 reset in 2136 ms.
Computed a total of 4493 stabilizing places and 4234 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4493 transition count 4234
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 119 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Finished random walk after 1379 steps, including 0 resets, run visited all 3 properties in 105 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 240 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
// Phase 1: matrix 4234 rows 4493 cols
[2024-05-25 16:47:02] [INFO ] Computed 512 invariants in 82 ms
[2024-05-25 16:47:13] [INFO ] [Real]Absence check using 0 positive and 512 generalized place invariants in 1246 ms returned sat
[2024-05-25 16:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:47:17] [INFO ] [Real]Absence check using state equation in 4343 ms returned unknown
Could not prove EG (NOT p0)
Support contains 357 out of 4493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4493/4493 places, 4234/4234 transitions.
Graph (complete) has 6113 edges and 4493 vertex of which 3062 are kept as prefixes of interest. Removing 1431 places using SCC suffix rule.4 ms
Discarding 1431 places :
Also discarding 1225 output transitions
Drop transitions removed 1225 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 1479 transitions
Trivial Post-agglo rules discarded 1479 transitions
Performed 1479 trivial Post agglomeration. Transition count delta: 1479
Iterating post reduction 0 with 1479 rules applied. Total rules applied 1480 place count 3011 transition count 1479
Reduce places removed 1479 places and 0 transitions.
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 1 with 1632 rules applied. Total rules applied 3112 place count 1532 transition count 1326
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 2 with 153 rules applied. Total rules applied 3265 place count 1379 transition count 1326
Performed 408 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 408 Pre rules applied. Total rules applied 3265 place count 1379 transition count 918
Deduced a syphon composed of 408 places in 0 ms
Ensure Unique test removed 153 places
Reduce places removed 561 places and 0 transitions.
Iterating global reduction 3 with 969 rules applied. Total rules applied 4234 place count 818 transition count 918
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 4336 place count 767 transition count 867
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 3 with 51 rules applied. Total rules applied 4387 place count 716 transition count 816
Applied a total of 4387 rules in 207 ms. Remains 716 /4493 variables (removed 3777) and now considering 816/4234 (removed 3418) transitions.
// Phase 1: matrix 816 rows 716 cols
[2024-05-25 16:47:17] [INFO ] Computed 102 invariants in 7 ms
[2024-05-25 16:47:18] [INFO ] Implicit Places using invariants in 444 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 447 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 666/4493 places, 816/4234 transitions.
Applied a total of 0 rules in 8 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 663 ms. Remains : 666/4493 places, 816/4234 transitions.
Computed a total of 666 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 666 transition count 816
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Finished random walk after 286 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND p0 p1)), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
// Phase 1: matrix 816 rows 666 cols
[2024-05-25 16:47:19] [INFO ] Computed 52 invariants in 5 ms
[2024-05-25 16:47:22] [INFO ] [Real]Absence check using 0 positive and 52 generalized place invariants in 47 ms returned sat
[2024-05-25 16:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:47:22] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2024-05-25 16:47:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:47:25] [INFO ] [Nat]Absence check using 0 positive and 52 generalized place invariants in 31 ms returned sat
[2024-05-25 16:47:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:47:25] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2024-05-25 16:47:25] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 76 ms.
[2024-05-25 16:47:28] [INFO ] Added : 180 causal constraints over 36 iterations in 2373 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Product exploration explored 100000 steps with 325 reset in 1478 ms.
Product exploration explored 100000 steps with 325 reset in 1505 ms.
Built C files in :
/tmp/ltsmin17703367305183545099
[2024-05-25 16:47:31] [INFO ] Computing symmetric may disable matrix : 816 transitions.
[2024-05-25 16:47:31] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:47:31] [INFO ] Computing symmetric may enable matrix : 816 transitions.
[2024-05-25 16:47:31] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:47:31] [INFO ] Computing Do-Not-Accords matrix : 816 transitions.
[2024-05-25 16:47:31] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:47:31] [INFO ] Built C files in 240ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17703367305183545099
Running compilation step : cd /tmp/ltsmin17703367305183545099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin17703367305183545099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17703367305183545099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 357 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 816/816 transitions.
Applied a total of 0 rules in 10 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2024-05-25 16:47:34] [INFO ] Invariant cache hit.
[2024-05-25 16:47:34] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-25 16:47:34] [INFO ] Invariant cache hit.
[2024-05-25 16:47:35] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2024-05-25 16:47:35] [INFO ] Redundant transitions in 54 ms returned []
[2024-05-25 16:47:35] [INFO ] Invariant cache hit.
[2024-05-25 16:47:36] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1563 ms. Remains : 666/666 places, 816/816 transitions.
Built C files in :
/tmp/ltsmin7944219363695170730
[2024-05-25 16:47:36] [INFO ] Computing symmetric may disable matrix : 816 transitions.
[2024-05-25 16:47:36] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:47:36] [INFO ] Computing symmetric may enable matrix : 816 transitions.
[2024-05-25 16:47:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:47:36] [INFO ] Computing Do-Not-Accords matrix : 816 transitions.
[2024-05-25 16:47:36] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:47:36] [INFO ] Built C files in 177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7944219363695170730
Running compilation step : cd /tmp/ltsmin7944219363695170730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin7944219363695170730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7944219363695170730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 16:47:39] [INFO ] Flatten gal took : 33 ms
[2024-05-25 16:47:39] [INFO ] Flatten gal took : 33 ms
[2024-05-25 16:47:39] [INFO ] Time to serialize gal into /tmp/LTL14983771662315954614.gal : 38 ms
[2024-05-25 16:47:39] [INFO ] Time to serialize properties into /tmp/LTL11355297944179041882.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14983771662315954614.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14219872206348439831.hoa' '-atoms' '/tmp/LTL11355297944179041882.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11355297944179041882.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14219872206348439831.hoa
Detected timeout of ITS tools.
[2024-05-25 16:47:55] [INFO ] Flatten gal took : 28 ms
[2024-05-25 16:47:55] [INFO ] Flatten gal took : 27 ms
[2024-05-25 16:47:55] [INFO ] Time to serialize gal into /tmp/LTL4657352808073388289.gal : 21 ms
[2024-05-25 16:47:55] [INFO ] Time to serialize properties into /tmp/LTL13216645397303305225.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4657352808073388289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13216645397303305225.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((p6_11_0<1)&&(p6_39_2<1))&&((p6_25_1<1)&&(p6_7_0<1)))&&(((p6_35_2<1)&&(p6_21_1<1))&&((p6_19_0<1)&&(p6_47_2<1))))&&(...7138
Formula 0 simplified : XG(!"((((((((((l20_14>=1)&&(pl1_14_0>=1))||((l20_9>=1)&&(pl1_9_0>=1)))||(((l20_49>=1)&&(pl1_49_2>=1))||((l20_44>=1)&&(pl1_44_2>=1)))...7130
Detected timeout of ITS tools.
[2024-05-25 16:48:10] [INFO ] Flatten gal took : 24 ms
[2024-05-25 16:48:10] [INFO ] Applying decomposition
[2024-05-25 16:48:10] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3160721867946681002.txt' '-o' '/tmp/graph3160721867946681002.bin' '-w' '/tmp/graph3160721867946681002.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3160721867946681002.bin' '-l' '-1' '-v' '-w' '/tmp/graph3160721867946681002.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:48:10] [INFO ] Decomposing Gal with order
[2024-05-25 16:48:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:48:10] [INFO ] Removed a total of 520 redundant transitions.
[2024-05-25 16:48:10] [INFO ] Flatten gal took : 150 ms
[2024-05-25 16:48:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 22 ms.
[2024-05-25 16:48:11] [INFO ] Time to serialize gal into /tmp/LTL2709670208005568155.gal : 19 ms
[2024-05-25 16:48:11] [INFO ] Time to serialize properties into /tmp/LTL1931575838696340425.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2709670208005568155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1931575838696340425.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((i6.u6.p6_11_0<1)&&(i47.u135.p6_39_2<1))&&((i46.u108.p6_25_1<1)&&(i3.u3.p6_7_0<1)))&&(((i11.u62.p6_35_2<1)&&(i8.u30...11004
Formula 0 simplified : XG(!"((((((((((i30.u143.l20_14>=1)&&(i30.u187.pl1_14_0>=1))||((i5.u159.l20_9>=1)&&(i5.u221.pl1_9_0>=1)))||(((i26.u71.l20_49>=1)&&(i2...10996
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4196815474600393770
[2024-05-25 16:48:26] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4196815474600393770
Running compilation step : cd /tmp/ltsmin4196815474600393770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2054 ms.
Running link step : cd /tmp/ltsmin4196815474600393770;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin4196815474600393770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04 finished in 131098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 663 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Discarding 307 places :
Implicit places reduction removed 307 places
Iterating post reduction 0 with 307 rules applied. Total rules applied 307 place count 9047 transition count 9082
Discarding 567 places :
Symmetric choice reduction at 1 with 567 rule applications. Total rules 874 place count 8480 transition count 8265
Iterating global reduction 1 with 567 rules applied. Total rules applied 1441 place count 8480 transition count 8265
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 1801 place count 8120 transition count 7805
Iterating global reduction 1 with 360 rules applied. Total rules applied 2161 place count 8120 transition count 7805
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2212 place count 8069 transition count 7805
Discarding 310 places :
Symmetric choice reduction at 2 with 310 rule applications. Total rules 2522 place count 7759 transition count 7295
Iterating global reduction 2 with 310 rules applied. Total rules applied 2832 place count 7759 transition count 7295
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 102 rules applied. Total rules applied 2934 place count 7657 transition count 7295
Discarding 459 places :
Symmetric choice reduction at 3 with 459 rule applications. Total rules 3393 place count 7198 transition count 6836
Iterating global reduction 3 with 459 rules applied. Total rules applied 3852 place count 7198 transition count 6836
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 153 rules applied. Total rules applied 4005 place count 7147 transition count 6734
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4260 place count 6892 transition count 6479
Iterating global reduction 4 with 255 rules applied. Total rules applied 4515 place count 6892 transition count 6479
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4770 place count 6637 transition count 6224
Iterating global reduction 4 with 255 rules applied. Total rules applied 5025 place count 6637 transition count 6224
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5280 place count 6382 transition count 5969
Iterating global reduction 4 with 255 rules applied. Total rules applied 5535 place count 6382 transition count 5969
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5790 place count 6127 transition count 5714
Iterating global reduction 4 with 255 rules applied. Total rules applied 6045 place count 6127 transition count 5714
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 6096 place count 6076 transition count 5663
Iterating global reduction 4 with 51 rules applied. Total rules applied 6147 place count 6076 transition count 5663
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 6198 place count 6025 transition count 5612
Iterating global reduction 4 with 51 rules applied. Total rules applied 6249 place count 6025 transition count 5612
Applied a total of 6249 rules in 14831 ms. Remains 6025 /9354 variables (removed 3329) and now considering 5612/9082 (removed 3470) transitions.
// Phase 1: matrix 5612 rows 6025 cols
[2024-05-25 16:48:56] [INFO ] Computed 821 invariants in 104 ms
[2024-05-25 16:48:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:48:57] [INFO ] Implicit Places using invariants in 1029 ms returned []
[2024-05-25 16:48:57] [INFO ] Invariant cache hit.
[2024-05-25 16:48:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:48:57] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1934 ms to find 0 implicit places.
[2024-05-25 16:48:57] [INFO ] Invariant cache hit.
[2024-05-25 16:48:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:48:58] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6025/9354 places, 5612/9082 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17665 ms. Remains : 6025/9354 places, 5612/9082 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s1881 1) (LT s2646 1)) (OR (LT s2029 1) (LT s2794 1)) (OR (LT s2034 1) (LT s2799 1)) (OR (LT s1886 1) (LT s2651 1)) (OR (LT s2024 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5579 ms.
Product exploration explored 100000 steps with 50000 reset in 5734 ms.
Computed a total of 6025 stabilizing places and 5612 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6025 transition count 5612
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-05 finished in 32129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 104 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8741 transition count 9082
Discarding 566 places :
Symmetric choice reduction at 1 with 566 rule applications. Total rules 1179 place count 8175 transition count 8316
Iterating global reduction 1 with 566 rules applied. Total rules applied 1745 place count 8175 transition count 8316
Discarding 309 places :
Symmetric choice reduction at 1 with 309 rule applications. Total rules 2054 place count 7866 transition count 7907
Iterating global reduction 1 with 309 rules applied. Total rules applied 2363 place count 7866 transition count 7907
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2414 place count 7815 transition count 7907
Discarding 309 places :
Symmetric choice reduction at 2 with 309 rule applications. Total rules 2723 place count 7506 transition count 7448
Iterating global reduction 2 with 309 rules applied. Total rules applied 3032 place count 7506 transition count 7448
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 3083 place count 7455 transition count 7448
Discarding 459 places :
Symmetric choice reduction at 3 with 459 rule applications. Total rules 3542 place count 6996 transition count 6989
Iterating global reduction 3 with 459 rules applied. Total rules applied 4001 place count 6996 transition count 6989
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 153 rules applied. Total rules applied 4154 place count 6945 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4409 place count 6690 transition count 6632
Iterating global reduction 4 with 255 rules applied. Total rules applied 4664 place count 6690 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4919 place count 6435 transition count 6377
Iterating global reduction 4 with 255 rules applied. Total rules applied 5174 place count 6435 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5429 place count 6180 transition count 6122
Iterating global reduction 4 with 255 rules applied. Total rules applied 5684 place count 6180 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5939 place count 5925 transition count 5867
Iterating global reduction 4 with 255 rules applied. Total rules applied 6194 place count 5925 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6449 place count 5670 transition count 5612
Iterating global reduction 4 with 255 rules applied. Total rules applied 6704 place count 5670 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6959 place count 5415 transition count 5357
Iterating global reduction 4 with 255 rules applied. Total rules applied 7214 place count 5415 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7469 place count 5160 transition count 5102
Iterating global reduction 4 with 255 rules applied. Total rules applied 7724 place count 5160 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7979 place count 4905 transition count 4847
Iterating global reduction 4 with 255 rules applied. Total rules applied 8234 place count 4905 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8489 place count 4650 transition count 4592
Iterating global reduction 4 with 255 rules applied. Total rules applied 8744 place count 4650 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8999 place count 4395 transition count 4337
Iterating global reduction 4 with 255 rules applied. Total rules applied 9254 place count 4395 transition count 4337
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 9458 place count 4395 transition count 4133
Discarding 51 places :
Symmetric choice reduction at 5 with 51 rule applications. Total rules 9509 place count 4344 transition count 4082
Iterating global reduction 5 with 51 rules applied. Total rules applied 9560 place count 4344 transition count 4082
Discarding 51 places :
Symmetric choice reduction at 5 with 51 rule applications. Total rules 9611 place count 4293 transition count 4031
Iterating global reduction 5 with 51 rules applied. Total rules applied 9662 place count 4293 transition count 4031
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 5 with 102 rules applied. Total rules applied 9764 place count 4242 transition count 3980
Applied a total of 9764 rules in 19488 ms. Remains 4242 /9354 variables (removed 5112) and now considering 3980/9082 (removed 5102) transitions.
// Phase 1: matrix 3980 rows 4242 cols
[2024-05-25 16:49:32] [INFO ] Computed 515 invariants in 60 ms
[2024-05-25 16:49:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:49:34] [INFO ] Implicit Places using invariants in 1884 ms returned [1838, 2840]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1888 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4240/9354 places, 3980/9082 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4239 transition count 3979
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4239 transition count 3979
Applied a total of 2 rules in 1069 ms. Remains 4239 /4240 variables (removed 1) and now considering 3979/3980 (removed 1) transitions.
// Phase 1: matrix 3979 rows 4239 cols
[2024-05-25 16:49:35] [INFO ] Computed 513 invariants in 69 ms
[2024-05-25 16:49:36] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:49:38] [INFO ] Implicit Places using invariants in 2290 ms returned [2833, 2840]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2294 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4237/9354 places, 3979/9082 transitions.
Applied a total of 0 rules in 552 ms. Remains 4237 /4237 variables (removed 0) and now considering 3979/3979 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 25295 ms. Remains : 4237/9354 places, 3979/9082 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (GEQ s4136 1) (GEQ s4138 1) (GEQ s4173 1) (GEQ s4171 1) (GEQ s4177 1) (GEQ s4175 1) (GEQ s4181 1) (GEQ s4179 1) (GEQ s4185 1) (GEQ s4183 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06 finished in 25417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)||p0))))'
Support contains 255 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8741 transition count 9082
Discarding 465 places :
Symmetric choice reduction at 1 with 465 rule applications. Total rules 1078 place count 8276 transition count 8367
Iterating global reduction 1 with 465 rules applied. Total rules applied 1543 place count 8276 transition count 8367
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 1903 place count 7916 transition count 7907
Iterating global reduction 1 with 360 rules applied. Total rules applied 2263 place count 7916 transition count 7907
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2314 place count 7865 transition count 7907
Discarding 208 places :
Symmetric choice reduction at 2 with 208 rule applications. Total rules 2522 place count 7657 transition count 7499
Iterating global reduction 2 with 208 rules applied. Total rules applied 2730 place count 7657 transition count 7499
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 102 rules applied. Total rules applied 2832 place count 7555 transition count 7499
Discarding 357 places :
Symmetric choice reduction at 3 with 357 rule applications. Total rules 3189 place count 7198 transition count 7142
Iterating global reduction 3 with 357 rules applied. Total rules applied 3546 place count 7198 transition count 7142
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 153 rules applied. Total rules applied 3699 place count 7147 transition count 7040
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 3954 place count 6892 transition count 6785
Iterating global reduction 4 with 255 rules applied. Total rules applied 4209 place count 6892 transition count 6785
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4464 place count 6637 transition count 6530
Iterating global reduction 4 with 255 rules applied. Total rules applied 4719 place count 6637 transition count 6530
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4974 place count 6382 transition count 6275
Iterating global reduction 4 with 255 rules applied. Total rules applied 5229 place count 6382 transition count 6275
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5484 place count 6127 transition count 6020
Iterating global reduction 4 with 255 rules applied. Total rules applied 5739 place count 6127 transition count 6020
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5994 place count 5872 transition count 5765
Iterating global reduction 4 with 255 rules applied. Total rules applied 6249 place count 5872 transition count 5765
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6504 place count 5617 transition count 5510
Iterating global reduction 4 with 255 rules applied. Total rules applied 6759 place count 5617 transition count 5510
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7014 place count 5362 transition count 5255
Iterating global reduction 4 with 255 rules applied. Total rules applied 7269 place count 5362 transition count 5255
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7524 place count 5107 transition count 5000
Iterating global reduction 4 with 255 rules applied. Total rules applied 7779 place count 5107 transition count 5000
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8034 place count 4852 transition count 4745
Iterating global reduction 4 with 255 rules applied. Total rules applied 8289 place count 4852 transition count 4745
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8544 place count 4597 transition count 4490
Iterating global reduction 4 with 255 rules applied. Total rules applied 8799 place count 4597 transition count 4490
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 9003 place count 4597 transition count 4286
Discarding 51 places :
Symmetric choice reduction at 5 with 51 rule applications. Total rules 9054 place count 4546 transition count 4235
Iterating global reduction 5 with 51 rules applied. Total rules applied 9105 place count 4546 transition count 4235
Discarding 51 places :
Symmetric choice reduction at 5 with 51 rule applications. Total rules 9156 place count 4495 transition count 4184
Iterating global reduction 5 with 51 rules applied. Total rules applied 9207 place count 4495 transition count 4184
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 5 with 102 rules applied. Total rules applied 9309 place count 4444 transition count 4133
Applied a total of 9309 rules in 19385 ms. Remains 4444 /9354 variables (removed 4910) and now considering 4133/9082 (removed 4949) transitions.
// Phase 1: matrix 4133 rows 4444 cols
[2024-05-25 16:49:58] [INFO ] Computed 464 invariants in 64 ms
[2024-05-25 16:49:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:50:00] [INFO ] Implicit Places using invariants in 2170 ms returned [1723]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2173 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4443/9354 places, 4133/9082 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4442 transition count 4132
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4442 transition count 4132
Applied a total of 2 rules in 1261 ms. Remains 4442 /4443 variables (removed 1) and now considering 4132/4133 (removed 1) transitions.
// Phase 1: matrix 4132 rows 4442 cols
[2024-05-25 16:50:01] [INFO ] Computed 463 invariants in 64 ms
[2024-05-25 16:50:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:50:03] [INFO ] Implicit Places using invariants in 2160 ms returned []
[2024-05-25 16:50:03] [INFO ] Invariant cache hit.
[2024-05-25 16:50:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:50:05] [INFO ] Implicit Places using invariants and state equation in 2260 ms returned []
Implicit Place search using SMT with State Equation took 4422 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4442/9354 places, 4132/9082 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27242 ms. Remains : 4442/9354 places, 4132/9082 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (AND (GEQ s2723 1) (GEQ s3897 1)) (AND (GEQ s2716 1) (GEQ s3941 1)) (AND (GEQ s2733 1) (GEQ s3907 1)) (AND (GEQ s2748 1) (GEQ s4024 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2359 ms.
Product exploration explored 100000 steps with 33333 reset in 2387 ms.
Computed a total of 4442 stabilizing places and 4132 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4442 transition count 4132
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 (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-07 finished in 33909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0||G(p1))))))))'
Support contains 3 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8741 transition count 9082
Discarding 565 places :
Symmetric choice reduction at 1 with 565 rule applications. Total rules 1178 place count 8176 transition count 8317
Iterating global reduction 1 with 565 rules applied. Total rules applied 1743 place count 8176 transition count 8317
Discarding 308 places :
Symmetric choice reduction at 1 with 308 rule applications. Total rules 2051 place count 7868 transition count 7909
Iterating global reduction 1 with 308 rules applied. Total rules applied 2359 place count 7868 transition count 7909
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2410 place count 7817 transition count 7909
Discarding 308 places :
Symmetric choice reduction at 2 with 308 rule applications. Total rules 2718 place count 7509 transition count 7501
Iterating global reduction 2 with 308 rules applied. Total rules applied 3026 place count 7509 transition count 7501
Discarding 408 places :
Symmetric choice reduction at 2 with 408 rule applications. Total rules 3434 place count 7101 transition count 7093
Iterating global reduction 2 with 408 rules applied. Total rules applied 3842 place count 7101 transition count 7093
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 153 rules applied. Total rules applied 3995 place count 7050 transition count 6991
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 4199 place count 6846 transition count 6787
Iterating global reduction 3 with 204 rules applied. Total rules applied 4403 place count 6846 transition count 6787
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 4607 place count 6642 transition count 6583
Iterating global reduction 3 with 204 rules applied. Total rules applied 4811 place count 6642 transition count 6583
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 5015 place count 6438 transition count 6379
Iterating global reduction 3 with 204 rules applied. Total rules applied 5219 place count 6438 transition count 6379
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 5423 place count 6234 transition count 6175
Iterating global reduction 3 with 204 rules applied. Total rules applied 5627 place count 6234 transition count 6175
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 5831 place count 6030 transition count 5971
Iterating global reduction 3 with 204 rules applied. Total rules applied 6035 place count 6030 transition count 5971
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 6239 place count 5826 transition count 5767
Iterating global reduction 3 with 204 rules applied. Total rules applied 6443 place count 5826 transition count 5767
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 6647 place count 5622 transition count 5563
Iterating global reduction 3 with 204 rules applied. Total rules applied 6851 place count 5622 transition count 5563
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 7055 place count 5418 transition count 5359
Iterating global reduction 3 with 204 rules applied. Total rules applied 7259 place count 5418 transition count 5359
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 7463 place count 5214 transition count 5155
Iterating global reduction 3 with 204 rules applied. Total rules applied 7667 place count 5214 transition count 5155
Discarding 204 places :
Symmetric choice reduction at 3 with 204 rule applications. Total rules 7871 place count 5010 transition count 4951
Iterating global reduction 3 with 204 rules applied. Total rules applied 8075 place count 5010 transition count 4951
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 8279 place count 5010 transition count 4747
Applied a total of 8279 rules in 19639 ms. Remains 5010 /9354 variables (removed 4344) and now considering 4747/9082 (removed 4335) transitions.
// Phase 1: matrix 4747 rows 5010 cols
[2024-05-25 16:50:32] [INFO ] Computed 617 invariants in 81 ms
[2024-05-25 16:50:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:50:35] [INFO ] Implicit Places using invariants in 2891 ms returned [360]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2895 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 5009/9354 places, 4747/9082 transitions.
Applied a total of 0 rules in 785 ms. Remains 5009 /5009 variables (removed 0) and now considering 4747/4747 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23321 ms. Remains : 5009/9354 places, 4747/9082 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(OR (LT s2298 1) (LT s2408 1)), p0:(LT s3222 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34 reset in 899 ms.
Product exploration explored 100000 steps with 34 reset in 917 ms.
Computed a total of 5009 stabilizing places and 4747 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5009 transition count 4747
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), true, (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4747 rows 5009 cols
[2024-05-25 16:50:40] [INFO ] Computed 616 invariants in 80 ms
[2024-05-25 16:50:41] [INFO ] [Real]Absence check using 0 positive and 616 generalized place invariants in 341 ms returned sat
[2024-05-25 16:50:47] [INFO ] After 5801ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-25 16:50:48] [INFO ] After 6696ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 525 ms.
[2024-05-25 16:50:49] [INFO ] After 8622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Finished Parikh walk after 2469 steps, including 0 resets, run visited all 2 properties in 63 ms. (steps per millisecond=39 )
Parikh walk visited 2 properties in 65 ms.
Knowledge obtained : [(AND p1 p0), true, (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 5009 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5009/5009 places, 4747/4747 transitions.
Applied a total of 0 rules in 704 ms. Remains 5009 /5009 variables (removed 0) and now considering 4747/4747 (removed 0) transitions.
[2024-05-25 16:50:50] [INFO ] Invariant cache hit.
[2024-05-25 16:50:51] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:50:53] [INFO ] Implicit Places using invariants in 2317 ms returned [2456, 2469, 2482, 2495]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2322 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 5005/5009 places, 4747/4747 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 4998 transition count 4740
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 4998 transition count 4740
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 4995 transition count 4734
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 4995 transition count 4734
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 4992 transition count 4728
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 4992 transition count 4728
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 4989 transition count 4725
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 4989 transition count 4725
Applied a total of 32 rules in 3559 ms. Remains 4989 /5005 variables (removed 16) and now considering 4725/4747 (removed 22) transitions.
// Phase 1: matrix 4725 rows 4989 cols
[2024-05-25 16:50:56] [INFO ] Computed 612 invariants in 79 ms
[2024-05-25 16:50:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:50:58] [INFO ] Implicit Places using invariants in 2178 ms returned [371, 2969]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2182 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4987/5009 places, 4725/4747 transitions.
Applied a total of 0 rules in 718 ms. Remains 4987 /4987 variables (removed 0) and now considering 4725/4725 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 9489 ms. Remains : 4987/5009 places, 4725/4747 transitions.
Computed a total of 4987 stabilizing places and 4725 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4987 transition count 4725
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), true, (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 122971 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122971 steps, saw 120623 distinct states, run finished after 3004 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 4725 rows 4987 cols
[2024-05-25 16:51:05] [INFO ] Computed 610 invariants in 81 ms
[2024-05-25 16:51:06] [INFO ] [Real]Absence check using 0 positive and 610 generalized place invariants in 334 ms returned sat
[2024-05-25 16:51:12] [INFO ] After 5887ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-25 16:51:13] [INFO ] After 6783ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:2
Attempting to minimize the solution found.
Minimization took 553 ms.
[2024-05-25 16:51:14] [INFO ] After 8878ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:2
[2024-05-25 16:51:15] [INFO ] [Nat]Absence check using 0 positive and 610 generalized place invariants in 334 ms returned sat
[2024-05-25 16:51:22] [INFO ] After 6093ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 16:51:24] [INFO ] After 8034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1033 ms.
[2024-05-25 16:51:25] [INFO ] After 10752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 2429 steps, including 0 resets, run visited all 4 properties in 60 ms. (steps per millisecond=40 )
Parikh walk visited 4 properties in 64 ms.
Knowledge obtained : [(AND p1 p0), true, (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 34 reset in 831 ms.
Product exploration explored 100000 steps with 34 reset in 904 ms.
Applying partial POR strategy [true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 4987 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4987/4987 places, 4725/4725 transitions.
Graph (complete) has 6691 edges and 4987 vertex of which 4795 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.4 ms
Discarding 192 places :
Also discarding 193 output transitions
Drop transitions removed 193 transitions
Performed 1678 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1678 rules applied. Total rules applied 1679 place count 4795 transition count 4532
Performed 1080 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1080 Pre rules applied. Total rules applied 1679 place count 4795 transition count 4738
Deduced a syphon composed of 2758 places in 3 ms
Iterating global reduction 1 with 1080 rules applied. Total rules applied 2759 place count 4795 transition count 4738
Discarding 1282 places :
Symmetric choice reduction at 1 with 1282 rule applications. Total rules 4041 place count 3513 transition count 3410
Deduced a syphon composed of 1522 places in 2 ms
Iterating global reduction 1 with 1282 rules applied. Total rules applied 5323 place count 3513 transition count 3410
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 5369 place count 3467 transition count 3364
Deduced a syphon composed of 1476 places in 2 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 5415 place count 3467 transition count 3364
Performed 610 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 2086 places in 1 ms
Iterating global reduction 1 with 610 rules applied. Total rules applied 6025 place count 3467 transition count 3413
Discarding 610 places :
Symmetric choice reduction at 1 with 610 rule applications. Total rules 6635 place count 2857 transition count 2803
Deduced a syphon composed of 1476 places in 0 ms
Iterating global reduction 1 with 610 rules applied. Total rules applied 7245 place count 2857 transition count 2803
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -304
Deduced a syphon composed of 1527 places in 1 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 7296 place count 2857 transition count 3107
Performed 52(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1579 places in 1 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 7348 place count 2857 transition count 3260
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 7399 place count 2806 transition count 3158
Deduced a syphon composed of 1528 places in 1 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 7450 place count 2806 transition count 3158
Deduced a syphon composed of 1528 places in 1 ms
Applied a total of 7450 rules in 2742 ms. Remains 2806 /4987 variables (removed 2181) and now considering 3158/4725 (removed 1567) transitions.
[2024-05-25 16:51:31] [INFO ] Redundant transitions in 1005 ms returned []
// Phase 1: matrix 3158 rows 2806 cols
[2024-05-25 16:51:32] [INFO ] Computed 563 invariants in 59 ms
[2024-05-25 16:51:35] [INFO ] Dead Transitions using invariants and state equation in 3826 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2806/4987 places, 3158/4725 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7580 ms. Remains : 2806/4987 places, 3158/4725 transitions.
Built C files in :
/tmp/ltsmin7654649684475399111
[2024-05-25 16:51:35] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7654649684475399111
Running compilation step : cd /tmp/ltsmin7654649684475399111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin7654649684475399111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7654649684475399111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 4987 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4987/4987 places, 4725/4725 transitions.
Applied a total of 0 rules in 631 ms. Remains 4987 /4987 variables (removed 0) and now considering 4725/4725 (removed 0) transitions.
// Phase 1: matrix 4725 rows 4987 cols
[2024-05-25 16:51:39] [INFO ] Computed 610 invariants in 83 ms
[2024-05-25 16:51:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:51:42] [INFO ] Implicit Places using invariants in 2845 ms returned [362, 2985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2850 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4985/4987 places, 4725/4725 transitions.
Applied a total of 0 rules in 817 ms. Remains 4985 /4985 variables (removed 0) and now considering 4725/4725 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4299 ms. Remains : 4985/4987 places, 4725/4725 transitions.
Built C files in :
/tmp/ltsmin2699055206359254938
[2024-05-25 16:51:43] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2699055206359254938
Running compilation step : cd /tmp/ltsmin2699055206359254938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2699055206359254938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2699055206359254938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 16:51:46] [INFO ] Flatten gal took : 137 ms
[2024-05-25 16:51:46] [INFO ] Flatten gal took : 147 ms
[2024-05-25 16:51:46] [INFO ] Time to serialize gal into /tmp/LTL14455199832680948513.gal : 37 ms
[2024-05-25 16:51:46] [INFO ] Time to serialize properties into /tmp/LTL4471912338323259893.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14455199832680948513.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16510494039623689956.hoa' '-atoms' '/tmp/LTL4471912338323259893.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4471912338323259893.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16510494039623689956.hoa
Detected timeout of ITS tools.
[2024-05-25 16:52:02] [INFO ] Flatten gal took : 133 ms
[2024-05-25 16:52:02] [INFO ] Flatten gal took : 127 ms
[2024-05-25 16:52:02] [INFO ] Time to serialize gal into /tmp/LTL4851558968865989712.gal : 26 ms
[2024-05-25 16:52:02] [INFO ] Time to serialize properties into /tmp/LTL11649347367604963619.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4851558968865989712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11649347367604963619.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G(("(m10_1_3<1)")||(G("((g2_1<1)||(lg0_7<1))")))))))))
Formula 0 simplified : XXXXF(!"(m10_1_3<1)" & F!"((g2_1<1)||(lg0_7<1))")
Detected timeout of ITS tools.
[2024-05-25 16:52:17] [INFO ] Flatten gal took : 169 ms
[2024-05-25 16:52:17] [INFO ] Applying decomposition
[2024-05-25 16:52:17] [INFO ] Flatten gal took : 170 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3786584941847374024.txt' '-o' '/tmp/graph3786584941847374024.bin' '-w' '/tmp/graph3786584941847374024.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3786584941847374024.bin' '-l' '-1' '-v' '-w' '/tmp/graph3786584941847374024.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:52:18] [INFO ] Decomposing Gal with order
[2024-05-25 16:52:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:52:20] [INFO ] Removed a total of 1084 redundant transitions.
[2024-05-25 16:52:20] [INFO ] Flatten gal took : 413 ms
[2024-05-25 16:52:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 43 ms.
[2024-05-25 16:52:20] [INFO ] Time to serialize gal into /tmp/LTL8733498653877574873.gal : 49 ms
[2024-05-25 16:52:20] [INFO ] Time to serialize properties into /tmp/LTL6810824769000672547.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8733498653877574873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6810824769000672547.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G(("(i23.u1309.m10_1_3<1)")||(G("((i50.u705.g2_1<1)||(i50.u1098.lg0_7<1))")))))))))
Formula 0 simplified : XXXXF(!"(i23.u1309.m10_1_3<1)" & F!"((i50.u705.g2_1<1)||(i50.u1098.lg0_7<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6879800989557787111
[2024-05-25 16:52:35] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6879800989557787111
Running compilation step : cd /tmp/ltsmin6879800989557787111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin6879800989557787111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6879800989557787111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08 finished in 145903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G((F(p1)&&p0))))||G(F(!(!p1 U p2)))))'
Support contains 5 out of 9354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Graph (complete) has 13521 edges and 9354 vertex of which 5209 are kept as prefixes of interest. Removing 4145 places using SCC suffix rule.8 ms
Discarding 4145 places :
Also discarding 4033 output transitions
Drop transitions removed 4033 transitions
Reduce places removed 50 places and 50 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Drop transitions removed 3661 transitions
Trivial Post-agglo rules discarded 3661 transitions
Performed 3661 trivial Post agglomeration. Transition count delta: 3661
Iterating post reduction 0 with 4274 rules applied. Total rules applied 4275 place count 4546 transition count 1338
Reduce places removed 3661 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 3668 rules applied. Total rules applied 7943 place count 885 transition count 1331
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 7950 place count 878 transition count 1331
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 7950 place count 878 transition count 1279
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 8054 place count 826 transition count 1279
Discarding 308 places :
Symmetric choice reduction at 3 with 308 rule applications. Total rules 8362 place count 518 transition count 722
Iterating global reduction 3 with 308 rules applied. Total rules applied 8670 place count 518 transition count 722
Discarding 251 places :
Symmetric choice reduction at 3 with 251 rule applications. Total rules 8921 place count 267 transition count 471
Iterating global reduction 3 with 251 rules applied. Total rules applied 9172 place count 267 transition count 471
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Iterating post reduction 3 with 202 rules applied. Total rules applied 9374 place count 267 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 9374 place count 267 transition count 268
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 9376 place count 266 transition count 268
Discarding 49 places :
Symmetric choice reduction at 4 with 49 rule applications. Total rules 9425 place count 217 transition count 219
Iterating global reduction 4 with 49 rules applied. Total rules applied 9474 place count 217 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 9476 place count 216 transition count 218
Applied a total of 9476 rules in 103 ms. Remains 216 /9354 variables (removed 9138) and now considering 218/9082 (removed 8864) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-25 16:52:38] [INFO ] Computed 52 invariants in 2 ms
[2024-05-25 16:52:39] [INFO ] Implicit Places using invariants in 336 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 101]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 338 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/9354 places, 218/9082 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 166 transition count 117
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 65 transition count 117
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 249 place count 18 transition count 23
Iterating global reduction 2 with 47 rules applied. Total rules applied 296 place count 18 transition count 23
Applied a total of 296 rules in 4 ms. Remains 18 /166 variables (removed 148) and now considering 23/218 (removed 195) transitions.
// Phase 1: matrix 23 rows 18 cols
[2024-05-25 16:52:39] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 16:52:39] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-25 16:52:39] [INFO ] Invariant cache hit.
[2024-05-25 16:52:39] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/9354 places, 23/9082 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 532 ms. Remains : 18/9354 places, 23/9082 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND p2 (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s15 1) (GEQ s17 1)), p0:(AND (GEQ s4 1) (GEQ s7 1)), p1:(LT s10 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1541 reset in 156 ms.
Product exploration explored 100000 steps with 1516 reset in 194 ms.
Computed a total of 18 stabilizing places and 23 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 23
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 35 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-09 finished in 1171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 2 out of 9354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Graph (complete) has 13521 edges and 9354 vertex of which 7260 are kept as prefixes of interest. Removing 2094 places using SCC suffix rule.14 ms
Discarding 2094 places :
Also discarding 2037 output transitions
Drop transitions removed 2037 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Drop transitions removed 4642 transitions
Trivial Post-agglo rules discarded 4642 transitions
Performed 4642 trivial Post agglomeration. Transition count delta: 4642
Iterating post reduction 0 with 5255 rules applied. Total rules applied 5256 place count 6596 transition count 2352
Reduce places removed 4642 places and 0 transitions.
Iterating post reduction 1 with 4642 rules applied. Total rules applied 9898 place count 1954 transition count 2352
Performed 457 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 457 Pre rules applied. Total rules applied 9898 place count 1954 transition count 1895
Deduced a syphon composed of 457 places in 1 ms
Ensure Unique test removed 153 places
Reduce places removed 610 places and 0 transitions.
Iterating global reduction 2 with 1067 rules applied. Total rules applied 10965 place count 1344 transition count 1895
Drop transitions removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 2 with 152 rules applied. Total rules applied 11117 place count 1344 transition count 1743
Reduce places removed 152 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 153 rules applied. Total rules applied 11270 place count 1192 transition count 1742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 11271 place count 1191 transition count 1742
Discarding 412 places :
Symmetric choice reduction at 5 with 412 rule applications. Total rules 11683 place count 779 transition count 1032
Iterating global reduction 5 with 412 rules applied. Total rules applied 12095 place count 779 transition count 1032
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 12097 place count 779 transition count 1030
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 12099 place count 777 transition count 1030
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 12099 place count 777 transition count 1029
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 12101 place count 776 transition count 1029
Discarding 207 places :
Symmetric choice reduction at 7 with 207 rule applications. Total rules 12308 place count 569 transition count 770
Iterating global reduction 7 with 207 rules applied. Total rules applied 12515 place count 569 transition count 770
Ensure Unique test removed 305 transitions
Reduce isomorphic transitions removed 305 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 7 with 508 rules applied. Total rules applied 13023 place count 467 transition count 364
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 8 with 101 rules applied. Total rules applied 13124 place count 366 transition count 364
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 53 Pre rules applied. Total rules applied 13124 place count 366 transition count 311
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 9 with 106 rules applied. Total rules applied 13230 place count 313 transition count 311
Discarding 99 places :
Symmetric choice reduction at 9 with 99 rule applications. Total rules 13329 place count 214 transition count 212
Iterating global reduction 9 with 99 rules applied. Total rules applied 13428 place count 214 transition count 212
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 9 with 51 rules applied. Total rules applied 13479 place count 214 transition count 161
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 51 Pre rules applied. Total rules applied 13479 place count 214 transition count 110
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 10 with 153 rules applied. Total rules applied 13632 place count 112 transition count 110
Discarding 48 places :
Symmetric choice reduction at 10 with 48 rule applications. Total rules 13680 place count 64 transition count 62
Iterating global reduction 10 with 48 rules applied. Total rules applied 13728 place count 64 transition count 62
Discarding 48 places :
Symmetric choice reduction at 10 with 48 rule applications. Total rules 13776 place count 16 transition count 14
Iterating global reduction 10 with 48 rules applied. Total rules applied 13824 place count 16 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 13825 place count 16 transition count 14
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 13828 place count 13 transition count 11
Applied a total of 13828 rules in 407 ms. Remains 13 /9354 variables (removed 9341) and now considering 11/9082 (removed 9071) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-25 16:52:40] [INFO ] Computed 3 invariants in 0 ms
[2024-05-25 16:52:40] [INFO ] Implicit Places using invariants in 44 ms returned [3, 4, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/9354 places, 11/9082 transitions.
Graph (complete) has 8 edges and 10 vertex of which 7 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 6 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 5 transition count 6
Applied a total of 3 rules in 3 ms. Remains 5 /10 variables (removed 5) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 5 cols
[2024-05-25 16:52:40] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 16:52:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 16:52:40] [INFO ] Invariant cache hit.
[2024-05-25 16:52:40] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/9354 places, 6/9082 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 529 ms. Remains : 5/9354 places, 6/9082 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10 finished in 660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U (G((p0||F(p1)))||((p0||F(p1))&&(!p2||X(G(!p2)))))))'
Support contains 6 out of 9354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Graph (complete) has 13521 edges and 9354 vertex of which 8840 are kept as prefixes of interest. Removing 514 places using SCC suffix rule.8 ms
Discarding 514 places :
Also discarding 512 output transitions
Drop transitions removed 512 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Drop transitions removed 4991 transitions
Trivial Post-agglo rules discarded 4991 transitions
Performed 4991 trivial Post agglomeration. Transition count delta: 4991
Iterating post reduction 0 with 5603 rules applied. Total rules applied 5604 place count 8177 transition count 3528
Reduce places removed 4991 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4992 rules applied. Total rules applied 10596 place count 3186 transition count 3527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10597 place count 3185 transition count 3527
Performed 664 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 664 Pre rules applied. Total rules applied 10597 place count 3185 transition count 2863
Deduced a syphon composed of 664 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 970 places and 0 transitions.
Iterating global reduction 3 with 1634 rules applied. Total rules applied 12231 place count 2215 transition count 2863
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 3 with 204 rules applied. Total rules applied 12435 place count 2215 transition count 2659
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 12639 place count 2011 transition count 2659
Discarding 613 places :
Symmetric choice reduction at 5 with 613 rule applications. Total rules 13252 place count 1398 transition count 1847
Iterating global reduction 5 with 613 rules applied. Total rules applied 13865 place count 1398 transition count 1847
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 5 with 102 rules applied. Total rules applied 13967 place count 1398 transition count 1745
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 6 with 102 rules applied. Total rules applied 14069 place count 1296 transition count 1745
Discarding 156 places :
Symmetric choice reduction at 7 with 156 rule applications. Total rules 14225 place count 1140 transition count 1489
Iterating global reduction 7 with 156 rules applied. Total rules applied 14381 place count 1140 transition count 1489
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 7 with 458 rules applied. Total rules applied 14839 place count 1038 transition count 1133
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 8 with 102 rules applied. Total rules applied 14941 place count 936 transition count 1133
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 52 Pre rules applied. Total rules applied 14941 place count 936 transition count 1081
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 9 with 104 rules applied. Total rules applied 15045 place count 884 transition count 1081
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 15047 place count 882 transition count 979
Iterating global reduction 9 with 2 rules applied. Total rules applied 15049 place count 882 transition count 979
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 9 with 305 rules applied. Total rules applied 15354 place count 780 transition count 776
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 10 with 101 rules applied. Total rules applied 15455 place count 679 transition count 776
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 51 Pre rules applied. Total rules applied 15455 place count 679 transition count 725
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 11 with 102 rules applied. Total rules applied 15557 place count 628 transition count 725
Discarding 49 places :
Symmetric choice reduction at 11 with 49 rule applications. Total rules 15606 place count 579 transition count 676
Iterating global reduction 11 with 49 rules applied. Total rules applied 15655 place count 579 transition count 676
Discarding 49 places :
Symmetric choice reduction at 11 with 49 rule applications. Total rules 15704 place count 530 transition count 627
Iterating global reduction 11 with 49 rules applied. Total rules applied 15753 place count 530 transition count 627
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 11 with 102 rules applied. Total rules applied 15855 place count 479 transition count 576
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 15856 place count 478 transition count 525
Iterating global reduction 11 with 1 rules applied. Total rules applied 15857 place count 478 transition count 525
Discarding 51 places :
Symmetric choice reduction at 11 with 51 rule applications. Total rules 15908 place count 427 transition count 474
Iterating global reduction 11 with 51 rules applied. Total rules applied 15959 place count 427 transition count 474
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 11 with 51 rules applied. Total rules applied 16010 place count 427 transition count 423
Applied a total of 16010 rules in 514 ms. Remains 427 /9354 variables (removed 8927) and now considering 423/9082 (removed 8659) transitions.
// Phase 1: matrix 423 rows 427 cols
[2024-05-25 16:52:40] [INFO ] Computed 107 invariants in 5 ms
[2024-05-25 16:52:41] [INFO ] Implicit Places using invariants in 523 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 208, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 424]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 533 ms to find 104 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 323/9354 places, 423/9082 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 323 transition count 317
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 212 place count 217 transition count 317
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 212 place count 217 transition count 315
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 216 place count 215 transition count 315
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 265 place count 166 transition count 266
Iterating global reduction 2 with 49 rules applied. Total rules applied 314 place count 166 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 314 place count 166 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 316 place count 165 transition count 265
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 364 place count 117 transition count 169
Iterating global reduction 2 with 48 rules applied. Total rules applied 412 place count 117 transition count 169
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 460 place count 69 transition count 121
Iterating global reduction 2 with 48 rules applied. Total rules applied 508 place count 69 transition count 121
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 555 place count 22 transition count 27
Iterating global reduction 2 with 47 rules applied. Total rules applied 602 place count 22 transition count 27
Applied a total of 602 rules in 19 ms. Remains 22 /323 variables (removed 301) and now considering 27/423 (removed 396) transitions.
// Phase 1: matrix 27 rows 22 cols
[2024-05-25 16:52:41] [INFO ] Computed 3 invariants in 0 ms
[2024-05-25 16:52:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-25 16:52:41] [INFO ] Invariant cache hit.
[2024-05-25 16:52:41] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/9354 places, 27/9082 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1155 ms. Remains : 22/9354 places, 27/9082 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p2)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s18 1)), p1:(AND (GEQ s6 1) (GEQ s7 1)), p2:(AND (GEQ s8 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-11 finished in 1398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 5 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Discarding 611 places :
Implicit places reduction removed 611 places
Iterating post reduction 0 with 611 rules applied. Total rules applied 611 place count 8743 transition count 9082
Discarding 567 places :
Symmetric choice reduction at 1 with 567 rule applications. Total rules 1178 place count 8176 transition count 8265
Iterating global reduction 1 with 567 rules applied. Total rules applied 1745 place count 8176 transition count 8265
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 2105 place count 7816 transition count 7805
Iterating global reduction 1 with 360 rules applied. Total rules applied 2465 place count 7816 transition count 7805
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2516 place count 7765 transition count 7805
Discarding 310 places :
Symmetric choice reduction at 2 with 310 rule applications. Total rules 2826 place count 7455 transition count 7295
Iterating global reduction 2 with 310 rules applied. Total rules applied 3136 place count 7455 transition count 7295
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 102 rules applied. Total rules applied 3238 place count 7353 transition count 7295
Discarding 459 places :
Symmetric choice reduction at 3 with 459 rule applications. Total rules 3697 place count 6894 transition count 6836
Iterating global reduction 3 with 459 rules applied. Total rules applied 4156 place count 6894 transition count 6836
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 153 rules applied. Total rules applied 4309 place count 6843 transition count 6734
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 4563 place count 6589 transition count 6480
Iterating global reduction 4 with 254 rules applied. Total rules applied 4817 place count 6589 transition count 6480
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 5071 place count 6335 transition count 6226
Iterating global reduction 4 with 254 rules applied. Total rules applied 5325 place count 6335 transition count 6226
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 5579 place count 6081 transition count 5972
Iterating global reduction 4 with 254 rules applied. Total rules applied 5833 place count 6081 transition count 5972
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 6087 place count 5827 transition count 5718
Iterating global reduction 4 with 254 rules applied. Total rules applied 6341 place count 5827 transition count 5718
Discarding 253 places :
Symmetric choice reduction at 4 with 253 rule applications. Total rules 6594 place count 5574 transition count 5465
Iterating global reduction 4 with 253 rules applied. Total rules applied 6847 place count 5574 transition count 5465
Discarding 253 places :
Symmetric choice reduction at 4 with 253 rule applications. Total rules 7100 place count 5321 transition count 5212
Iterating global reduction 4 with 253 rules applied. Total rules applied 7353 place count 5321 transition count 5212
Discarding 253 places :
Symmetric choice reduction at 4 with 253 rule applications. Total rules 7606 place count 5068 transition count 4959
Iterating global reduction 4 with 253 rules applied. Total rules applied 7859 place count 5068 transition count 4959
Discarding 253 places :
Symmetric choice reduction at 4 with 253 rule applications. Total rules 8112 place count 4815 transition count 4706
Iterating global reduction 4 with 253 rules applied. Total rules applied 8365 place count 4815 transition count 4706
Discarding 253 places :
Symmetric choice reduction at 4 with 253 rule applications. Total rules 8618 place count 4562 transition count 4453
Iterating global reduction 4 with 253 rules applied. Total rules applied 8871 place count 4562 transition count 4453
Discarding 253 places :
Symmetric choice reduction at 4 with 253 rule applications. Total rules 9124 place count 4309 transition count 4200
Iterating global reduction 4 with 253 rules applied. Total rules applied 9377 place count 4309 transition count 4200
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Iterating post reduction 4 with 203 rules applied. Total rules applied 9580 place count 4309 transition count 3997
Discarding 50 places :
Symmetric choice reduction at 5 with 50 rule applications. Total rules 9630 place count 4259 transition count 3947
Iterating global reduction 5 with 50 rules applied. Total rules applied 9680 place count 4259 transition count 3947
Discarding 50 places :
Symmetric choice reduction at 5 with 50 rule applications. Total rules 9730 place count 4209 transition count 3897
Iterating global reduction 5 with 50 rules applied. Total rules applied 9780 place count 4209 transition count 3897
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Discarding 49 places :
Implicit places reduction removed 49 places
Iterating post reduction 5 with 99 rules applied. Total rules applied 9879 place count 4160 transition count 3847
Applied a total of 9879 rules in 18683 ms. Remains 4160 /9354 variables (removed 5194) and now considering 3847/9082 (removed 5235) transitions.
// Phase 1: matrix 3847 rows 4160 cols
[2024-05-25 16:53:00] [INFO ] Computed 468 invariants in 55 ms
[2024-05-25 16:53:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:53:01] [INFO ] Implicit Places using invariants in 812 ms returned []
[2024-05-25 16:53:01] [INFO ] Invariant cache hit.
[2024-05-25 16:53:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:53:03] [INFO ] Implicit Places using invariants and state equation in 2128 ms returned [2763, 2776]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2946 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4158/9354 places, 3847/9082 transitions.
Applied a total of 0 rules in 501 ms. Remains 4158 /4158 variables (removed 0) and now considering 3847/3847 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22131 ms. Remains : 4158/9354 places, 3847/9082 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s776 1) (LT s1034 1) (LT s1499 1) (LT s1656 1)), p0:(GEQ s3755 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3004 ms.
Product exploration explored 100000 steps with 50000 reset in 3051 ms.
Computed a total of 4158 stabilizing places and 3847 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4158 transition count 3847
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-12 finished in 30137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 9354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Graph (complete) has 13521 edges and 9354 vertex of which 7260 are kept as prefixes of interest. Removing 2094 places using SCC suffix rule.9 ms
Discarding 2094 places :
Also discarding 2037 output transitions
Drop transitions removed 2037 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Drop transitions removed 4643 transitions
Trivial Post-agglo rules discarded 4643 transitions
Performed 4643 trivial Post agglomeration. Transition count delta: 4643
Iterating post reduction 0 with 5256 rules applied. Total rules applied 5257 place count 6596 transition count 2351
Reduce places removed 4643 places and 0 transitions.
Iterating post reduction 1 with 4643 rules applied. Total rules applied 9900 place count 1953 transition count 2351
Performed 457 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 457 Pre rules applied. Total rules applied 9900 place count 1953 transition count 1894
Deduced a syphon composed of 457 places in 1 ms
Ensure Unique test removed 153 places
Reduce places removed 610 places and 0 transitions.
Iterating global reduction 2 with 1067 rules applied. Total rules applied 10967 place count 1343 transition count 1894
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 2 with 153 rules applied. Total rules applied 11120 place count 1343 transition count 1741
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 3 with 153 rules applied. Total rules applied 11273 place count 1190 transition count 1741
Discarding 412 places :
Symmetric choice reduction at 4 with 412 rule applications. Total rules 11685 place count 778 transition count 1031
Iterating global reduction 4 with 412 rules applied. Total rules applied 12097 place count 778 transition count 1031
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 12099 place count 778 transition count 1029
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 12101 place count 776 transition count 1029
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 12101 place count 776 transition count 1028
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 12103 place count 775 transition count 1028
Discarding 207 places :
Symmetric choice reduction at 6 with 207 rule applications. Total rules 12310 place count 568 transition count 769
Iterating global reduction 6 with 207 rules applied. Total rules applied 12517 place count 568 transition count 769
Ensure Unique test removed 306 transitions
Reduce isomorphic transitions removed 306 transitions.
Discarding 103 places :
Implicit places reduction removed 103 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 6 with 511 rules applied. Total rules applied 13028 place count 465 transition count 361
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 7 with 102 rules applied. Total rules applied 13130 place count 363 transition count 361
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 53 Pre rules applied. Total rules applied 13130 place count 363 transition count 308
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 8 with 106 rules applied. Total rules applied 13236 place count 310 transition count 308
Discarding 100 places :
Symmetric choice reduction at 8 with 100 rule applications. Total rules 13336 place count 210 transition count 208
Iterating global reduction 8 with 100 rules applied. Total rules applied 13436 place count 210 transition count 208
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 8 with 51 rules applied. Total rules applied 13487 place count 210 transition count 157
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 51 Pre rules applied. Total rules applied 13487 place count 210 transition count 106
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 9 with 153 rules applied. Total rules applied 13640 place count 108 transition count 106
Discarding 49 places :
Symmetric choice reduction at 9 with 49 rule applications. Total rules 13689 place count 59 transition count 57
Iterating global reduction 9 with 49 rules applied. Total rules applied 13738 place count 59 transition count 57
Discarding 49 places :
Symmetric choice reduction at 9 with 49 rule applications. Total rules 13787 place count 10 transition count 8
Iterating global reduction 9 with 49 rules applied. Total rules applied 13836 place count 10 transition count 8
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 13838 place count 8 transition count 6
Applied a total of 13838 rules in 241 ms. Remains 8 /9354 variables (removed 9346) and now considering 6/9082 (removed 9076) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-25 16:53:12] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 16:53:12] [INFO ] Implicit Places using invariants in 28 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9354 places, 6/9082 transitions.
Graph (complete) has 4 edges and 6 vertex of which 4 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 2 ms. Remains 2 /6 variables (removed 4) and now considering 2/6 (removed 4) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-25 16:53:12] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:53:12] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 16:53:12] [INFO ] Invariant cache hit.
[2024-05-25 16:53:12] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/9354 places, 2/9082 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 309 ms. Remains : 2/9354 places, 2/9082 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 47 ms.
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13 finished in 523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8741 transition count 9082
Discarding 567 places :
Symmetric choice reduction at 1 with 567 rule applications. Total rules 1180 place count 8174 transition count 8265
Iterating global reduction 1 with 567 rules applied. Total rules applied 1747 place count 8174 transition count 8265
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 2107 place count 7814 transition count 7805
Iterating global reduction 1 with 360 rules applied. Total rules applied 2467 place count 7814 transition count 7805
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2518 place count 7763 transition count 7805
Discarding 310 places :
Symmetric choice reduction at 2 with 310 rule applications. Total rules 2828 place count 7453 transition count 7295
Iterating global reduction 2 with 310 rules applied. Total rules applied 3138 place count 7453 transition count 7295
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 102 rules applied. Total rules applied 3240 place count 7351 transition count 7295
Discarding 459 places :
Symmetric choice reduction at 3 with 459 rule applications. Total rules 3699 place count 6892 transition count 6836
Iterating global reduction 3 with 459 rules applied. Total rules applied 4158 place count 6892 transition count 6836
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 153 rules applied. Total rules applied 4311 place count 6841 transition count 6734
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4566 place count 6586 transition count 6479
Iterating global reduction 4 with 255 rules applied. Total rules applied 4821 place count 6586 transition count 6479
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5076 place count 6331 transition count 6224
Iterating global reduction 4 with 255 rules applied. Total rules applied 5331 place count 6331 transition count 6224
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5586 place count 6076 transition count 5969
Iterating global reduction 4 with 255 rules applied. Total rules applied 5841 place count 6076 transition count 5969
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6096 place count 5821 transition count 5714
Iterating global reduction 4 with 255 rules applied. Total rules applied 6351 place count 5821 transition count 5714
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6606 place count 5566 transition count 5459
Iterating global reduction 4 with 255 rules applied. Total rules applied 6861 place count 5566 transition count 5459
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7116 place count 5311 transition count 5204
Iterating global reduction 4 with 255 rules applied. Total rules applied 7371 place count 5311 transition count 5204
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7626 place count 5056 transition count 4949
Iterating global reduction 4 with 255 rules applied. Total rules applied 7881 place count 5056 transition count 4949
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8136 place count 4801 transition count 4694
Iterating global reduction 4 with 255 rules applied. Total rules applied 8391 place count 4801 transition count 4694
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8646 place count 4546 transition count 4439
Iterating global reduction 4 with 255 rules applied. Total rules applied 8901 place count 4546 transition count 4439
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 9156 place count 4291 transition count 4184
Iterating global reduction 4 with 255 rules applied. Total rules applied 9411 place count 4291 transition count 4184
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 9615 place count 4291 transition count 3980
Discarding 51 places :
Symmetric choice reduction at 5 with 51 rule applications. Total rules 9666 place count 4240 transition count 3929
Iterating global reduction 5 with 51 rules applied. Total rules applied 9717 place count 4240 transition count 3929
Discarding 51 places :
Symmetric choice reduction at 5 with 51 rule applications. Total rules 9768 place count 4189 transition count 3878
Iterating global reduction 5 with 51 rules applied. Total rules applied 9819 place count 4189 transition count 3878
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 5 with 102 rules applied. Total rules applied 9921 place count 4138 transition count 3827
Applied a total of 9921 rules in 17644 ms. Remains 4138 /9354 variables (removed 5216) and now considering 3827/9082 (removed 5255) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2024-05-25 16:53:30] [INFO ] Computed 464 invariants in 52 ms
[2024-05-25 16:53:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:53:31] [INFO ] Implicit Places using invariants in 1751 ms returned [1723, 2751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1755 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4136/9354 places, 3827/9082 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4135 transition count 3826
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4135 transition count 3826
Applied a total of 2 rules in 974 ms. Remains 4135 /4136 variables (removed 1) and now considering 3826/3827 (removed 1) transitions.
// Phase 1: matrix 3826 rows 4135 cols
[2024-05-25 16:53:32] [INFO ] Computed 462 invariants in 55 ms
[2024-05-25 16:53:33] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:53:34] [INFO ] Implicit Places using invariants in 1988 ms returned [2744, 2751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1991 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4133/9354 places, 3826/9082 transitions.
Applied a total of 0 rules in 478 ms. Remains 4133 /4133 variables (removed 0) and now considering 3826/3826 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 22843 ms. Remains : 4133/9354 places, 3826/9082 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GEQ s677 1)], 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 39 reset in 750 ms.
Product exploration explored 100000 steps with 40 reset in 781 ms.
Computed a total of 4133 stabilizing places and 3826 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4133 transition count 3826
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), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2298 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=127 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 3826 rows 4133 cols
[2024-05-25 16:53:39] [INFO ] Computed 460 invariants in 51 ms
[2024-05-25 16:53:45] [INFO ] [Real]Absence check using 0 positive and 460 generalized place invariants in 836 ms returned sat
[2024-05-25 16:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:53:54] [INFO ] [Real]Absence check using state equation in 8648 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 4133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4133/4133 places, 3826/3826 transitions.
Applied a total of 0 rules in 463 ms. Remains 4133 /4133 variables (removed 0) and now considering 3826/3826 (removed 0) transitions.
[2024-05-25 16:53:54] [INFO ] Invariant cache hit.
[2024-05-25 16:53:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:53:56] [INFO ] Implicit Places using invariants in 1928 ms returned [2714]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1934 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4132/4133 places, 3826/3826 transitions.
Applied a total of 0 rules in 468 ms. Remains 4132 /4132 variables (removed 0) and now considering 3826/3826 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2865 ms. Remains : 4132/4133 places, 3826/3826 transitions.
Computed a total of 4132 stabilizing places and 3826 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4132 transition count 3826
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), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2598 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=129 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 3826 rows 4132 cols
[2024-05-25 16:53:59] [INFO ] Computed 459 invariants in 52 ms
[2024-05-25 16:54:05] [INFO ] [Real]Absence check using 0 positive and 459 generalized place invariants in 714 ms returned sat
[2024-05-25 16:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:54:14] [INFO ] [Real]Absence check using state equation in 9214 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 38 reset in 728 ms.
Product exploration explored 100000 steps with 39 reset in 777 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 4132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4132/4132 places, 3826/3826 transitions.
Graph (complete) has 5293 edges and 4132 vertex of which 2665 are kept as prefixes of interest. Removing 1467 places using SCC suffix rule.3 ms
Discarding 1467 places :
Also discarding 1264 output transitions
Drop transitions removed 1264 transitions
Performed 972 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 972 rules applied. Total rules applied 973 place count 2665 transition count 2562
Performed 1023 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1023 Pre rules applied. Total rules applied 973 place count 2665 transition count 2716
Deduced a syphon composed of 1995 places in 1 ms
Iterating global reduction 1 with 1023 rules applied. Total rules applied 1996 place count 2665 transition count 2716
Discarding 1277 places :
Symmetric choice reduction at 1 with 1277 rule applications. Total rules 3273 place count 1388 transition count 1439
Deduced a syphon composed of 721 places in 1 ms
Iterating global reduction 1 with 1277 rules applied. Total rules applied 4550 place count 1388 transition count 1439
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 4556 place count 1382 transition count 1433
Deduced a syphon composed of 718 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 4562 place count 1382 transition count 1433
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 820 places in 0 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 4664 place count 1382 transition count 1433
Discarding 151 places :
Symmetric choice reduction at 1 with 151 rule applications. Total rules 4815 place count 1231 transition count 1282
Deduced a syphon composed of 669 places in 1 ms
Iterating global reduction 1 with 151 rules applied. Total rules applied 4966 place count 1231 transition count 1282
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -306
Deduced a syphon composed of 720 places in 0 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 5017 place count 1231 transition count 1588
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5021 place count 1227 transition count 1576
Deduced a syphon composed of 716 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 5025 place count 1227 transition count 1576
Deduced a syphon composed of 716 places in 1 ms
Applied a total of 5025 rules in 585 ms. Remains 1227 /4132 variables (removed 2905) and now considering 1576/3826 (removed 2250) transitions.
[2024-05-25 16:54:16] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 1576 rows 1227 cols
[2024-05-25 16:54:16] [INFO ] Computed 205 invariants in 31 ms
[2024-05-25 16:54:18] [INFO ] Dead Transitions using invariants and state equation in 1613 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1227/4132 places, 1576/3826 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2239 ms. Remains : 1227/4132 places, 1576/3826 transitions.
Built C files in :
/tmp/ltsmin17704218537100689278
[2024-05-25 16:54:18] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17704218537100689278
Running compilation step : cd /tmp/ltsmin17704218537100689278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin17704218537100689278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17704218537100689278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 4132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4132/4132 places, 3826/3826 transitions.
Applied a total of 0 rules in 471 ms. Remains 4132 /4132 variables (removed 0) and now considering 3826/3826 (removed 0) transitions.
// Phase 1: matrix 3826 rows 4132 cols
[2024-05-25 16:54:22] [INFO ] Computed 459 invariants in 52 ms
[2024-05-25 16:54:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:54:24] [INFO ] Implicit Places using invariants in 2045 ms returned [2740]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2049 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4131/4132 places, 3826/3826 transitions.
Applied a total of 0 rules in 795 ms. Remains 4131 /4131 variables (removed 0) and now considering 3826/3826 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3315 ms. Remains : 4131/4132 places, 3826/3826 transitions.
Built C files in :
/tmp/ltsmin16832907169529639605
[2024-05-25 16:54:24] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16832907169529639605
Running compilation step : cd /tmp/ltsmin16832907169529639605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin16832907169529639605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16832907169529639605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 16:54:28] [INFO ] Flatten gal took : 88 ms
[2024-05-25 16:54:28] [INFO ] Flatten gal took : 91 ms
[2024-05-25 16:54:28] [INFO ] Time to serialize gal into /tmp/LTL4697154307473366891.gal : 16 ms
[2024-05-25 16:54:28] [INFO ] Time to serialize properties into /tmp/LTL12454420063991286857.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4697154307473366891.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3590836470164569515.hoa' '-atoms' '/tmp/LTL12454420063991286857.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12454420063991286857.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3590836470164569515.hoa
Detected timeout of ITS tools.
[2024-05-25 16:54:43] [INFO ] Flatten gal took : 78 ms
[2024-05-25 16:54:43] [INFO ] Flatten gal took : 87 ms
[2024-05-25 16:54:43] [INFO ] Time to serialize gal into /tmp/LTL5308054031046639112.gal : 15 ms
[2024-05-25 16:54:43] [INFO ] Time to serialize properties into /tmp/LTL10793527301796215964.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5308054031046639112.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10793527301796215964.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(l32_13>=1)"))))))
Formula 0 simplified : XXXG!"(l32_13>=1)"
Detected timeout of ITS tools.
[2024-05-25 16:54:58] [INFO ] Flatten gal took : 79 ms
[2024-05-25 16:54:58] [INFO ] Applying decomposition
[2024-05-25 16:54:58] [INFO ] Flatten gal took : 87 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6749743017060507230.txt' '-o' '/tmp/graph6749743017060507230.bin' '-w' '/tmp/graph6749743017060507230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6749743017060507230.bin' '-l' '-1' '-v' '-w' '/tmp/graph6749743017060507230.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:54:59] [INFO ] Decomposing Gal with order
[2024-05-25 16:54:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:55:00] [INFO ] Removed a total of 745 redundant transitions.
[2024-05-25 16:55:00] [INFO ] Flatten gal took : 200 ms
[2024-05-25 16:55:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2024-05-25 16:55:00] [INFO ] Time to serialize gal into /tmp/LTL1153943549261359819.gal : 57 ms
[2024-05-25 16:55:00] [INFO ] Time to serialize properties into /tmp/LTL12156845964706294612.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1153943549261359819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12156845964706294612.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i21.i2.i0.u306.l32_13>=1)"))))))
Formula 0 simplified : XXXG!"(i21.i2.i0.u306.l32_13>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11982115279618552010
[2024-05-25 16:55:15] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11982115279618552010
Running compilation step : cd /tmp/ltsmin11982115279618552010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin11982115279618552010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11982115279618552010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14 finished in 126160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G(p1))))))'
Support contains 4 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 8741 transition count 9082
Discarding 567 places :
Symmetric choice reduction at 1 with 567 rule applications. Total rules 1180 place count 8174 transition count 8265
Iterating global reduction 1 with 567 rules applied. Total rules applied 1747 place count 8174 transition count 8265
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 2107 place count 7814 transition count 7805
Iterating global reduction 1 with 360 rules applied. Total rules applied 2467 place count 7814 transition count 7805
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2518 place count 7763 transition count 7805
Discarding 310 places :
Symmetric choice reduction at 2 with 310 rule applications. Total rules 2828 place count 7453 transition count 7295
Iterating global reduction 2 with 310 rules applied. Total rules applied 3138 place count 7453 transition count 7295
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 102 rules applied. Total rules applied 3240 place count 7351 transition count 7295
Discarding 458 places :
Symmetric choice reduction at 3 with 458 rule applications. Total rules 3698 place count 6893 transition count 6837
Iterating global reduction 3 with 458 rules applied. Total rules applied 4156 place count 6893 transition count 6837
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 153 rules applied. Total rules applied 4309 place count 6842 transition count 6735
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4564 place count 6587 transition count 6480
Iterating global reduction 4 with 255 rules applied. Total rules applied 4819 place count 6587 transition count 6480
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5074 place count 6332 transition count 6225
Iterating global reduction 4 with 255 rules applied. Total rules applied 5329 place count 6332 transition count 6225
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5584 place count 6077 transition count 5970
Iterating global reduction 4 with 255 rules applied. Total rules applied 5839 place count 6077 transition count 5970
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6094 place count 5822 transition count 5715
Iterating global reduction 4 with 255 rules applied. Total rules applied 6349 place count 5822 transition count 5715
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6604 place count 5567 transition count 5460
Iterating global reduction 4 with 255 rules applied. Total rules applied 6859 place count 5567 transition count 5460
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7114 place count 5312 transition count 5205
Iterating global reduction 4 with 255 rules applied. Total rules applied 7369 place count 5312 transition count 5205
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7624 place count 5057 transition count 4950
Iterating global reduction 4 with 255 rules applied. Total rules applied 7879 place count 5057 transition count 4950
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8134 place count 4802 transition count 4695
Iterating global reduction 4 with 255 rules applied. Total rules applied 8389 place count 4802 transition count 4695
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8644 place count 4547 transition count 4440
Iterating global reduction 4 with 255 rules applied. Total rules applied 8899 place count 4547 transition count 4440
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 9154 place count 4292 transition count 4185
Iterating global reduction 4 with 255 rules applied. Total rules applied 9409 place count 4292 transition count 4185
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 9613 place count 4292 transition count 3981
Discarding 51 places :
Symmetric choice reduction at 5 with 51 rule applications. Total rules 9664 place count 4241 transition count 3930
Iterating global reduction 5 with 51 rules applied. Total rules applied 9715 place count 4241 transition count 3930
Discarding 51 places :
Symmetric choice reduction at 5 with 51 rule applications. Total rules 9766 place count 4190 transition count 3879
Iterating global reduction 5 with 51 rules applied. Total rules applied 9817 place count 4190 transition count 3879
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 5 with 102 rules applied. Total rules applied 9919 place count 4139 transition count 3828
Applied a total of 9919 rules in 17646 ms. Remains 4139 /9354 variables (removed 5215) and now considering 3828/9082 (removed 5254) transitions.
// Phase 1: matrix 3828 rows 4139 cols
[2024-05-25 16:55:36] [INFO ] Computed 464 invariants in 52 ms
[2024-05-25 16:55:36] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:55:38] [INFO ] Implicit Places using invariants in 2169 ms returned [1723, 2717, 2727]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2172 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4136/9354 places, 3828/9082 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4135 transition count 3827
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4135 transition count 3827
Applied a total of 2 rules in 979 ms. Remains 4135 /4136 variables (removed 1) and now considering 3827/3828 (removed 1) transitions.
// Phase 1: matrix 3827 rows 4135 cols
[2024-05-25 16:55:39] [INFO ] Computed 461 invariants in 54 ms
[2024-05-25 16:55:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 16:55:41] [INFO ] Implicit Places using invariants in 1881 ms returned [2713, 2727]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1883 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4133/9354 places, 3827/9082 transitions.
Applied a total of 0 rules in 488 ms. Remains 4133 /4133 variables (removed 0) and now considering 3827/3827 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 23170 ms. Remains : 4133/9354 places, 3827/9082 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s3756 1) (LT s3621 1)), p1:(AND (GEQ s1729 1) (GEQ s2036 1))], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-15 finished in 23443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Found a Shortening insensitive property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 357 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Graph (complete) has 13521 edges and 9354 vertex of which 7458 are kept as prefixes of interest. Removing 1896 places using SCC suffix rule.12 ms
Discarding 1896 places :
Also discarding 1889 output transitions
Drop transitions removed 1889 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Drop transitions removed 4337 transitions
Trivial Post-agglo rules discarded 4337 transitions
Performed 4337 trivial Post agglomeration. Transition count delta: 4337
Iterating post reduction 0 with 4950 rules applied. Total rules applied 4951 place count 6794 transition count 2805
Reduce places removed 4337 places and 0 transitions.
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 1 with 4490 rules applied. Total rules applied 9441 place count 2457 transition count 2652
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 2 with 153 rules applied. Total rules applied 9594 place count 2304 transition count 2652
Performed 407 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 407 Pre rules applied. Total rules applied 9594 place count 2304 transition count 2245
Deduced a syphon composed of 407 places in 0 ms
Ensure Unique test removed 153 places
Reduce places removed 560 places and 0 transitions.
Iterating global reduction 3 with 967 rules applied. Total rules applied 10561 place count 1744 transition count 2245
Discarding 361 places :
Symmetric choice reduction at 3 with 361 rule applications. Total rules 10922 place count 1383 transition count 1684
Iterating global reduction 3 with 361 rules applied. Total rules applied 11283 place count 1383 transition count 1684
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 11284 place count 1383 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 11285 place count 1382 transition count 1683
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 11285 place count 1382 transition count 1632
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 11387 place count 1331 transition count 1632
Discarding 205 places :
Symmetric choice reduction at 5 with 205 rule applications. Total rules 11592 place count 1126 transition count 1377
Iterating global reduction 5 with 205 rules applied. Total rules applied 11797 place count 1126 transition count 1377
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 5 with 306 rules applied. Total rules applied 12103 place count 1075 transition count 1122
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 12154 place count 1024 transition count 1122
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 12154 place count 1024 transition count 1071
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 12256 place count 973 transition count 1071
Discarding 51 places :
Symmetric choice reduction at 7 with 51 rule applications. Total rules 12307 place count 922 transition count 1020
Iterating global reduction 7 with 51 rules applied. Total rules applied 12358 place count 922 transition count 1020
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 7 with 51 rules applied. Total rules applied 12409 place count 922 transition count 969
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 51 Pre rules applied. Total rules applied 12409 place count 922 transition count 918
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 8 with 153 rules applied. Total rules applied 12562 place count 820 transition count 918
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 12664 place count 769 transition count 867
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 8 with 51 rules applied. Total rules applied 12715 place count 718 transition count 816
Applied a total of 12715 rules in 429 ms. Remains 718 /9354 variables (removed 8636) and now considering 816/9082 (removed 8266) transitions.
// Phase 1: matrix 816 rows 718 cols
[2024-05-25 16:55:42] [INFO ] Computed 104 invariants in 6 ms
[2024-05-25 16:55:43] [INFO ] Implicit Places using invariants in 549 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 552 ms to find 52 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 666/9354 places, 816/9082 transitions.
Applied a total of 0 rules in 11 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 994 ms. Remains : 666/9354 places, 816/9082 transitions.
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s425 1) (GEQ s527 1)) (AND (GEQ s420 1) (GEQ s522 1)) (AND (GEQ s460 1) (GEQ s664 1)) (AND (GEQ s455 1) (GEQ s659 1)) (AND (GEQ s418 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 325 reset in 1673 ms.
Product exploration explored 100000 steps with 325 reset in 1459 ms.
Computed a total of 666 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 666 transition count 816
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 173 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Finished random walk after 288 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND p0 p1)), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 264 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
// Phase 1: matrix 816 rows 666 cols
[2024-05-25 16:55:48] [INFO ] Computed 52 invariants in 6 ms
[2024-05-25 16:55:50] [INFO ] [Real]Absence check using 0 positive and 52 generalized place invariants in 46 ms returned sat
[2024-05-25 16:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:55:51] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2024-05-25 16:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:55:53] [INFO ] [Nat]Absence check using 0 positive and 52 generalized place invariants in 29 ms returned sat
[2024-05-25 16:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:55:54] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2024-05-25 16:55:54] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 69 ms.
[2024-05-25 16:55:56] [INFO ] Added : 180 causal constraints over 36 iterations in 2444 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 357 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 816/816 transitions.
Applied a total of 0 rules in 13 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2024-05-25 16:55:56] [INFO ] Invariant cache hit.
[2024-05-25 16:55:57] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-25 16:55:57] [INFO ] Invariant cache hit.
[2024-05-25 16:55:57] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
[2024-05-25 16:55:57] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-25 16:55:57] [INFO ] Invariant cache hit.
[2024-05-25 16:55:58] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1567 ms. Remains : 666/666 places, 816/816 transitions.
Computed a total of 666 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 666 transition count 816
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 160 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Finished random walk after 296 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND p0 p1)), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 256 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-05-25 16:56:00] [INFO ] Invariant cache hit.
[2024-05-25 16:56:02] [INFO ] [Real]Absence check using 0 positive and 52 generalized place invariants in 48 ms returned sat
[2024-05-25 16:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 16:56:03] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2024-05-25 16:56:03] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 74 ms.
[2024-05-25 16:56:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:56:06] [INFO ] [Nat]Absence check using 0 positive and 52 generalized place invariants in 31 ms returned sat
[2024-05-25 16:56:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 16:56:07] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2024-05-25 16:56:07] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 58 ms.
[2024-05-25 16:56:09] [INFO ] Added : 176 causal constraints over 36 iterations in 2090 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Product exploration explored 100000 steps with 325 reset in 1412 ms.
Product exploration explored 100000 steps with 325 reset in 1454 ms.
Built C files in :
/tmp/ltsmin3611623118487994093
[2024-05-25 16:56:12] [INFO ] Computing symmetric may disable matrix : 816 transitions.
[2024-05-25 16:56:12] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:56:12] [INFO ] Computing symmetric may enable matrix : 816 transitions.
[2024-05-25 16:56:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:56:12] [INFO ] Computing Do-Not-Accords matrix : 816 transitions.
[2024-05-25 16:56:12] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:56:12] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3611623118487994093
Running compilation step : cd /tmp/ltsmin3611623118487994093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin3611623118487994093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3611623118487994093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 357 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 816/816 transitions.
Applied a total of 0 rules in 15 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2024-05-25 16:56:15] [INFO ] Invariant cache hit.
[2024-05-25 16:56:15] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-25 16:56:15] [INFO ] Invariant cache hit.
[2024-05-25 16:56:16] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
[2024-05-25 16:56:16] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-25 16:56:16] [INFO ] Invariant cache hit.
[2024-05-25 16:56:17] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1843 ms. Remains : 666/666 places, 816/816 transitions.
Built C files in :
/tmp/ltsmin16998891709294225346
[2024-05-25 16:56:17] [INFO ] Computing symmetric may disable matrix : 816 transitions.
[2024-05-25 16:56:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:56:17] [INFO ] Computing symmetric may enable matrix : 816 transitions.
[2024-05-25 16:56:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:56:17] [INFO ] Computing Do-Not-Accords matrix : 816 transitions.
[2024-05-25 16:56:17] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:56:17] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16998891709294225346
Running compilation step : cd /tmp/ltsmin16998891709294225346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin16998891709294225346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16998891709294225346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 16:56:20] [INFO ] Flatten gal took : 19 ms
[2024-05-25 16:56:20] [INFO ] Flatten gal took : 19 ms
[2024-05-25 16:56:20] [INFO ] Time to serialize gal into /tmp/LTL17018300033849990988.gal : 3 ms
[2024-05-25 16:56:20] [INFO ] Time to serialize properties into /tmp/LTL12842528759010213197.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17018300033849990988.gal' '-t' 'CGAL' '-hoa' '/tmp/aut793515440852774779.hoa' '-atoms' '/tmp/LTL12842528759010213197.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12842528759010213197.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut793515440852774779.hoa
Detected timeout of ITS tools.
[2024-05-25 16:56:35] [INFO ] Flatten gal took : 18 ms
[2024-05-25 16:56:36] [INFO ] Flatten gal took : 19 ms
[2024-05-25 16:56:36] [INFO ] Time to serialize gal into /tmp/LTL11735385004933517537.gal : 4 ms
[2024-05-25 16:56:36] [INFO ] Time to serialize properties into /tmp/LTL15219042024919572022.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11735385004933517537.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15219042024919572022.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((p6_11_0<1)&&(p6_39_2<1))&&((p6_25_1<1)&&(p6_7_0<1)))&&(((p6_35_2<1)&&(p6_21_1<1))&&((p6_19_0<1)&&(p6_47_2<1))))&&(...7138
Formula 0 simplified : XG(!"((((((((((l20_14>=1)&&(pl1_14_0>=1))||((l20_9>=1)&&(pl1_9_0>=1)))||(((l20_49>=1)&&(pl1_49_2>=1))||((l20_44>=1)&&(pl1_44_2>=1)))...7130
Detected timeout of ITS tools.
[2024-05-25 16:56:51] [INFO ] Flatten gal took : 19 ms
[2024-05-25 16:56:51] [INFO ] Applying decomposition
[2024-05-25 16:56:51] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13934841180701049863.txt' '-o' '/tmp/graph13934841180701049863.bin' '-w' '/tmp/graph13934841180701049863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13934841180701049863.bin' '-l' '-1' '-v' '-w' '/tmp/graph13934841180701049863.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:56:51] [INFO ] Decomposing Gal with order
[2024-05-25 16:56:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:56:51] [INFO ] Removed a total of 459 redundant transitions.
[2024-05-25 16:56:51] [INFO ] Flatten gal took : 36 ms
[2024-05-25 16:56:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 7 ms.
[2024-05-25 16:56:51] [INFO ] Time to serialize gal into /tmp/LTL16637895600476922586.gal : 6 ms
[2024-05-25 16:56:51] [INFO ] Time to serialize properties into /tmp/LTL8115204665232457953.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16637895600476922586.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8115204665232457953.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((i3.u6.p6_11_0<1)&&(i38.u105.p6_39_2<1))&&((i33.u30.p6_25_1<1)&&(u4.p6_7_0<1)))&&(((i21.u58.p6_35_2<1)&&(i43.u87.p6...10561
Formula 0 simplified : XG(!"((((((((((i47.u68.l20_14>=1)&&(i47.u143.pl1_14_0>=1))||((u5.l20_9>=1)&&(u5.pl1_9_0>=1)))||(((i14.u128.l20_49>=1)&&(i14.u166.pl1...10553
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16202846112989692446
[2024-05-25 16:57:06] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16202846112989692446
Running compilation step : cd /tmp/ltsmin16202846112989692446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1968 ms.
Running link step : cd /tmp/ltsmin16202846112989692446;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16202846112989692446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04 finished in 99405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0||G(p1))))))))'
Found a Lengthening insensitive property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Graph (complete) has 13521 edges and 9354 vertex of which 9148 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.17 ms
Discarding 206 places :
Also discarding 206 output transitions
Drop transitions removed 206 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Drop transitions removed 5150 transitions
Trivial Post-agglo rules discarded 5150 transitions
Performed 5150 trivial Post agglomeration. Transition count delta: 5150
Iterating post reduction 0 with 5763 rules applied. Total rules applied 5764 place count 8484 transition count 3675
Reduce places removed 5150 places and 0 transitions.
Iterating post reduction 1 with 5150 rules applied. Total rules applied 10914 place count 3334 transition count 3675
Performed 662 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 662 Pre rules applied. Total rules applied 10914 place count 3334 transition count 3013
Deduced a syphon composed of 662 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 968 places and 0 transitions.
Iterating global reduction 2 with 1630 rules applied. Total rules applied 12544 place count 2366 transition count 3013
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 2 with 204 rules applied. Total rules applied 12748 place count 2366 transition count 2809
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 12952 place count 2162 transition count 2809
Discarding 565 places :
Symmetric choice reduction at 4 with 565 rule applications. Total rules 13517 place count 1597 transition count 2044
Iterating global reduction 4 with 565 rules applied. Total rules applied 14082 place count 1597 transition count 2044
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 4 with 103 rules applied. Total rules applied 14185 place count 1597 transition count 1941
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 5 with 103 rules applied. Total rules applied 14288 place count 1494 transition count 1941
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 14288 place count 1494 transition count 1890
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 14390 place count 1443 transition count 1890
Discarding 208 places :
Symmetric choice reduction at 6 with 208 rule applications. Total rules 14598 place count 1235 transition count 1482
Iterating global reduction 6 with 208 rules applied. Total rules applied 14806 place count 1235 transition count 1482
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 408 transitions.
Discarding 153 places :
Implicit places reduction removed 153 places
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 6 with 714 rules applied. Total rules applied 15520 place count 1082 transition count 921
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 7 with 153 rules applied. Total rules applied 15673 place count 929 transition count 921
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 51 Pre rules applied. Total rules applied 15673 place count 929 transition count 870
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 15775 place count 878 transition count 870
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 8 with 306 rules applied. Total rules applied 16081 place count 725 transition count 717
Applied a total of 16081 rules in 457 ms. Remains 725 /9354 variables (removed 8629) and now considering 717/9082 (removed 8365) transitions.
// Phase 1: matrix 717 rows 725 cols
[2024-05-25 16:57:22] [INFO ] Computed 209 invariants in 11 ms
[2024-05-25 16:57:23] [INFO ] Implicit Places using invariants in 1077 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 204, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 673]
Discarding 206 places :
Implicit Place search using SMT only with invariants took 1080 ms to find 206 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 519/9354 places, 717/9082 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 519 transition count 513
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 1 with 204 rules applied. Total rules applied 408 place count 315 transition count 513
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 408 place count 315 transition count 462
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 510 place count 264 transition count 462
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 559 place count 215 transition count 364
Iterating global reduction 2 with 49 rules applied. Total rules applied 608 place count 215 transition count 364
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 657 place count 166 transition count 315
Iterating global reduction 2 with 49 rules applied. Total rules applied 706 place count 166 transition count 315
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 755 place count 117 transition count 217
Iterating global reduction 2 with 49 rules applied. Total rules applied 804 place count 117 transition count 217
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 852 place count 69 transition count 121
Iterating global reduction 2 with 48 rules applied. Total rules applied 900 place count 69 transition count 121
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 948 place count 21 transition count 25
Iterating global reduction 2 with 48 rules applied. Total rules applied 996 place count 21 transition count 25
Applied a total of 996 rules in 17 ms. Remains 21 /519 variables (removed 498) and now considering 25/717 (removed 692) transitions.
// Phase 1: matrix 25 rows 21 cols
[2024-05-25 16:57:23] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 16:57:23] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 16:57:23] [INFO ] Invariant cache hit.
[2024-05-25 16:57:23] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 21/9354 places, 25/9082 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1615 ms. Remains : 21/9354 places, 25/9082 transitions.
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(OR (LT s10 1) (LT s11 1)), p0:(LT s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 1 ms.
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08 finished in 1951 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 9354 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9354/9354 places, 9082/9082 transitions.
Graph (complete) has 13521 edges and 9354 vertex of which 7275 are kept as prefixes of interest. Removing 2079 places using SCC suffix rule.8 ms
Discarding 2079 places :
Also discarding 2024 output transitions
Drop transitions removed 2024 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 613 places :
Implicit places reduction removed 613 places
Drop transitions removed 4647 transitions
Trivial Post-agglo rules discarded 4647 transitions
Performed 4647 trivial Post agglomeration. Transition count delta: 4647
Iterating post reduction 0 with 5260 rules applied. Total rules applied 5261 place count 6611 transition count 2360
Reduce places removed 4647 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 4651 rules applied. Total rules applied 9912 place count 1963 transition count 2357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9913 place count 1962 transition count 2357
Performed 462 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 462 Pre rules applied. Total rules applied 9913 place count 1962 transition count 1895
Deduced a syphon composed of 462 places in 1 ms
Ensure Unique test removed 156 places
Reduce places removed 618 places and 0 transitions.
Iterating global reduction 3 with 1080 rules applied. Total rules applied 10993 place count 1344 transition count 1895
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 3 with 153 rules applied. Total rules applied 11146 place count 1344 transition count 1742
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 11299 place count 1191 transition count 1742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 11299 place count 1191 transition count 1741
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 11301 place count 1190 transition count 1741
Discarding 412 places :
Symmetric choice reduction at 5 with 412 rule applications. Total rules 11713 place count 778 transition count 1031
Iterating global reduction 5 with 412 rules applied. Total rules applied 12125 place count 778 transition count 1031
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 12127 place count 778 transition count 1029
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 12129 place count 776 transition count 1029
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 12129 place count 776 transition count 1028
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 12131 place count 775 transition count 1028
Discarding 207 places :
Symmetric choice reduction at 7 with 207 rule applications. Total rules 12338 place count 568 transition count 769
Iterating global reduction 7 with 207 rules applied. Total rules applied 12545 place count 568 transition count 769
Ensure Unique test removed 306 transitions
Reduce isomorphic transitions removed 306 transitions.
Discarding 103 places :
Implicit places reduction removed 103 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 7 with 511 rules applied. Total rules applied 13056 place count 465 transition count 361
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 8 with 102 rules applied. Total rules applied 13158 place count 363 transition count 361
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 53 Pre rules applied. Total rules applied 13158 place count 363 transition count 308
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 9 with 106 rules applied. Total rules applied 13264 place count 310 transition count 308
Discarding 100 places :
Symmetric choice reduction at 9 with 100 rule applications. Total rules 13364 place count 210 transition count 208
Iterating global reduction 9 with 100 rules applied. Total rules applied 13464 place count 210 transition count 208
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 9 with 51 rules applied. Total rules applied 13515 place count 210 transition count 157
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 51 Pre rules applied. Total rules applied 13515 place count 210 transition count 106
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 10 with 153 rules applied. Total rules applied 13668 place count 108 transition count 106
Discarding 49 places :
Symmetric choice reduction at 10 with 49 rule applications. Total rules 13717 place count 59 transition count 57
Iterating global reduction 10 with 49 rules applied. Total rules applied 13766 place count 59 transition count 57
Discarding 49 places :
Symmetric choice reduction at 10 with 49 rule applications. Total rules 13815 place count 10 transition count 8
Iterating global reduction 10 with 49 rules applied. Total rules applied 13864 place count 10 transition count 8
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 13866 place count 8 transition count 6
Applied a total of 13866 rules in 221 ms. Remains 8 /9354 variables (removed 9346) and now considering 6/9082 (removed 9076) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-25 16:57:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 16:57:23] [INFO ] Implicit Places using invariants in 49 ms returned [3, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 6/9354 places, 6/9082 transitions.
Graph (complete) has 4 edges and 6 vertex of which 4 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 1 ms. Remains 2 /6 variables (removed 4) and now considering 2/6 (removed 4) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-25 16:57:23] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:57:23] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-25 16:57:23] [INFO ] Invariant cache hit.
[2024-05-25 16:57:23] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2/9354 places, 2/9082 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 305 ms. Remains : 2/9354 places, 2/9082 transitions.
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GEQ s0 1)], 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14 finished in 544 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-25 16:57:24] [INFO ] Flatten gal took : 219 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10622097710065026230
[2024-05-25 16:57:24] [INFO ] Too many transitions (9082) to apply POR reductions. Disabling POR matrices.
[2024-05-25 16:57:24] [INFO ] Applying decomposition
[2024-05-25 16:57:24] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10622097710065026230
Running compilation step : cd /tmp/ltsmin10622097710065026230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 16:57:24] [INFO ] Flatten gal took : 235 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5331325782904031930.txt' '-o' '/tmp/graph5331325782904031930.bin' '-w' '/tmp/graph5331325782904031930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5331325782904031930.bin' '-l' '-1' '-v' '-w' '/tmp/graph5331325782904031930.weights' '-q' '0' '-e' '0.001'
[2024-05-25 16:57:25] [INFO ] Decomposing Gal with order
[2024-05-25 16:57:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 16:57:31] [INFO ] Removed a total of 2904 redundant transitions.
[2024-05-25 16:57:32] [INFO ] Flatten gal took : 727 ms
[2024-05-25 16:57:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 385 labels/synchronizations in 143 ms.
[2024-05-25 16:57:32] [INFO ] Time to serialize gal into /tmp/LTLFireability10418670768387243846.gal : 89 ms
[2024-05-25 16:57:32] [INFO ] Time to serialize properties into /tmp/LTLFireability5486568368751374175.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10418670768387243846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5486568368751374175.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(F(("((((((((((i83.i1.i4.u3316.l20_14>=1)&&(i83.i1.i4.u3265.pl1_14_0>=1))||((i85.u3312.l20_9>=1)&&(i85.u3261.pl1_9_0>=1)))||(((i94...13222
Formula 0 simplified : XG(!"((((((((((i83.i1.i4.u3316.l20_14>=1)&&(i83.i1.i4.u3265.pl1_14_0>=1))||((i85.u3312.l20_9>=1)&&(i85.u3261.pl1_9_0>=1)))||(((i94.i...13214
Compilation finished in 93235 ms.
Running link step : cd /tmp/ltsmin10622097710065026230;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 171 ms.
Running LTSmin : cd /tmp/ltsmin10622097710065026230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-25 17:20:42] [INFO ] Flatten gal took : 21837 ms
[2024-05-25 17:20:49] [INFO ] Time to serialize gal into /tmp/LTLFireability17290221007288147819.gal : 2000 ms
[2024-05-25 17:20:49] [INFO ] Time to serialize properties into /tmp/LTLFireability9507506806796472010.ltl : 201 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17290221007288147819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9507506806796472010.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((X(F(("((((((((((l20_14>=1)&&(pl1_14_0>=1))||((l20_9>=1)&&(pl1_9_0>=1)))||(((l20_49>=1)&&(pl1_49_2>=1))||((l20_44>=1)&&(pl1_44_2>=1)...7138
Formula 0 simplified : XG(!"((((((((((l20_14>=1)&&(pl1_14_0>=1))||((l20_9>=1)&&(pl1_9_0>=1)))||(((l20_49>=1)&&(pl1_49_2>=1))||((l20_44>=1)&&(pl1_44_2>=1)))...7130
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin10622097710065026230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10622097710065026230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp4==true)))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4812244 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16038028 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-PT-L00050M0005C002P002G001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FamilyReunion-PT-L00050M0005C002P002G001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-171636280400313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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