Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838855800412.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r169-tall-167838855800412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.6M
-rw-r--r-- 1 mcc users 113K Feb 26 12:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 682K Feb 26 12:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 26 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 726K Feb 26 12:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 32K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 238K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 26 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 26 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 297K Feb 26 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 994K Feb 26 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.7M Mar 5 18:22 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 1678539100102

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00050M0005C002P002G001
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 12:51:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 12:51:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 12:51:42] [INFO ] Load time of PNML (sax parser for PT used): 412 ms
[2023-03-11 12:51:42] [INFO ] Transformed 12194 places.
[2023-03-11 12:51:42] [INFO ] Transformed 10560 transitions.
[2023-03-11 12:51:42] [INFO ] Parsed PT model containing 12194 places and 10560 transitions and 32238 arcs in 520 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 43 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 17 places and 0 transitions.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1908 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 1528 places :
Implicit places reduction removed 1528 places
Iterating post reduction 0 with 1701 rules applied. Total rules applied 1701 place count 10476 transition count 10560
Discarding 715 places :
Symmetric choice reduction at 1 with 715 rule applications. Total rules 2416 place count 9761 transition count 9795
Iterating global reduction 1 with 715 rules applied. Total rules applied 3131 place count 9761 transition count 9795
Discarding 508 places :
Symmetric choice reduction at 1 with 508 rule applications. Total rules 3639 place count 9253 transition count 9287
Iterating global reduction 1 with 508 rules applied. Total rules applied 4147 place count 9253 transition count 9287
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 153 rules applied. Total rules applied 4300 place count 9202 transition count 9185
Discarding 257 places :
Symmetric choice reduction at 2 with 257 rule applications. Total rules 4557 place count 8945 transition count 8828
Iterating global reduction 2 with 257 rules applied. Total rules applied 4814 place count 8945 transition count 8828
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 4819 place count 8940 transition count 8573
Iterating global reduction 2 with 5 rules applied. Total rules applied 4824 place count 8940 transition count 8573
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 4875 place count 8889 transition count 8573
Applied a total of 4875 rules in 7029 ms. Remains 8889 /12177 variables (removed 3288) and now considering 8573/10560 (removed 1987) transitions.
// Phase 1: matrix 8573 rows 8889 cols
[2023-03-11 12:51:50] [INFO ] Computed 1027 place invariants in 370 ms
[2023-03-11 12:51:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:51:51] [INFO ] Implicit Places using invariants in 1376 ms returned []
[2023-03-11 12:51:51] [INFO ] Invariant cache hit.
[2023-03-11 12:51:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:51:52] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 2265 ms to find 0 implicit places.
[2023-03-11 12:51:52] [INFO ] Invariant cache hit.
[2023-03-11 12:51:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:51:52] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8889/12177 places, 8573/10560 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10187 ms. Remains : 8889/12177 places, 8573/10560 transitions.
Support contains 1908 out of 8889 places after structural reductions.
[2023-03-11 12:51:53] [INFO ] Flatten gal took : 422 ms
[2023-03-11 12:51:53] [INFO ] Flatten gal took : 265 ms
[2023-03-11 12:51:54] [INFO ] Input system was already deterministic with 8573 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 25) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 12:51:55] [INFO ] Invariant cache hit.
[2023-03-11 12:51:57] [INFO ] [Real]Absence check using 0 positive and 1027 generalized place invariants in 446 ms returned sat
[2023-03-11 12:52:15] [INFO ] After 17240ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
[2023-03-11 12:52:20] [INFO ] After 21919ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-11 12:52:20] [INFO ] After 25076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Finished Parikh walk after 1476 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=86 )
Parikh walk visited 8 properties in 301 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 8889 stabilizing places and 8573 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8889 transition count 8573
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X((!p1 U (!p2||G(!p1))))&&p0)))))))'
Support contains 153 out of 8889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8889/8889 places, 8573/8573 transitions.
Discarding 308 places :
Implicit places reduction removed 308 places
Iterating post reduction 0 with 308 rules applied. Total rules applied 308 place count 8581 transition count 8573
Discarding 512 places :
Symmetric choice reduction at 1 with 512 rule applications. Total rules 820 place count 8069 transition count 8060
Iterating global reduction 1 with 512 rules applied. Total rules applied 1332 place count 8069 transition count 8060
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 1692 place count 7709 transition count 7550
Iterating global reduction 1 with 360 rules applied. Total rules applied 2052 place count 7709 transition count 7550
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 204 rules applied. Total rules applied 2256 place count 7607 transition count 7448
Discarding 408 places :
Symmetric choice reduction at 2 with 408 rule applications. Total rules 2664 place count 7199 transition count 7040
Iterating global reduction 2 with 408 rules applied. Total rules applied 3072 place count 7199 transition count 7040
Discarding 358 places :
Symmetric choice reduction at 2 with 358 rule applications. Total rules 3430 place count 6841 transition count 6632
Iterating global reduction 2 with 358 rules applied. Total rules applied 3788 place count 6841 transition count 6632
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 3839 place count 6790 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4094 place count 6535 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 4349 place count 6535 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4604 place count 6280 transition count 6122
Iterating global reduction 3 with 255 rules applied. Total rules applied 4859 place count 6280 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5114 place count 6025 transition count 5867
Iterating global reduction 3 with 255 rules applied. Total rules applied 5369 place count 6025 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5624 place count 5770 transition count 5612
Iterating global reduction 3 with 255 rules applied. Total rules applied 5879 place count 5770 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6134 place count 5515 transition count 5357
Iterating global reduction 3 with 255 rules applied. Total rules applied 6389 place count 5515 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6644 place count 5260 transition count 5102
Iterating global reduction 3 with 255 rules applied. Total rules applied 6899 place count 5260 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7154 place count 5005 transition count 4847
Iterating global reduction 3 with 255 rules applied. Total rules applied 7409 place count 5005 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7664 place count 4750 transition count 4592
Iterating global reduction 3 with 255 rules applied. Total rules applied 7919 place count 4750 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8174 place count 4495 transition count 4337
Iterating global reduction 3 with 255 rules applied. Total rules applied 8429 place count 4495 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8684 place count 4240 transition count 4082
Iterating global reduction 3 with 255 rules applied. Total rules applied 8939 place count 4240 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 306 rules applied. Total rules applied 9245 place count 4189 transition count 3827
Applied a total of 9245 rules in 12185 ms. Remains 4189 /8889 variables (removed 4700) and now considering 3827/8573 (removed 4746) transitions.
// Phase 1: matrix 3827 rows 4189 cols
[2023-03-11 12:52:33] [INFO ] Computed 515 place invariants in 55 ms
[2023-03-11 12:52:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:52:34] [INFO ] Implicit Places using invariants in 1107 ms returned [1723]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1110 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4188/8889 places, 3827/8573 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4187 transition count 3826
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4187 transition count 3826
Applied a total of 2 rules in 694 ms. Remains 4187 /4188 variables (removed 1) and now considering 3826/3827 (removed 1) transitions.
// Phase 1: matrix 3826 rows 4187 cols
[2023-03-11 12:52:35] [INFO ] Computed 514 place invariants in 48 ms
[2023-03-11 12:52:36] [INFO ] Implicit Places using invariants in 1061 ms returned [2788]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1064 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4186/8889 places, 3826/8573 transitions.
Applied a total of 0 rules in 342 ms. Remains 4186 /4186 variables (removed 0) and now considering 3826/3826 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 15396 ms. Remains : 4186/8889 places, 3826/8573 transitions.
Stuttering acceptance computed with spot in 394 ms :[true, (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND p2 p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(AND (OR (LT s2259 1) (LT s2668 1)) (OR (LT s2296 1) (LT s2705 1)) (OR (LT s2254 1) (LT s2663 1)) (OR (LT s2291 1) (LT s2700 1)) (OR (LT s2264 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 847 steps with 0 reset in 25 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-01 finished in 15889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 51 out of 8889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8889/8889 places, 8573/8573 transitions.
Discarding 359 places :
Implicit places reduction removed 359 places
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 8530 transition count 8573
Discarding 512 places :
Symmetric choice reduction at 1 with 512 rule applications. Total rules 871 place count 8018 transition count 8060
Iterating global reduction 1 with 512 rules applied. Total rules applied 1383 place count 8018 transition count 8060
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 1743 place count 7658 transition count 7550
Iterating global reduction 1 with 360 rules applied. Total rules applied 2103 place count 7658 transition count 7550
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 204 rules applied. Total rules applied 2307 place count 7556 transition count 7448
Discarding 408 places :
Symmetric choice reduction at 2 with 408 rule applications. Total rules 2715 place count 7148 transition count 7040
Iterating global reduction 2 with 408 rules applied. Total rules applied 3123 place count 7148 transition count 7040
Discarding 358 places :
Symmetric choice reduction at 2 with 358 rule applications. Total rules 3481 place count 6790 transition count 6632
Iterating global reduction 2 with 358 rules applied. Total rules applied 3839 place count 6790 transition count 6632
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 3890 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4145 place count 6484 transition count 6377
Iterating global reduction 3 with 255 rules applied. Total rules applied 4400 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 4655 place count 6229 transition count 6122
Iterating global reduction 3 with 255 rules applied. Total rules applied 4910 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5165 place count 5974 transition count 5867
Iterating global reduction 3 with 255 rules applied. Total rules applied 5420 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 5675 place count 5719 transition count 5612
Iterating global reduction 3 with 255 rules applied. Total rules applied 5930 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6185 place count 5464 transition count 5357
Iterating global reduction 3 with 255 rules applied. Total rules applied 6440 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 6695 place count 5209 transition count 5102
Iterating global reduction 3 with 255 rules applied. Total rules applied 6950 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7205 place count 4954 transition count 4847
Iterating global reduction 3 with 255 rules applied. Total rules applied 7460 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 7715 place count 4699 transition count 4592
Iterating global reduction 3 with 255 rules applied. Total rules applied 7970 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8225 place count 4444 transition count 4337
Iterating global reduction 3 with 255 rules applied. Total rules applied 8480 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 8735 place count 4189 transition count 4082
Iterating global reduction 3 with 255 rules applied. Total rules applied 8990 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 306 rules applied. Total rules applied 9296 place count 4138 transition count 3827
Applied a total of 9296 rules in 12008 ms. Remains 4138 /8889 variables (removed 4751) and now considering 3827/8573 (removed 4746) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2023-03-11 12:52:48] [INFO ] Computed 464 place invariants in 39 ms
[2023-03-11 12:52:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:52:50] [INFO ] Implicit Places using invariants in 1128 ms returned [1723, 2751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1132 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4136/8889 places, 3827/8573 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 712 ms. Remains 4135 /4136 variables (removed 1) and now considering 3826/3827 (removed 1) transitions.
// Phase 1: matrix 3826 rows 4135 cols
[2023-03-11 12:52:50] [INFO ] Computed 462 place invariants in 49 ms
[2023-03-11 12:52:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:52:51] [INFO ] Implicit Places using invariants in 1148 ms returned [2744, 2751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1152 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4133/8889 places, 3826/8573 transitions.
Applied a total of 0 rules in 353 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 15357 ms. Remains : 4133/8889 places, 3826/8573 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s4085 1) (LT s4083 1) (LT s4089 1) (LT s4087 1) (LT s4093 1) (LT s4091 1) (LT s4097 1) (LT s4095 1) (LT s4132 1) (LT s4118 1) (LT s4116 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2358 ms.
Product exploration explored 100000 steps with 50000 reset in 2284 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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) 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 21192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 765 out of 8889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8889/8889 places, 8573/8573 transitions.
Discarding 53 places :
Implicit places reduction removed 53 places
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 8836 transition count 8573
Discarding 257 places :
Symmetric choice reduction at 1 with 257 rule applications. Total rules 310 place count 8579 transition count 8315
Iterating global reduction 1 with 257 rules applied. Total rules applied 567 place count 8579 transition count 8315
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 672 place count 8474 transition count 8060
Iterating global reduction 1 with 105 rules applied. Total rules applied 777 place count 8474 transition count 8060
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 204 rules applied. Total rules applied 981 place count 8372 transition count 7958
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 1032 place count 8321 transition count 7907
Iterating global reduction 2 with 51 rules applied. Total rules applied 1083 place count 8321 transition count 7907
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1084 place count 8320 transition count 7856
Iterating global reduction 2 with 1 rules applied. Total rules applied 1085 place count 8320 transition count 7856
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 1136 place count 8269 transition count 7856
Applied a total of 1136 rules in 6403 ms. Remains 8269 /8889 variables (removed 620) and now considering 7856/8573 (removed 717) transitions.
// Phase 1: matrix 7856 rows 8269 cols
[2023-03-11 12:53:04] [INFO ] Computed 821 place invariants in 154 ms
[2023-03-11 12:53:05] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:53:05] [INFO ] Implicit Places using invariants in 975 ms returned []
[2023-03-11 12:53:05] [INFO ] Invariant cache hit.
[2023-03-11 12:53:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:53:06] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1832 ms to find 0 implicit places.
[2023-03-11 12:53:06] [INFO ] Invariant cache hit.
[2023-03-11 12:53:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:53:07] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8269/8889 places, 7856/8573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9090 ms. Remains : 8269/8889 places, 7856/8573 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (AND (GEQ s4850 1) (GEQ s5564 1)) (AND (GEQ s4993 1) (GEQ s5707 1)) (AND (GEQ s4845 1) (GEQ s5559 1)) (AND (GEQ s4998 1) (GEQ s5712 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 1492 ms.
Product exploration explored 100000 steps with 34 reset in 1563 ms.
Computed a total of 8269 stabilizing places and 7856 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8269 transition count 7856
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 (NOT p0)), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 177 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-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-04 finished in 15438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 408 out of 8889 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8889/8889 places, 8573/8573 transitions.
Graph (complete) has 12198 edges and 8889 vertex of which 7962 are kept as prefixes of interest. Removing 927 places using SCC suffix rule.33 ms
Discarding 927 places :
Also discarding 923 output transitions
Drop transitions removed 923 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 359 places :
Implicit places reduction removed 359 places
Drop transitions removed 4743 transitions
Trivial Post-agglo rules discarded 4743 transitions
Performed 4743 trivial Post agglomeration. Transition count delta: 4743
Iterating post reduction 0 with 5102 rules applied. Total rules applied 5103 place count 7552 transition count 2856
Reduce places removed 4743 places and 0 transitions.
Iterating post reduction 1 with 4743 rules applied. Total rules applied 9846 place count 2809 transition count 2856
Performed 714 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 714 Pre rules applied. Total rules applied 9846 place count 2809 transition count 2142
Deduced a syphon composed of 714 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 1020 places and 0 transitions.
Iterating global reduction 2 with 1734 rules applied. Total rules applied 11580 place count 1789 transition count 2142
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 11733 place count 1789 transition count 1989
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 3 with 153 rules applied. Total rules applied 11886 place count 1636 transition count 1989
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 11886 place count 1636 transition count 1938
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 11988 place count 1585 transition count 1938
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 12243 place count 1330 transition count 1683
Iterating global reduction 4 with 255 rules applied. Total rules applied 12498 place count 1330 transition count 1683
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 12753 place count 1075 transition count 1428
Iterating global reduction 4 with 255 rules applied. Total rules applied 13008 place count 1075 transition count 1428
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 4 with 255 rules applied. Total rules applied 13263 place count 1075 transition count 1173
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 13263 place count 1075 transition count 1122
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 5 with 153 rules applied. Total rules applied 13416 place count 973 transition count 1122
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 5 with 255 rules applied. Total rules applied 13671 place count 820 transition count 1020
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 13722 place count 769 transition count 969
Applied a total of 13722 rules in 495 ms. Remains 769 /8889 variables (removed 8120) and now considering 969/8573 (removed 7604) transitions.
// Phase 1: matrix 969 rows 769 cols
[2023-03-11 12:53:13] [INFO ] Computed 104 place invariants in 6 ms
[2023-03-11 12:53:14] [INFO ] Implicit Places using invariants in 190 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 768/8889 places, 969/8573 transitions.
Applied a total of 0 rules in 19 ms. Remains 768 /768 variables (removed 0) and now considering 969/969 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 707 ms. Remains : 768/8889 places, 969/8573 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s22 1) (GEQ s328 1)) (AND (GEQ s39 1) (GEQ s294 1)) (AND (GEQ s44 1) (GEQ s299 1)) (AND (GEQ s17 1) (GEQ s323 1)) (AND (GEQ s27 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 295 reset in 1176 ms.
Product exploration explored 100000 steps with 296 reset in 1177 ms.
Computed a total of 768 stabilizing places and 969 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 969
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 335 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=41 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 969 rows 768 cols
[2023-03-11 12:53:17] [INFO ] Computed 103 place invariants in 7 ms
[2023-03-11 12:53:24] [INFO ] [Real]Absence check using 0 positive and 103 generalized place invariants in 111 ms returned sat
[2023-03-11 12:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:53:25] [INFO ] [Real]Absence check using state equation in 916 ms returned sat
[2023-03-11 12:53:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:53:32] [INFO ] [Nat]Absence check using 0 positive and 103 generalized place invariants in 173 ms returned sat
[2023-03-11 12:53:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:53:33] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2023-03-11 12:53:33] [INFO ] Computed and/alt/rep : 663/1683/663 causal constraints (skipped 153 transitions) in 56 ms.
[2023-03-11 12:53:37] [INFO ] Added : 309 causal constraints over 62 iterations in 3856 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 408 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 969/969 transitions.
Applied a total of 0 rules in 20 ms. Remains 768 /768 variables (removed 0) and now considering 969/969 (removed 0) transitions.
[2023-03-11 12:53:37] [INFO ] Invariant cache hit.
[2023-03-11 12:53:37] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-11 12:53:37] [INFO ] Invariant cache hit.
[2023-03-11 12:53:37] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-11 12:53:38] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-11 12:53:38] [INFO ] Invariant cache hit.
[2023-03-11 12:53:38] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 960 ms. Remains : 768/768 places, 969/969 transitions.
Computed a total of 768 stabilizing places and 969 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 969
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 314 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=52 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2023-03-11 12:53:39] [INFO ] Invariant cache hit.
[2023-03-11 12:53:46] [INFO ] [Real]Absence check using 0 positive and 103 generalized place invariants in 95 ms returned sat
[2023-03-11 12:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:53:47] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2023-03-11 12:53:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:53:54] [INFO ] [Nat]Absence check using 0 positive and 103 generalized place invariants in 143 ms returned sat
[2023-03-11 12:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:53:55] [INFO ] [Nat]Absence check using state equation in 998 ms returned sat
[2023-03-11 12:53:55] [INFO ] Computed and/alt/rep : 663/1683/663 causal constraints (skipped 153 transitions) in 57 ms.
[2023-03-11 12:53:57] [INFO ] Added : 202 causal constraints over 41 iterations in 2677 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 297 reset in 1148 ms.
Product exploration explored 100000 steps with 295 reset in 1214 ms.
Support contains 408 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 969/969 transitions.
Applied a total of 0 rules in 13 ms. Remains 768 /768 variables (removed 0) and now considering 969/969 (removed 0) transitions.
[2023-03-11 12:54:00] [INFO ] Invariant cache hit.
[2023-03-11 12:54:00] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-11 12:54:00] [INFO ] Invariant cache hit.
[2023-03-11 12:54:00] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-11 12:54:00] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-11 12:54:00] [INFO ] Invariant cache hit.
[2023-03-11 12:54:01] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 944 ms. Remains : 768/768 places, 969/969 transitions.
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06 finished in 48214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 153 out of 8889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8889/8889 places, 8573/8573 transitions.
Discarding 359 places :
Implicit places reduction removed 359 places
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 8530 transition count 8573
Discarding 461 places :
Symmetric choice reduction at 1 with 461 rule applications. Total rules 820 place count 8069 transition count 8111
Iterating global reduction 1 with 461 rules applied. Total rules applied 1281 place count 8069 transition count 8111
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 1641 place count 7709 transition count 7601
Iterating global reduction 1 with 360 rules applied. Total rules applied 2001 place count 7709 transition count 7601
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 204 rules applied. Total rules applied 2205 place count 7607 transition count 7499
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 2562 place count 7250 transition count 7142
Iterating global reduction 2 with 357 rules applied. Total rules applied 2919 place count 7250 transition count 7142
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 3276 place count 6893 transition count 6785
Iterating global reduction 2 with 357 rules applied. Total rules applied 3633 place count 6893 transition count 6785
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3888 place count 6638 transition count 6530
Iterating global reduction 2 with 255 rules applied. Total rules applied 4143 place count 6638 transition count 6530
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4398 place count 6383 transition count 6275
Iterating global reduction 2 with 255 rules applied. Total rules applied 4653 place count 6383 transition count 6275
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4908 place count 6128 transition count 6020
Iterating global reduction 2 with 255 rules applied. Total rules applied 5163 place count 6128 transition count 6020
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5418 place count 5873 transition count 5765
Iterating global reduction 2 with 255 rules applied. Total rules applied 5673 place count 5873 transition count 5765
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5928 place count 5618 transition count 5510
Iterating global reduction 2 with 255 rules applied. Total rules applied 6183 place count 5618 transition count 5510
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6438 place count 5363 transition count 5255
Iterating global reduction 2 with 255 rules applied. Total rules applied 6693 place count 5363 transition count 5255
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6948 place count 5108 transition count 5000
Iterating global reduction 2 with 255 rules applied. Total rules applied 7203 place count 5108 transition count 5000
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7458 place count 4853 transition count 4745
Iterating global reduction 2 with 255 rules applied. Total rules applied 7713 place count 4853 transition count 4745
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7968 place count 4598 transition count 4490
Iterating global reduction 2 with 255 rules applied. Total rules applied 8223 place count 4598 transition count 4490
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8478 place count 4343 transition count 4235
Iterating global reduction 2 with 255 rules applied. Total rules applied 8733 place count 4343 transition count 4235
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 9039 place count 4292 transition count 3980
Applied a total of 9039 rules in 11835 ms. Remains 4292 /8889 variables (removed 4597) and now considering 3980/8573 (removed 4593) transitions.
// Phase 1: matrix 3980 rows 4292 cols
[2023-03-11 12:54:13] [INFO ] Computed 515 place invariants in 44 ms
[2023-03-11 12:54:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:54:14] [INFO ] Implicit Places using invariants in 1133 ms returned [2892]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1136 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4291/8889 places, 3980/8573 transitions.
Applied a total of 0 rules in 363 ms. Remains 4291 /4291 variables (removed 0) and now considering 3980/3980 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13335 ms. Remains : 4291/8889 places, 3980/8573 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s1088 1) (LT s1139 1)) (OR (LT s1078 1) (LT s1129 1)) (OR (LT s1083 1) (LT s1134 1)) (OR (LT s1073 1) (LT s1124 1)) (OR (LT s1081 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2482 ms.
Product exploration explored 100000 steps with 50000 reset in 2511 ms.
Computed a total of 4291 stabilizing places and 3980 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4291 transition count 3980
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 1 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 19580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U (G((G(p1)||X(X(p0))))||((G(p1)||X(X(p0)))&&X((!p2 U (p3||G(!p2)))))))))'
Support contains 3 out of 8889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8889/8889 places, 8573/8573 transitions.
Discarding 359 places :
Implicit places reduction removed 359 places
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 8530 transition count 8573
Discarding 511 places :
Symmetric choice reduction at 1 with 511 rule applications. Total rules 870 place count 8019 transition count 8062
Iterating global reduction 1 with 511 rules applied. Total rules applied 1381 place count 8019 transition count 8062
Discarding 359 places :
Symmetric choice reduction at 1 with 359 rule applications. Total rules 1740 place count 7660 transition count 7603
Iterating global reduction 1 with 359 rules applied. Total rules applied 2099 place count 7660 transition count 7603
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 204 rules applied. Total rules applied 2303 place count 7558 transition count 7501
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 2660 place count 7201 transition count 7144
Iterating global reduction 2 with 357 rules applied. Total rules applied 3017 place count 7201 transition count 7144
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 3374 place count 6844 transition count 6787
Iterating global reduction 2 with 357 rules applied. Total rules applied 3731 place count 6844 transition count 6787
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3986 place count 6589 transition count 6532
Iterating global reduction 2 with 255 rules applied. Total rules applied 4241 place count 6589 transition count 6532
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4496 place count 6334 transition count 6277
Iterating global reduction 2 with 255 rules applied. Total rules applied 4751 place count 6334 transition count 6277
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5006 place count 6079 transition count 6022
Iterating global reduction 2 with 255 rules applied. Total rules applied 5261 place count 6079 transition count 6022
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5516 place count 5824 transition count 5767
Iterating global reduction 2 with 255 rules applied. Total rules applied 5771 place count 5824 transition count 5767
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6026 place count 5569 transition count 5512
Iterating global reduction 2 with 255 rules applied. Total rules applied 6281 place count 5569 transition count 5512
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6536 place count 5314 transition count 5257
Iterating global reduction 2 with 255 rules applied. Total rules applied 6791 place count 5314 transition count 5257
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7046 place count 5059 transition count 5002
Iterating global reduction 2 with 255 rules applied. Total rules applied 7301 place count 5059 transition count 5002
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7556 place count 4804 transition count 4747
Iterating global reduction 2 with 255 rules applied. Total rules applied 7811 place count 4804 transition count 4747
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8066 place count 4549 transition count 4492
Iterating global reduction 2 with 255 rules applied. Total rules applied 8321 place count 4549 transition count 4492
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8576 place count 4294 transition count 4237
Iterating global reduction 2 with 255 rules applied. Total rules applied 8831 place count 4294 transition count 4237
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 9137 place count 4243 transition count 3982
Applied a total of 9137 rules in 12297 ms. Remains 4243 /8889 variables (removed 4646) and now considering 3982/8573 (removed 4591) transitions.
// Phase 1: matrix 3982 rows 4243 cols
[2023-03-11 12:54:33] [INFO ] Computed 515 place invariants in 49 ms
[2023-03-11 12:54:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:54:34] [INFO ] Implicit Places using invariants in 1219 ms returned [1837, 2840]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1226 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4241/8889 places, 3982/8573 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4240 transition count 3981
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4240 transition count 3981
Applied a total of 2 rules in 758 ms. Remains 4240 /4241 variables (removed 1) and now considering 3981/3982 (removed 1) transitions.
// Phase 1: matrix 3981 rows 4240 cols
[2023-03-11 12:54:35] [INFO ] Computed 513 place invariants in 49 ms
[2023-03-11 12:54:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:54:36] [INFO ] Implicit Places using invariants in 1187 ms returned [1804, 2840]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1190 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4238/8889 places, 3981/8573 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4236 transition count 3979
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4236 transition count 3979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 4235 transition count 3977
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 4235 transition count 3977
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 4234 transition count 3975
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 4234 transition count 3975
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 4233 transition count 3974
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 4233 transition count 3974
Applied a total of 10 rules in 1916 ms. Remains 4233 /4238 variables (removed 5) and now considering 3974/3981 (removed 7) transitions.
// Phase 1: matrix 3974 rows 4233 cols
[2023-03-11 12:54:38] [INFO ] Computed 511 place invariants in 58 ms
[2023-03-11 12:54:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:54:39] [INFO ] Implicit Places using invariants in 1220 ms returned [1114, 2840]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1223 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 4231/8889 places, 3974/8573 transitions.
Applied a total of 0 rules in 380 ms. Remains 4231 /4231 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
Finished structural reductions in LTL mode , in 4 iterations and 18993 ms. Remains : 4231/8889 places, 3974/8573 transitions.
Stuttering acceptance computed with spot in 622 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p3) p2 (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p1) (NOT p3) p2), (AND (NOT p1) (NOT p0)), (AND (NOT p3) p2 (NOT p0)), (AND (NOT p1) (NOT p3) p2 (NOT p0)), (NOT p1), (AND (NOT p3) p2), (AND (NOT p1) (NOT p3) p2 p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 9}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 10}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=11 dest: 6}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=11 dest: 12}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=11 dest: 13}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=11 dest: 14}], [{ cond=(NOT p1), acceptance={} source=12 dest: 6}, { cond=p1, acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p3) p2), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={} source=14 dest: 6}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={} source=14 dest: 12}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={} source=14 dest: 13}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=14 dest: 14}]], initial=0, aps=[p1:(LT s4067 1), p3:(AND (LT s1682 1) (NOT (AND (GEQ s1682 1) (GEQ s1956 1)))), p2:(AND (GEQ s1682 1) (GEQ s1956 1)), p0:(LT s1956 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28635 reset in 1494 ms.
Product exploration explored 100000 steps with 28524 reset in 1515 ms.
Computed a total of 4231 stabilizing places and 3974 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4231 transition count 3974
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 p3 (NOT p2) p0), (X p1), true, (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p3)), (F (G p1)), (F (G p3)), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 631 ms. Reduced automaton from 15 states, 36 edges and 4 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3974 rows 4231 cols
[2023-03-11 12:54:46] [INFO ] Computed 509 place invariants in 47 ms
[2023-03-11 12:54:46] [INFO ] [Real]Absence check using 0 positive and 509 generalized place invariants in 172 ms returned sat
[2023-03-11 12:54:49] [INFO ] After 3580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 12:54:50] [INFO ] [Nat]Absence check using 0 positive and 509 generalized place invariants in 177 ms returned sat
[2023-03-11 12:54:53] [INFO ] After 3225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 12:54:54] [INFO ] After 3693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 266 ms.
[2023-03-11 12:54:54] [INFO ] After 4752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1438 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=110 )
Parikh walk visited 2 properties in 52 ms.
Knowledge obtained : [(AND p1 p3 (NOT p2) p0), (X p1), true, (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p3)), (F (G p1)), (F (G p3)), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 13 factoid took 660 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p1), (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 187 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 4231 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4231/4231 places, 3974/3974 transitions.
Applied a total of 0 rules in 369 ms. Remains 4231 /4231 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
[2023-03-11 12:54:55] [INFO ] Invariant cache hit.
[2023-03-11 12:54:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:54:57] [INFO ] Implicit Places using invariants in 1166 ms returned [1077, 2851]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1171 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4229/4231 places, 3974/3974 transitions.
Applied a total of 0 rules in 369 ms. Remains 4229 /4229 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1911 ms. Remains : 4229/4231 places, 3974/3974 transitions.
Computed a total of 4229 stabilizing places and 3974 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4229 transition count 3974
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 151 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), (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 146 ms. (steps per millisecond=68 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3974 rows 4229 cols
[2023-03-11 12:54:58] [INFO ] Computed 507 place invariants in 52 ms
[2023-03-11 12:54:59] [INFO ] [Real]Absence check using 0 positive and 507 generalized place invariants in 168 ms returned sat
[2023-03-11 12:55:02] [INFO ] After 3792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 12:55:03] [INFO ] [Nat]Absence check using 0 positive and 507 generalized place invariants in 172 ms returned sat
[2023-03-11 12:55:06] [INFO ] After 3078ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 12:55:07] [INFO ] After 3541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 257 ms.
[2023-03-11 12:55:07] [INFO ] After 4553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1445 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=111 )
Parikh walk visited 2 properties in 54 ms.
Knowledge obtained : [(AND p1 p0), true, (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p1), (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 213 ms :[true, (NOT p1), (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 198 ms :[true, (NOT p1), (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 25000 reset in 1349 ms.
Product exploration explored 100000 steps with 25000 reset in 1367 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 4229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4229/4229 places, 3974/3974 transitions.
Graph (complete) has 5638 edges and 4229 vertex of which 4029 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.6 ms
Discarding 200 places :
Also discarding 201 output transitions
Drop transitions removed 201 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1375 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1376 rules applied. Total rules applied 1377 place count 4029 transition count 3772
Performed 1125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1125 Pre rules applied. Total rules applied 1377 place count 4029 transition count 3976
Deduced a syphon composed of 2500 places in 2 ms
Iterating global reduction 1 with 1125 rules applied. Total rules applied 2502 place count 4029 transition count 3976
Discarding 1272 places :
Symmetric choice reduction at 1 with 1272 rule applications. Total rules 3774 place count 2757 transition count 2656
Deduced a syphon composed of 1276 places in 1 ms
Iterating global reduction 1 with 1272 rules applied. Total rules applied 5046 place count 2757 transition count 2656
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 5095 place count 2708 transition count 2607
Deduced a syphon composed of 1228 places in 1 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 5144 place count 2708 transition count 2607
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5147 place count 2705 transition count 2603
Deduced a syphon composed of 1226 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 5150 place count 2705 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5151 place count 2704 transition count 2602
Deduced a syphon composed of 1225 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5152 place count 2704 transition count 2602
Performed 405 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1630 places in 1 ms
Iterating global reduction 1 with 405 rules applied. Total rules applied 5557 place count 2704 transition count 2602
Discarding 357 places :
Symmetric choice reduction at 1 with 357 rule applications. Total rules 5914 place count 2347 transition count 2245
Deduced a syphon composed of 1273 places in 1 ms
Iterating global reduction 1 with 357 rules applied. Total rules applied 6271 place count 2347 transition count 2245
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -306
Deduced a syphon composed of 1324 places in 1 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 6322 place count 2347 transition count 2551
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6326 place count 2343 transition count 2539
Deduced a syphon composed of 1320 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 6330 place count 2343 transition count 2539
Performed 50(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1370 places in 1 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 6380 place count 2343 transition count 2639
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 6429 place count 2294 transition count 2541
Deduced a syphon composed of 1321 places in 1 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 6478 place count 2294 transition count 2541
Deduced a syphon composed of 1321 places in 1 ms
Applied a total of 6478 rules in 1663 ms. Remains 2294 /4229 variables (removed 1935) and now considering 2541/3974 (removed 1433) transitions.
[2023-03-11 12:55:13] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 2541 rows 2294 cols
[2023-03-11 12:55:13] [INFO ] Computed 458 place invariants in 32 ms
[2023-03-11 12:55:14] [INFO ] Dead Transitions using invariants and state equation in 1305 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2294/4229 places, 2541/3974 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3025 ms. Remains : 2294/4229 places, 2541/3974 transitions.
Support contains 2 out of 4229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4229/4229 places, 3974/3974 transitions.
Applied a total of 0 rules in 426 ms. Remains 4229 /4229 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
// Phase 1: matrix 3974 rows 4229 cols
[2023-03-11 12:55:14] [INFO ] Computed 507 place invariants in 49 ms
[2023-03-11 12:55:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:55:15] [INFO ] Implicit Places using invariants in 1206 ms returned [1114, 2827]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1209 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4227/4229 places, 3974/3974 transitions.
Applied a total of 0 rules in 384 ms. Remains 4227 /4227 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2019 ms. Remains : 4227/4229 places, 3974/3974 transitions.
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08 finished in 55287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(p1&&X(F(!p2)))||G(F(!p2)))))))'
Support contains 4 out of 8889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8889/8889 places, 8573/8573 transitions.
Discarding 359 places :
Implicit places reduction removed 359 places
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 8530 transition count 8573
Discarding 512 places :
Symmetric choice reduction at 1 with 512 rule applications. Total rules 871 place count 8018 transition count 8060
Iterating global reduction 1 with 512 rules applied. Total rules applied 1383 place count 8018 transition count 8060
Discarding 359 places :
Symmetric choice reduction at 1 with 359 rule applications. Total rules 1742 place count 7659 transition count 7551
Iterating global reduction 1 with 359 rules applied. Total rules applied 2101 place count 7659 transition count 7551
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 204 rules applied. Total rules applied 2305 place count 7557 transition count 7449
Discarding 407 places :
Symmetric choice reduction at 2 with 407 rule applications. Total rules 2712 place count 7150 transition count 7042
Iterating global reduction 2 with 407 rules applied. Total rules applied 3119 place count 7150 transition count 7042
Discarding 356 places :
Symmetric choice reduction at 2 with 356 rule applications. Total rules 3475 place count 6794 transition count 6636
Iterating global reduction 2 with 356 rules applied. Total rules applied 3831 place count 6794 transition count 6636
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 3882 place count 6743 transition count 6636
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 4136 place count 6489 transition count 6382
Iterating global reduction 3 with 254 rules applied. Total rules applied 4390 place count 6489 transition count 6382
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 4644 place count 6235 transition count 6128
Iterating global reduction 3 with 254 rules applied. Total rules applied 4898 place count 6235 transition count 6128
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 5152 place count 5981 transition count 5874
Iterating global reduction 3 with 254 rules applied. Total rules applied 5406 place count 5981 transition count 5874
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 5660 place count 5727 transition count 5620
Iterating global reduction 3 with 254 rules applied. Total rules applied 5914 place count 5727 transition count 5620
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 6168 place count 5473 transition count 5366
Iterating global reduction 3 with 254 rules applied. Total rules applied 6422 place count 5473 transition count 5366
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 6676 place count 5219 transition count 5112
Iterating global reduction 3 with 254 rules applied. Total rules applied 6930 place count 5219 transition count 5112
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 7184 place count 4965 transition count 4858
Iterating global reduction 3 with 254 rules applied. Total rules applied 7438 place count 4965 transition count 4858
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 7692 place count 4711 transition count 4604
Iterating global reduction 3 with 254 rules applied. Total rules applied 7946 place count 4711 transition count 4604
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 8200 place count 4457 transition count 4350
Iterating global reduction 3 with 254 rules applied. Total rules applied 8454 place count 4457 transition count 4350
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 8708 place count 4203 transition count 4096
Iterating global reduction 3 with 254 rules applied. Total rules applied 8962 place count 4203 transition count 4096
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Discarding 50 places :
Implicit places reduction removed 50 places
Iterating post reduction 3 with 304 rules applied. Total rules applied 9266 place count 4153 transition count 3842
Applied a total of 9266 rules in 13499 ms. Remains 4153 /8889 variables (removed 4736) and now considering 3842/8573 (removed 4731) transitions.
// Phase 1: matrix 3842 rows 4153 cols
[2023-03-11 12:55:30] [INFO ] Computed 465 place invariants in 38 ms
[2023-03-11 12:55:31] [INFO ] Implicit Places using invariants in 1099 ms returned [2727, 2754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1101 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4151/8889 places, 3842/8573 transitions.
Applied a total of 0 rules in 396 ms. Remains 4151 /4151 variables (removed 0) and now considering 3842/3842 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14996 ms. Remains : 4151/8889 places, 3842/8573 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LT s3639 1), p0:(AND (GEQ s1701 1) (GEQ s2009 1)), p2:(AND (GEQ s3639 1) (GEQ s1801 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1346 ms.
Product exploration explored 100000 steps with 25000 reset in 1355 ms.
Computed a total of 4151 stabilizing places and 3842 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4151 transition count 3842
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) (NOT p2)), (X (X p1)), (X (X (OR (AND (NOT p0) p2) p1))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p2)))
Knowledge based reduction with 6 factoid took 161 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) 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 19007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 3 out of 8889 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8889/8889 places, 8573/8573 transitions.
Graph (complete) has 12198 edges and 8889 vertex of which 8681 are kept as prefixes of interest. Removing 208 places using SCC suffix rule.9 ms
Discarding 208 places :
Also discarding 209 output transitions
Drop transitions removed 209 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 359 places :
Implicit places reduction removed 359 places
Drop transitions removed 5097 transitions
Trivial Post-agglo rules discarded 5097 transitions
Performed 5097 trivial Post agglomeration. Transition count delta: 5097
Iterating post reduction 0 with 5456 rules applied. Total rules applied 5457 place count 8271 transition count 3216
Reduce places removed 5097 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5098 rules applied. Total rules applied 10555 place count 3174 transition count 3215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10556 place count 3173 transition count 3215
Performed 713 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 713 Pre rules applied. Total rules applied 10556 place count 3173 transition count 2502
Deduced a syphon composed of 713 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 1019 places and 0 transitions.
Iterating global reduction 3 with 1732 rules applied. Total rules applied 12288 place count 2154 transition count 2502
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 12492 place count 2154 transition count 2298
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 12696 place count 1950 transition count 2298
Discarding 559 places :
Symmetric choice reduction at 5 with 559 rule applications. Total rules 13255 place count 1391 transition count 1690
Iterating global reduction 5 with 559 rules applied. Total rules applied 13814 place count 1391 transition count 1690
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 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 5 with 306 rules applied. Total rules applied 14120 place count 1340 transition count 1435
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 6 with 153 rules applied. Total rules applied 14273 place count 1187 transition count 1435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 14273 place count 1187 transition count 1434
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 14275 place count 1186 transition count 1434
Discarding 256 places :
Symmetric choice reduction at 7 with 256 rule applications. Total rules 14531 place count 930 transition count 1078
Iterating global reduction 7 with 256 rules applied. Total rules applied 14787 place count 930 transition count 1078
Ensure Unique test removed 356 transitions
Reduce isomorphic transitions removed 356 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 560 rules applied. Total rules applied 15347 place count 828 transition count 620
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 8 with 102 rules applied. Total rules applied 15449 place count 726 transition count 620
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 15449 place count 726 transition count 519
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 50 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 9 with 252 rules applied. Total rules applied 15701 place count 575 transition count 519
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 9 with 204 rules applied. Total rules applied 15905 place count 473 transition count 417
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 15907 place count 472 transition count 465
Reduce places removed 50 places and 50 transitions.
Iterating global reduction 9 with 50 rules applied. Total rules applied 15957 place count 422 transition count 415
Applied a total of 15957 rules in 305 ms. Remains 422 /8889 variables (removed 8467) and now considering 415/8573 (removed 8158) transitions.
// Phase 1: matrix 415 rows 422 cols
[2023-03-11 12:55:35] [INFO ] Computed 108 place invariants in 5 ms
[2023-03-11 12:55:36] [INFO ] Implicit Places using invariants in 296 ms returned [1, 4, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 369, 370]
Discarding 106 places :
Implicit Place search using SMT only with invariants took 297 ms to find 106 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 316/8889 places, 415/8573 transitions.
Reduce places removed 50 places and 50 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 266 transition count 311
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 212 transition count 311
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 108 place count 212 transition count 260
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 210 place count 161 transition count 260
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 259 place count 112 transition count 162
Iterating global reduction 2 with 49 rules applied. Total rules applied 308 place count 112 transition count 162
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 357 place count 63 transition count 113
Iterating global reduction 2 with 49 rules applied. Total rules applied 406 place count 63 transition count 113
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 455 place count 14 transition count 15
Iterating global reduction 2 with 49 rules applied. Total rules applied 504 place count 14 transition count 15
Applied a total of 504 rules in 8 ms. Remains 14 /316 variables (removed 302) and now considering 15/415 (removed 400) transitions.
// Phase 1: matrix 15 rows 14 cols
[2023-03-11 12:55:36] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 12:55:36] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-11 12:55:36] [INFO ] Invariant cache hit.
[2023-03-11 12:55:36] [INFO ] Implicit Places using invariants and state equation in 25 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/8889 places, 15/8573 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 654 ms. Remains : 13/8889 places, 15/8573 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s4 1), p1:(AND (GEQ s10 1) (GEQ s11 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 16 steps with 1 reset in 1 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-10 finished in 813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 8889 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8889/8889 places, 8573/8573 transitions.
Graph (complete) has 12198 edges and 8889 vertex of which 8686 are kept as prefixes of interest. Removing 203 places using SCC suffix rule.11 ms
Discarding 203 places :
Also discarding 204 output transitions
Drop transitions removed 204 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 359 places :
Implicit places reduction removed 359 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 5509 rules applied. Total rules applied 5510 place count 8276 transition count 3168
Reduce places removed 5150 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5151 rules applied. Total rules applied 10661 place count 3126 transition count 3167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10662 place count 3125 transition count 3167
Performed 709 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 709 Pre rules applied. Total rules applied 10662 place count 3125 transition count 2458
Deduced a syphon composed of 709 places in 1 ms
Ensure Unique test removed 303 places
Reduce places removed 1012 places and 0 transitions.
Iterating global reduction 3 with 1721 rules applied. Total rules applied 12383 place count 2113 transition count 2458
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 3 with 203 rules applied. Total rules applied 12586 place count 2113 transition count 2255
Reduce places removed 203 places and 0 transitions.
Iterating post reduction 4 with 203 rules applied. Total rules applied 12789 place count 1910 transition count 2255
Discarding 560 places :
Symmetric choice reduction at 5 with 560 rule applications. Total rules 13349 place count 1350 transition count 1645
Iterating global reduction 5 with 560 rules applied. Total rules applied 13909 place count 1350 transition count 1645
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 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 5 with 306 rules applied. Total rules applied 14215 place count 1299 transition count 1390
Reduce places removed 153 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 154 rules applied. Total rules applied 14369 place count 1146 transition count 1389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 14370 place count 1145 transition count 1389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 14370 place count 1145 transition count 1388
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 14372 place count 1144 transition count 1388
Discarding 258 places :
Symmetric choice reduction at 8 with 258 rule applications. Total rules 14630 place count 886 transition count 980
Iterating global reduction 8 with 258 rules applied. Total rules applied 14888 place count 886 transition count 980
Ensure Unique test removed 357 transitions
Reduce isomorphic transitions removed 357 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 8 with 562 rules applied. Total rules applied 15450 place count 783 transition count 521
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 9 with 102 rules applied. Total rules applied 15552 place count 681 transition count 521
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 103 Pre rules applied. Total rules applied 15552 place count 681 transition count 418
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 10 with 257 rules applied. Total rules applied 15809 place count 527 transition count 418
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 10 with 206 rules applied. Total rules applied 16015 place count 424 transition count 315
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 10 with 51 rules applied. Total rules applied 16066 place count 373 transition count 264
Applied a total of 16066 rules in 286 ms. Remains 373 /8889 variables (removed 8516) and now considering 264/8573 (removed 8309) transitions.
// Phase 1: matrix 264 rows 373 cols
[2023-03-11 12:55:36] [INFO ] Computed 110 place invariants in 6 ms
[2023-03-11 12:55:36] [INFO ] Implicit Places using invariants in 299 ms returned [4, 56, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 259, 261, 313, 317]
Discarding 106 places :
Implicit Place search using SMT only with invariants took 301 ms to find 106 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 267/8889 places, 264/8573 transitions.
Graph (complete) has 269 edges and 267 vertex of which 216 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.0 ms
Discarding 51 places :
Also discarding 51 output transitions
Drop transitions removed 51 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 165 transition count 112
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 115 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 114 transition count 111
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 103 place count 114 transition count 61
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 203 place count 64 transition count 61
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 251 place count 16 transition count 13
Iterating global reduction 3 with 48 rules applied. Total rules applied 299 place count 16 transition count 13
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 3 with 2 rules applied. Total rules applied 301 place count 15 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 302 place count 14 transition count 11
Applied a total of 302 rules in 5 ms. Remains 14 /267 variables (removed 253) and now considering 11/264 (removed 253) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-11 12:55:36] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 12:55:37] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-11 12:55:37] [INFO ] Invariant cache hit.
[2023-03-11 12:55:37] [INFO ] Implicit Places using invariants and state equation in 22 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/8889 places, 11/8573 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 634 ms. Remains : 13/8889 places, 11/8573 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s7 1), p1:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 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 759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p0||X(p0)))&&G(p1))))'
Support contains 3 out of 8889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8889/8889 places, 8573/8573 transitions.
Discarding 358 places :
Implicit places reduction removed 358 places
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 8531 transition count 8573
Discarding 512 places :
Symmetric choice reduction at 1 with 512 rule applications. Total rules 870 place count 8019 transition count 8060
Iterating global reduction 1 with 512 rules applied. Total rules applied 1382 place count 8019 transition count 8060
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 1742 place count 7659 transition count 7550
Iterating global reduction 1 with 360 rules applied. Total rules applied 2102 place count 7659 transition count 7550
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 204 rules applied. Total rules applied 2306 place count 7557 transition count 7448
Discarding 407 places :
Symmetric choice reduction at 2 with 407 rule applications. Total rules 2713 place count 7150 transition count 7041
Iterating global reduction 2 with 407 rules applied. Total rules applied 3120 place count 7150 transition count 7041
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 3477 place count 6793 transition count 6634
Iterating global reduction 2 with 357 rules applied. Total rules applied 3834 place count 6793 transition count 6634
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 51 rules applied. Total rules applied 3885 place count 6742 transition count 6634
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 4139 place count 6488 transition count 6380
Iterating global reduction 3 with 254 rules applied. Total rules applied 4393 place count 6488 transition count 6380
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 4647 place count 6234 transition count 6126
Iterating global reduction 3 with 254 rules applied. Total rules applied 4901 place count 6234 transition count 6126
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 5155 place count 5980 transition count 5872
Iterating global reduction 3 with 254 rules applied. Total rules applied 5409 place count 5980 transition count 5872
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 5663 place count 5726 transition count 5618
Iterating global reduction 3 with 254 rules applied. Total rules applied 5917 place count 5726 transition count 5618
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 6171 place count 5472 transition count 5364
Iterating global reduction 3 with 254 rules applied. Total rules applied 6425 place count 5472 transition count 5364
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 6679 place count 5218 transition count 5110
Iterating global reduction 3 with 254 rules applied. Total rules applied 6933 place count 5218 transition count 5110
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 7187 place count 4964 transition count 4856
Iterating global reduction 3 with 254 rules applied. Total rules applied 7441 place count 4964 transition count 4856
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 7695 place count 4710 transition count 4602
Iterating global reduction 3 with 254 rules applied. Total rules applied 7949 place count 4710 transition count 4602
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 8203 place count 4456 transition count 4348
Iterating global reduction 3 with 254 rules applied. Total rules applied 8457 place count 4456 transition count 4348
Discarding 254 places :
Symmetric choice reduction at 3 with 254 rule applications. Total rules 8711 place count 4202 transition count 4094
Iterating global reduction 3 with 254 rules applied. Total rules applied 8965 place count 4202 transition count 4094
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Discarding 50 places :
Implicit places reduction removed 50 places
Iterating post reduction 3 with 304 rules applied. Total rules applied 9269 place count 4152 transition count 3840
Applied a total of 9269 rules in 13433 ms. Remains 4152 /8889 variables (removed 4737) and now considering 3840/8573 (removed 4733) transitions.
// Phase 1: matrix 3840 rows 4152 cols
[2023-03-11 12:55:50] [INFO ] Computed 466 place invariants in 41 ms
[2023-03-11 12:55:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:55:51] [INFO ] Implicit Places using invariants in 1093 ms returned [1723, 2751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1096 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4150/8889 places, 3840/8573 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4149 transition count 3839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4149 transition count 3839
Applied a total of 2 rules in 857 ms. Remains 4149 /4150 variables (removed 1) and now considering 3839/3840 (removed 1) transitions.
// Phase 1: matrix 3839 rows 4149 cols
[2023-03-11 12:55:52] [INFO ] Computed 464 place invariants in 49 ms
[2023-03-11 12:55:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 12:55:53] [INFO ] Implicit Places using invariants in 1142 ms returned [2744, 2751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1145 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4147/8889 places, 3839/8573 transitions.
Applied a total of 0 rules in 420 ms. Remains 4147 /4147 variables (removed 0) and now considering 3839/3839 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 16954 ms. Remains : 4147/8889 places, 3839/8573 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1491 1) (GEQ s1648 1)), p0:(GEQ s2769 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2924 steps with 0 reset in 26 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-13 finished in 17215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U (G((G(p1)||X(X(p0))))||((G(p1)||X(X(p0)))&&X((!p2 U (p3||G(!p2)))))))))'
[2023-03-11 12:55:54] [INFO ] Flatten gal took : 213 ms
[2023-03-11 12:55:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-11 12:55:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8889 places, 8573 transitions and 21076 arcs took 31 ms.
Total runtime 253294 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1341/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1785 seconds
MemTotal: 16393216 kB
MemFree: 3489316 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16066444 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1341/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08

BK_STOP 1678541151160

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-06
ltl formula formula --ltl=/tmp/1341/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 8889 places, 8573 transitions and 21076 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.690 real 0.190 user 0.290 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1341/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1341/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1341/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1341/ltl_0_
Killing (15) : 1347 1348 1349 1350 1351
Killing (9) : 1347 1348 1349 1350 1351
ltl formula name FamilyReunion-PT-L00050M0005C002P002G001-LTLFireability-08
ltl formula formula --ltl=/tmp/1341/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 8889 places, 8573 transitions and 21076 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.640 real 0.260 user 0.200 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1341/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1341/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1341/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1341/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 19 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
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 r169-tall-167838855800412"
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 ;