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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 152M
-rw-r--r-- 1 mcc users 1.4M Feb 26 17:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.4M Feb 26 17:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7M Feb 26 15:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 13M Feb 26 15:55 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 608K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1018K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9M Feb 26 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17M Feb 26 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0M Feb 26 20:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32M Feb 26 20:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 126K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 367K 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 62M 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-L00200M0020C010P010G005-LTLCardinality-00
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-01
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-02
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-03
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-04
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-05
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-06
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-07
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-08
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-09
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-10
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-11
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-12
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-13
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-14
FORMULA_NAME FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678544334741

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00200M0020C010P010G005
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 14:18:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 14:18:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 14:18:58] [INFO ] Load time of PNML (sax parser for PT used): 1847 ms
[2023-03-11 14:18:58] [INFO ] Transformed 143908 places.
[2023-03-11 14:18:59] [INFO ] Transformed 134279 transitions.
[2023-03-11 14:18:59] [INFO ] Parsed PT model containing 143908 places and 134279 transitions and 411469 arcs in 2918 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 43214 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 56 places and 0 transitions.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19914 out of 143852 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143852/143852 places, 134279/134279 transitions.
Reduce places removed 674 places and 0 transitions.
Discarding 25325 places :
Implicit places reduction removed 25325 places
Iterating post reduction 0 with 25999 rules applied. Total rules applied 25999 place count 117853 transition count 134279
Applied a total of 25999 rules in 8184 ms. Remains 117853 /143852 variables (removed 25999) and now considering 134279/134279 (removed 0) transitions.
// Phase 1: matrix 134279 rows 117853 cols
[2023-03-11 14:20:14] [INFO ] Computed 4830 place invariants in 21523 ms
[2023-03-11 14:20:22] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:20:22] [INFO ] Implicit Places using invariants in 30406 ms returned []
Implicit Place search using SMT only with invariants took 30431 ms to find 0 implicit places.
[2023-03-11 14:20:22] [INFO ] Invariant cache hit.
[2023-03-11 14:20:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:20:31] [INFO ] Dead Transitions using invariants and state equation in 8301 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117853/143852 places, 134279/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46940 ms. Remains : 117853/143852 places, 134279/134279 transitions.
Support contains 19914 out of 117853 places after structural reductions.
[2023-03-11 14:20:36] [INFO ] Flatten gal took : 3676 ms
[2023-03-11 14:20:39] [INFO ] Flatten gal took : 3404 ms
[2023-03-11 14:20:47] [INFO ] Input system was already deterministic with 134279 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2464 ms. (steps per millisecond=4 ) properties (out of 22) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 855 ms. (steps per millisecond=11 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 942 ms. (steps per millisecond=10 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 842 ms. (steps per millisecond=11 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-11 14:20:55] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2347)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 14:21:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 14:21:20] [INFO ] After 25047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10865 out of 117853 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Graph (complete) has 172862 edges and 117853 vertex of which 116636 are kept as prefixes of interest. Removing 1217 places using SCC suffix rule.193 ms
Discarding 1217 places :
Also discarding 1016 output transitions
Drop transitions removed 1016 transitions
Ensure Unique test removed 1206 transitions
Reduce isomorphic transitions removed 1206 transitions.
Drop transitions removed 65915 transitions
Trivial Post-agglo rules discarded 65915 transitions
Performed 65915 trivial Post agglomeration. Transition count delta: 65915
Iterating post reduction 0 with 67121 rules applied. Total rules applied 67122 place count 116636 transition count 66142
Reduce places removed 65915 places and 0 transitions.
Performed 1608 Post agglomeration using F-continuation condition.Transition count delta: 1608
Iterating post reduction 1 with 67523 rules applied. Total rules applied 134645 place count 50721 transition count 64534
Reduce places removed 1608 places and 0 transitions.
Iterating post reduction 2 with 1608 rules applied. Total rules applied 136253 place count 49113 transition count 64534
Performed 3217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3217 Pre rules applied. Total rules applied 136253 place count 49113 transition count 61317
Deduced a syphon composed of 3217 places in 57 ms
Ensure Unique test removed 403 places
Reduce places removed 3620 places and 0 transitions.
Iterating global reduction 3 with 6837 rules applied. Total rules applied 143090 place count 45493 transition count 61317
Discarding 2412 places :
Implicit places reduction removed 2412 places
Performed 2211 Post agglomeration using F-continuation condition.Transition count delta: 2211
Iterating post reduction 3 with 4623 rules applied. Total rules applied 147713 place count 43081 transition count 59106
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 149924 place count 40870 transition count 59106
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 200 Pre rules applied. Total rules applied 149924 place count 40870 transition count 58906
Deduced a syphon composed of 200 places in 57 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 5 with 400 rules applied. Total rules applied 150324 place count 40670 transition count 58906
Performed 5627 Post agglomeration using F-continuation condition.Transition count delta: 5627
Deduced a syphon composed of 5627 places in 34 ms
Reduce places removed 5627 places and 0 transitions.
Iterating global reduction 5 with 11254 rules applied. Total rules applied 161578 place count 35043 transition count 53279
Free-agglomeration rule (complex) applied 4625 times.
Iterating global reduction 5 with 4625 rules applied. Total rules applied 166203 place count 35043 transition count 53654
Ensure Unique test removed 401 places
Reduce places removed 5026 places and 0 transitions.
Iterating post reduction 5 with 5026 rules applied. Total rules applied 171229 place count 30017 transition count 53654
Discarding 1019 places :
Symmetric choice reduction at 6 with 1019 rule applications. Total rules 172248 place count 28998 transition count 43835
Iterating global reduction 6 with 1019 rules applied. Total rules applied 173267 place count 28998 transition count 43835
Applied a total of 173267 rules in 33548 ms. Remains 28998 /117853 variables (removed 88855) and now considering 43835/134279 (removed 90444) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33550 ms. Remains : 28998/117853 places, 43835/134279 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 978 ms. (steps per millisecond=10 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 43835 rows 28998 cols
[2023-03-11 14:21:57] [INFO ] Computed 1413 place invariants in 2703 ms
[2023-03-11 14:22:03] [INFO ] After 5527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 14:22:11] [INFO ] [Nat]Absence check using 0 positive and 1413 generalized place invariants in 2480 ms returned sat
[2023-03-11 14:22:28] [INFO ] After 14725ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 14:22:28] [INFO ] After 14782ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-11 14:22:28] [INFO ] After 25095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 28998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28998/28998 places, 43835/43835 transitions.
Graph (complete) has 71394 edges and 28998 vertex of which 27384 are kept as prefixes of interest. Removing 1614 places using SCC suffix rule.18 ms
Discarding 1614 places :
Also discarding 2205 output transitions
Drop transitions removed 2205 transitions
Drop transitions removed 1209 transitions
Reduce isomorphic transitions removed 1209 transitions.
Drop transitions removed 6824 transitions
Trivial Post-agglo rules discarded 6824 transitions
Performed 6824 trivial Post agglomeration. Transition count delta: 6824
Iterating post reduction 0 with 8033 rules applied. Total rules applied 8034 place count 27384 transition count 33597
Reduce places removed 6824 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 6835 rules applied. Total rules applied 14869 place count 20560 transition count 33586
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 14880 place count 20549 transition count 33586
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14880 place count 20549 transition count 33583
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14886 place count 20546 transition count 33583
Performed 2412 Post agglomeration using F-continuation condition.Transition count delta: 2412
Deduced a syphon composed of 2412 places in 17 ms
Reduce places removed 2412 places and 0 transitions.
Iterating global reduction 3 with 4824 rules applied. Total rules applied 19710 place count 18134 transition count 31171
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -909
Deduced a syphon composed of 101 places in 16 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 19912 place count 18033 transition count 32080
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -891
Deduced a syphon composed of 99 places in 17 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 20110 place count 17934 transition count 32971
Free-agglomeration rule (complex) applied 5024 times.
Iterating global reduction 3 with 5024 rules applied. Total rules applied 25134 place count 17934 transition count 67917
Ensure Unique test removed 401 places
Reduce places removed 5425 places and 0 transitions.
Iterating post reduction 3 with 5425 rules applied. Total rules applied 30559 place count 12509 transition count 67917
Discarding 10066 places :
Symmetric choice reduction at 4 with 10066 rule applications. Total rules 40625 place count 2443 transition count 13891
Ensure Unique test removed 603 places
Iterating global reduction 4 with 10669 rules applied. Total rules applied 51294 place count 1840 transition count 13891
Ensure Unique test removed 11856 transitions
Reduce isomorphic transitions removed 11856 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 11858 rules applied. Total rules applied 63152 place count 1839 transition count 2034
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 63153 place count 1838 transition count 2034
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 203 Pre rules applied. Total rules applied 63153 place count 1838 transition count 1831
Deduced a syphon composed of 203 places in 1 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 6 with 406 rules applied. Total rules applied 63559 place count 1635 transition count 1831
Discarding 197 places :
Symmetric choice reduction at 6 with 197 rule applications. Total rules 63756 place count 1438 transition count 1634
Iterating global reduction 6 with 197 rules applied. Total rules applied 63953 place count 1438 transition count 1634
Discarding 196 places :
Symmetric choice reduction at 6 with 196 rule applications. Total rules 64149 place count 1242 transition count 1438
Iterating global reduction 6 with 196 rules applied. Total rules applied 64345 place count 1242 transition count 1438
Discarding 194 places :
Symmetric choice reduction at 6 with 194 rule applications. Total rules 64539 place count 1048 transition count 1244
Iterating global reduction 6 with 194 rules applied. Total rules applied 64733 place count 1048 transition count 1244
Discarding 193 places :
Symmetric choice reduction at 6 with 193 rule applications. Total rules 64926 place count 855 transition count 858
Iterating global reduction 6 with 193 rules applied. Total rules applied 65119 place count 855 transition count 858
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 65133 place count 848 transition count 851
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 65134 place count 848 transition count 850
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 65135 place count 847 transition count 850
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 65140 place count 847 transition count 850
Applied a total of 65140 rules in 12536 ms. Remains 847 /28998 variables (removed 28151) and now considering 850/43835 (removed 42985) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12536 ms. Remains : 847/28998 places, 850/43835 transitions.
Computed a total of 117853 stabilizing places and 134279 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 117853 transition count 134279
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' '!(G(F(p0)))'
Support contains 402 out of 117853 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Graph (complete) has 172862 edges and 117853 vertex of which 112409 are kept as prefixes of interest. Removing 5444 places using SCC suffix rule.195 ms
Discarding 5444 places :
Also discarding 7247 output transitions
Drop transitions removed 7247 transitions
Reduce places removed 201 places and 201 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 70752 transitions
Trivial Post-agglo rules discarded 70752 transitions
Performed 70752 trivial Post agglomeration. Transition count delta: 70752
Iterating post reduction 0 with 70753 rules applied. Total rules applied 70754 place count 112207 transition count 56079
Reduce places removed 70752 places and 0 transitions.
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Iterating post reduction 1 with 70953 rules applied. Total rules applied 141707 place count 41455 transition count 55878
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 2 with 201 rules applied. Total rules applied 141908 place count 41254 transition count 55878
Performed 5427 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5427 Pre rules applied. Total rules applied 141908 place count 41254 transition count 50451
Deduced a syphon composed of 5427 places in 28 ms
Ensure Unique test removed 2613 places
Reduce places removed 8040 places and 0 transitions.
Iterating global reduction 3 with 13467 rules applied. Total rules applied 155375 place count 33214 transition count 50451
Discarding 201 places :
Implicit places reduction removed 201 places
Drop transitions removed 2211 transitions
Trivial Post-agglo rules discarded 2211 transitions
Performed 2211 trivial Post agglomeration. Transition count delta: 2211
Iterating post reduction 3 with 2412 rules applied. Total rules applied 157787 place count 33013 transition count 48240
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 159998 place count 30802 transition count 48240
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 159998 place count 30802 transition count 48039
Deduced a syphon composed of 201 places in 23 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 160400 place count 30601 transition count 48039
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 160405 place count 30596 transition count 47034
Iterating global reduction 5 with 5 rules applied. Total rules applied 160410 place count 30596 transition count 47034
Performed 5427 Post agglomeration using F-continuation condition.Transition count delta: 5427
Deduced a syphon composed of 5427 places in 18 ms
Reduce places removed 5427 places and 0 transitions.
Iterating global reduction 5 with 10854 rules applied. Total rules applied 171264 place count 25169 transition count 41607
Applied a total of 171264 rules in 16748 ms. Remains 25169 /117853 variables (removed 92684) and now considering 41607/134279 (removed 92672) transitions.
// Phase 1: matrix 41607 rows 25169 cols
[2023-03-11 14:23:00] [INFO ] Computed 1612 place invariants in 2117 ms
[2023-03-11 14:23:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:23:02] [INFO ] Implicit Places using invariants in 4121 ms returned []
Implicit Place search using SMT only with invariants took 4123 ms to find 0 implicit places.
[2023-03-11 14:23:02] [INFO ] Invariant cache hit.
[2023-03-11 14:23:04] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:23:04] [INFO ] Dead Transitions using invariants and state equation in 1877 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25169/117853 places, 41607/134279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22752 ms. Remains : 25169/117853 places, 41607/134279 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], 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 118 reset in 9273 ms.
Product exploration explored 100000 steps with 120 reset in 9432 ms.
Computed a total of 25169 stabilizing places and 41607 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25169 transition count 41607
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)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 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 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 710 steps, including 0 resets, run visited all 1 properties in 70 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 141 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2023-03-11 14:24:21] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 402 out of 25169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25169/25169 places, 41607/41607 transitions.
Applied a total of 0 rules in 1217 ms. Remains 25169 /25169 variables (removed 0) and now considering 41607/41607 (removed 0) transitions.
[2023-03-11 14:24:37] [INFO ] Invariant cache hit.
[2023-03-11 14:24:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:24:39] [INFO ] Implicit Places using invariants in 2256 ms returned []
Implicit Place search using SMT only with invariants took 2258 ms to find 0 implicit places.
[2023-03-11 14:24:40] [INFO ] Invariant cache hit.
[2023-03-11 14:24:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:24:42] [INFO ] Dead Transitions using invariants and state equation in 2240 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5719 ms. Remains : 25169/25169 places, 41607/41607 transitions.
Computed a total of 25169 stabilizing places and 41607 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25169 transition count 41607
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)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 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 798 steps, including 0 resets, run visited all 1 properties in 80 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 129 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2023-03-11 14:25:45] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 122 reset in 9225 ms.
Product exploration timeout after 95220 steps with 114 reset in 10001 ms.
Support contains 402 out of 25169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25169/25169 places, 41607/41607 transitions.
Applied a total of 0 rules in 1189 ms. Remains 25169 /25169 variables (removed 0) and now considering 41607/41607 (removed 0) transitions.
[2023-03-11 14:26:21] [INFO ] Invariant cache hit.
[2023-03-11 14:26:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:26:23] [INFO ] Implicit Places using invariants in 2219 ms returned []
Implicit Place search using SMT only with invariants took 2221 ms to find 0 implicit places.
[2023-03-11 14:26:23] [INFO ] Invariant cache hit.
[2023-03-11 14:26:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:26:25] [INFO ] Dead Transitions using invariants and state equation in 2190 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5604 ms. Remains : 25169/25169 places, 41607/41607 transitions.
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-01 finished in 229066 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((p0 U G(p1))))'
Support contains 1407 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Applied a total of 1 rules in 2126 ms. Remains 117852 /117853 variables (removed 1) and now considering 134279/134279 (removed 0) transitions.
// Phase 1: matrix 134279 rows 117852 cols
[2023-03-11 14:26:57] [INFO ] Computed 4829 place invariants in 24180 ms
[2023-03-11 14:27:05] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:27:05] [INFO ] Implicit Places using invariants in 32497 ms returned []
Implicit Place search using SMT only with invariants took 32498 ms to find 0 implicit places.
[2023-03-11 14:27:05] [INFO ] Invariant cache hit.
[2023-03-11 14:27:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:27:14] [INFO ] Dead Transitions using invariants and state equation in 8369 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117852/117853 places, 134279/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42999 ms. Remains : 117852/117853 places, 134279/134279 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 2 (ADD s74212 s74214 s74215 s74216 s74217 s74218 s74219 s74220 s74221 s74222 s74223 s74224 s74225 s74226 s74227 s74228 s74229 s74230 s74231 s74232 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20714 steps with 1 reset in 2347 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-03 finished in 46054 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((p0||X((G((p1||X(G(p1)))) U (p0&&G((p1||X(G(p1))))))))))'
Support contains 8643 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Discarding 1005 places :
Symmetric choice reduction at 1 with 1005 rule applications. Total rules 1006 place count 116847 transition count 132269
Iterating global reduction 1 with 1005 rules applied. Total rules applied 2011 place count 116847 transition count 132269
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 2016 place count 116842 transition count 131264
Iterating global reduction 1 with 5 rules applied. Total rules applied 2021 place count 116842 transition count 131264
Applied a total of 2021 rules in 5406 ms. Remains 116842 /117853 variables (removed 1011) and now considering 131264/134279 (removed 3015) transitions.
// Phase 1: matrix 131264 rows 116842 cols
[2023-03-11 14:27:44] [INFO ] Computed 4829 place invariants in 22020 ms
[2023-03-11 14:27:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:27:53] [INFO ] Implicit Places using invariants in 31217 ms returned []
Implicit Place search using SMT only with invariants took 31218 ms to find 0 implicit places.
[2023-03-11 14:27:53] [INFO ] Invariant cache hit.
[2023-03-11 14:28:01] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:28:01] [INFO ] Dead Transitions using invariants and state equation in 8197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116842/117853 places, 131264/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44826 ms. Remains : 116842/117853 places, 131264/134279 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 (ADD s55688 s55689 s55690 s55691 s55692 s55693 s55694 s55695 s55696 s55697 s55698 s55699 s55700 s55701 s55702 s55703 s55704 s55705 s55706 s55707...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7628 steps with 0 reset in 2132 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-04 finished in 47662 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' '!(((!p0&&G((p1 U p2))) U G(p3)))'
Support contains 5025 out of 117853 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Graph (complete) has 172862 edges and 117853 vertex of which 104553 are kept as prefixes of interest. Removing 13300 places using SCC suffix rule.164 ms
Discarding 13300 places :
Also discarding 17699 output transitions
Drop transitions removed 17699 transitions
Reduce places removed 201 places and 201 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 66129 transitions
Trivial Post-agglo rules discarded 66129 transitions
Performed 66129 trivial Post agglomeration. Transition count delta: 66129
Iterating post reduction 0 with 66130 rules applied. Total rules applied 66131 place count 104351 transition count 50250
Reduce places removed 66129 places and 0 transitions.
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Iterating post reduction 1 with 66330 rules applied. Total rules applied 132461 place count 38222 transition count 50049
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 2 with 201 rules applied. Total rules applied 132662 place count 38021 transition count 50049
Performed 3417 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3417 Pre rules applied. Total rules applied 132662 place count 38021 transition count 46632
Deduced a syphon composed of 3417 places in 28 ms
Ensure Unique test removed 603 places
Reduce places removed 4020 places and 0 transitions.
Iterating global reduction 3 with 7437 rules applied. Total rules applied 140099 place count 34001 transition count 46632
Discarding 2211 places :
Implicit places reduction removed 2211 places
Performed 2211 Post agglomeration using F-continuation condition.Transition count delta: 2211
Iterating post reduction 3 with 4422 rules applied. Total rules applied 144521 place count 31790 transition count 44421
Reduce places removed 2211 places and 0 transitions.
Iterating post reduction 4 with 2211 rules applied. Total rules applied 146732 place count 29579 transition count 44421
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 146732 place count 29579 transition count 44220
Deduced a syphon composed of 201 places in 30 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 147134 place count 29378 transition count 44220
Performed 5025 Post agglomeration using F-continuation condition.Transition count delta: 5025
Deduced a syphon composed of 5025 places in 25 ms
Reduce places removed 5025 places and 0 transitions.
Iterating global reduction 5 with 10050 rules applied. Total rules applied 157184 place count 24353 transition count 39195
Applied a total of 157184 rules in 17166 ms. Remains 24353 /117853 variables (removed 93500) and now considering 39195/134279 (removed 95084) transitions.
// Phase 1: matrix 39195 rows 24353 cols
[2023-03-11 14:28:23] [INFO ] Computed 1208 place invariants in 1862 ms
[2023-03-11 14:28:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:28:26] [INFO ] Implicit Places using invariants in 4061 ms returned []
Implicit Place search using SMT only with invariants took 4062 ms to find 0 implicit places.
[2023-03-11 14:28:26] [INFO ] Invariant cache hit.
[2023-03-11 14:28:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:28:27] [INFO ] Dead Transitions using invariants and state equation in 1913 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24353/117853 places, 39195/134279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23146 ms. Remains : 24353/117853 places, 39195/134279 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p3), true, (NOT p2), (NOT p2), (NOT p3)]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 (NOT p0) p2) (AND p3 (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p3 p0) (AND p3 (NOT p2) (NOT p1))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(OR (LEQ (ADD s11679 s11680 s11681 s11682 s11683 s11684 s11685 s11686 s11687 s11688 s11689 s11690 s11691 s11692 s11693 s11694 s11695 s11696 s11697 s116...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 275 steps with 0 reset in 53 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-05 finished in 23576 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((p1&&X((p1 U (p2||G(p1)))))))))'
Support contains 6633 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Discarding 1005 places :
Symmetric choice reduction at 1 with 1005 rule applications. Total rules 1006 place count 116847 transition count 132269
Iterating global reduction 1 with 1005 rules applied. Total rules applied 2011 place count 116847 transition count 132269
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 2016 place count 116842 transition count 131264
Iterating global reduction 1 with 5 rules applied. Total rules applied 2021 place count 116842 transition count 131264
Applied a total of 2021 rules in 5903 ms. Remains 116842 /117853 variables (removed 1011) and now considering 131264/134279 (removed 3015) transitions.
// Phase 1: matrix 131264 rows 116842 cols
[2023-03-11 14:29:06] [INFO ] Computed 4829 place invariants in 31834 ms
[2023-03-11 14:29:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:29:14] [INFO ] Implicit Places using invariants in 40033 ms returned []
Implicit Place search using SMT only with invariants took 40034 ms to find 0 implicit places.
[2023-03-11 14:29:14] [INFO ] Invariant cache hit.
[2023-03-11 14:29:22] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:29:22] [INFO ] Dead Transitions using invariants and state equation in 8225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116842/117853 places, 131264/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54169 ms. Remains : 116842/117853 places, 131264/134279 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-07 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=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 (ADD s51467 s51468 s51469 s51470 s51471 s51472 s51473 s51474 s51475 s51476 s51477 s51478 s51479 s51480 s51481 s51482 s51483 s51484 s51485 s51486 ...], 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 timeout after 17700 steps with 5941 reset in 10001 ms.
Product exploration timeout after 19080 steps with 6327 reset in 10002 ms.
Computed a total of 116842 stabilizing places and 131264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116842 transition count 131264
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)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 632 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1613 ms. (steps per millisecond=6 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 14:30:13] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2347)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 14:30:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 14:30:38] [INFO ] After 25056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2412 out of 116842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116842/116842 places, 131264/131264 transitions.
Graph (complete) has 168840 edges and 116842 vertex of which 109990 are kept as prefixes of interest. Removing 6852 places using SCC suffix rule.59 ms
Discarding 6852 places :
Also discarding 7649 output transitions
Drop transitions removed 7649 transitions
Drop transitions removed 66531 transitions
Trivial Post-agglo rules discarded 66531 transitions
Performed 66531 trivial Post agglomeration. Transition count delta: 66531
Iterating post reduction 0 with 66531 rules applied. Total rules applied 66532 place count 109990 transition count 57084
Reduce places removed 66531 places and 0 transitions.
Performed 4221 Post agglomeration using F-continuation condition.Transition count delta: 4221
Iterating post reduction 1 with 70752 rules applied. Total rules applied 137284 place count 43459 transition count 52863
Reduce places removed 4221 places and 0 transitions.
Iterating post reduction 2 with 4221 rules applied. Total rules applied 141505 place count 39238 transition count 52863
Performed 5829 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5829 Pre rules applied. Total rules applied 141505 place count 39238 transition count 47034
Deduced a syphon composed of 5829 places in 33 ms
Ensure Unique test removed 2814 places
Reduce places removed 8643 places and 0 transitions.
Iterating global reduction 3 with 14472 rules applied. Total rules applied 155977 place count 30595 transition count 47034
Drop transitions removed 2412 transitions
Trivial Post-agglo rules discarded 2412 transitions
Performed 2412 trivial Post agglomeration. Transition count delta: 2412
Iterating post reduction 3 with 2412 rules applied. Total rules applied 158389 place count 30595 transition count 44622
Reduce places removed 2412 places and 0 transitions.
Iterating post reduction 4 with 2412 rules applied. Total rules applied 160801 place count 28183 transition count 44622
Performed 1407 Post agglomeration using F-continuation condition.Transition count delta: 1407
Deduced a syphon composed of 1407 places in 28 ms
Reduce places removed 1407 places and 0 transitions.
Iterating global reduction 5 with 2814 rules applied. Total rules applied 163615 place count 26776 transition count 43215
Free-agglomeration rule applied 2211 times.
Iterating global reduction 5 with 2211 rules applied. Total rules applied 165826 place count 26776 transition count 41004
Ensure Unique test removed 201 places
Reduce places removed 2412 places and 0 transitions.
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Iterating post reduction 5 with 4422 rules applied. Total rules applied 170248 place count 24364 transition count 38994
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 201 Pre rules applied. Total rules applied 170248 place count 24364 transition count 38793
Deduced a syphon composed of 201 places in 21 ms
Ensure Unique test removed 201 places
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 6 with 603 rules applied. Total rules applied 170851 place count 23962 transition count 38793
Free-agglomeration rule (complex) applied 2613 times.
Iterating global reduction 6 with 2613 rules applied. Total rules applied 173464 place count 23962 transition count 96480
Ensure Unique test removed 201 places
Reduce places removed 2814 places and 0 transitions.
Iterating post reduction 6 with 2814 rules applied. Total rules applied 176278 place count 21148 transition count 96480
Discarding 4030 places :
Symmetric choice reduction at 7 with 4030 rule applications. Total rules 180308 place count 17118 transition count 30150
Iterating global reduction 7 with 4030 rules applied. Total rules applied 184338 place count 17118 transition count 30150
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 184358 place count 17098 transition count 26130
Iterating global reduction 7 with 20 rules applied. Total rules applied 184378 place count 17098 transition count 26130
Free-agglomeration rule (complex) applied 201 times.
Iterating global reduction 7 with 201 rules applied. Total rules applied 184579 place count 17098 transition count 46029
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 7 with 201 rules applied. Total rules applied 184780 place count 16897 transition count 46029
Discarding 2010 places :
Symmetric choice reduction at 8 with 2010 rule applications. Total rules 186790 place count 14887 transition count 23919
Ensure Unique test removed 201 places
Iterating global reduction 8 with 2211 rules applied. Total rules applied 189001 place count 14686 transition count 23919
Ensure Unique test removed 2010 transitions
Reduce isomorphic transitions removed 2010 transitions.
Iterating post reduction 8 with 2010 rules applied. Total rules applied 191011 place count 14686 transition count 21909
Applied a total of 191011 rules in 52918 ms. Remains 14686 /116842 variables (removed 102156) and now considering 21909/131264 (removed 109355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52918 ms. Remains : 14686/116842 places, 21909/131264 transitions.
Finished random walk after 1765 steps, including 0 resets, run visited all 2 properties in 216 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (NOT (AND p0 p2 p1))), (F (AND (NOT p2) p1)), (F (NOT p0)), (F (AND (NOT p0) p2 p1)), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 675 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 6 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Support contains 6633 out of 116842 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116842/116842 places, 131264/131264 transitions.
Graph (complete) has 168840 edges and 116842 vertex of which 109990 are kept as prefixes of interest. Removing 6852 places using SCC suffix rule.128 ms
Discarding 6852 places :
Also discarding 7649 output transitions
Drop transitions removed 7649 transitions
Reduce places removed 201 places and 201 transitions.
Drop transitions removed 53868 transitions
Trivial Post-agglo rules discarded 53868 transitions
Performed 53868 trivial Post agglomeration. Transition count delta: 53868
Iterating post reduction 0 with 53868 rules applied. Total rules applied 53869 place count 109789 transition count 69546
Reduce places removed 53868 places and 0 transitions.
Performed 8442 Post agglomeration using F-continuation condition.Transition count delta: 8442
Iterating post reduction 1 with 62310 rules applied. Total rules applied 116179 place count 55921 transition count 61104
Reduce places removed 8442 places and 0 transitions.
Iterating post reduction 2 with 8442 rules applied. Total rules applied 124621 place count 47479 transition count 61104
Performed 5829 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5829 Pre rules applied. Total rules applied 124621 place count 47479 transition count 55275
Deduced a syphon composed of 5829 places in 41 ms
Ensure Unique test removed 2814 places
Reduce places removed 8643 places and 0 transitions.
Iterating global reduction 3 with 14472 rules applied. Total rules applied 139093 place count 38836 transition count 55275
Drop transitions removed 2412 transitions
Trivial Post-agglo rules discarded 2412 transitions
Performed 2412 trivial Post agglomeration. Transition count delta: 2412
Iterating post reduction 3 with 2412 rules applied. Total rules applied 141505 place count 38836 transition count 52863
Reduce places removed 2412 places and 0 transitions.
Iterating post reduction 4 with 2412 rules applied. Total rules applied 143917 place count 36424 transition count 52863
Performed 1206 Post agglomeration using F-continuation condition.Transition count delta: 1206
Deduced a syphon composed of 1206 places in 40 ms
Reduce places removed 1206 places and 0 transitions.
Iterating global reduction 5 with 2412 rules applied. Total rules applied 146329 place count 35218 transition count 51657
Applied a total of 146329 rules in 23494 ms. Remains 35218 /116842 variables (removed 81624) and now considering 51657/131264 (removed 79607) transitions.
// Phase 1: matrix 51657 rows 35218 cols
[2023-03-11 14:32:00] [INFO ] Computed 1611 place invariants in 4156 ms
[2023-03-11 14:32:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:32:03] [INFO ] Implicit Places using invariants in 7187 ms returned []
Implicit Place search using SMT only with invariants took 7189 ms to find 0 implicit places.
[2023-03-11 14:32:03] [INFO ] Invariant cache hit.
[2023-03-11 14:32:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:32:06] [INFO ] Dead Transitions using invariants and state equation in 2715 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35218/116842 places, 51657/131264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33403 ms. Remains : 35218/116842 places, 51657/131264 transitions.
Computed a total of 35218 stabilizing places and 51657 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35218 transition count 51657
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)...)
Solver returned unknown.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p2 p1)), (X p1), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 336 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Finished random walk after 1456 steps, including 0 resets, run visited all 5 properties in 216 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p2 p1)), (X p1), (X p0), (X (NOT (AND (NOT p0) p2 p1))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p2 p0))), (F (AND p1 p2 (NOT p0)))]
Knowledge based reduction with 8 factoid took 457 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false, false]
Product exploration explored 100000 steps with 252 reset in 9555 ms.
Product exploration explored 100000 steps with 251 reset in 9782 ms.
Support contains 6633 out of 35218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35218/35218 places, 51657/51657 transitions.
Applied a total of 0 rules in 1231 ms. Remains 35218 /35218 variables (removed 0) and now considering 51657/51657 (removed 0) transitions.
[2023-03-11 14:34:33] [INFO ] Invariant cache hit.
[2023-03-11 14:34:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:34:36] [INFO ] Implicit Places using invariants in 2781 ms returned []
Implicit Place search using SMT only with invariants took 2782 ms to find 0 implicit places.
[2023-03-11 14:34:36] [INFO ] Invariant cache hit.
[2023-03-11 14:34:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:34:39] [INFO ] Dead Transitions using invariants and state equation in 2764 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6781 ms. Remains : 35218/35218 places, 51657/51657 transitions.
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-07 finished in 375667 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(p1)))))'
Support contains 4 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Discarding 1005 places :
Symmetric choice reduction at 1 with 1005 rule applications. Total rules 1006 place count 116847 transition count 132269
Iterating global reduction 1 with 1005 rules applied. Total rules applied 2011 place count 116847 transition count 132269
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 2016 place count 116842 transition count 131264
Iterating global reduction 1 with 5 rules applied. Total rules applied 2021 place count 116842 transition count 131264
Applied a total of 2021 rules in 6300 ms. Remains 116842 /117853 variables (removed 1011) and now considering 131264/134279 (removed 3015) transitions.
// Phase 1: matrix 131264 rows 116842 cols
[2023-03-11 14:35:20] [INFO ] Computed 4829 place invariants in 30217 ms
[2023-03-11 14:35:28] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:35:28] [INFO ] Implicit Places using invariants in 38652 ms returned []
Implicit Place search using SMT only with invariants took 38653 ms to find 0 implicit places.
[2023-03-11 14:35:29] [INFO ] Invariant cache hit.
[2023-03-11 14:35:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:35:37] [INFO ] Dead Transitions using invariants and state equation in 8386 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116842/117853 places, 131264/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53345 ms. Remains : 116842/117853 places, 131264/134279 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s74196 s89179), p1:(LEQ s75748 s27623)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 9 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-09 finished in 53911 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(G(p0))))'
Support contains 2 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Discarding 1005 places :
Symmetric choice reduction at 1 with 1005 rule applications. Total rules 1006 place count 116847 transition count 132269
Iterating global reduction 1 with 1005 rules applied. Total rules applied 2011 place count 116847 transition count 132269
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 2016 place count 116842 transition count 131264
Iterating global reduction 1 with 5 rules applied. Total rules applied 2021 place count 116842 transition count 131264
Applied a total of 2021 rules in 5958 ms. Remains 116842 /117853 variables (removed 1011) and now considering 131264/134279 (removed 3015) transitions.
[2023-03-11 14:35:43] [INFO ] Invariant cache hit.
[2023-03-11 14:35:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:35:52] [INFO ] Implicit Places using invariants in 8265 ms returned []
Implicit Place search using SMT only with invariants took 8266 ms to find 0 implicit places.
[2023-03-11 14:35:52] [INFO ] Invariant cache hit.
[2023-03-11 14:36:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:36:00] [INFO ] Dead Transitions using invariants and state equation in 8224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116842/117853 places, 131264/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22452 ms. Remains : 116842/117853 places, 131264/134279 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s24876 s76089)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 7055 ms.
Product exploration explored 100000 steps with 8 reset in 7481 ms.
Computed a total of 116842 stabilizing places and 131264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116842 transition count 131264
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)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4043 steps, including 1 resets, run visited all 1 properties in 245 ms. (steps per millisecond=16 )
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 116842 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116842/116842 places, 131264/131264 transitions.
Applied a total of 0 rules in 1733 ms. Remains 116842 /116842 variables (removed 0) and now considering 131264/131264 (removed 0) transitions.
[2023-03-11 14:36:40] [INFO ] Invariant cache hit.
[2023-03-11 14:36:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:36:48] [INFO ] Implicit Places using invariants in 8649 ms returned []
Implicit Place search using SMT only with invariants took 8653 ms to find 0 implicit places.
[2023-03-11 14:36:48] [INFO ] Invariant cache hit.
[2023-03-11 14:36:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:36:57] [INFO ] Dead Transitions using invariants and state equation in 8725 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19120 ms. Remains : 116842/116842 places, 131264/131264 transitions.
Computed a total of 116842 stabilizing places and 131264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116842 transition count 131264
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)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 87998 steps, run timeout after 3006 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87998 steps, saw 87562 distinct states, run finished after 3008 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 14:37:23] [INFO ] Invariant cache hit.
[2023-03-11 14:37:48] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 116842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116842/116842 places, 131264/131264 transitions.
Graph (complete) has 168840 edges and 116842 vertex of which 55614 are kept as prefixes of interest. Removing 61228 places using SCC suffix rule.41 ms
Discarding 61228 places :
Also discarding 67625 output transitions
Drop transitions removed 67625 transitions
Drop transitions removed 4200 transitions
Reduce isomorphic transitions removed 4200 transitions.
Drop transitions removed 50703 transitions
Trivial Post-agglo rules discarded 50703 transitions
Performed 50703 trivial Post agglomeration. Transition count delta: 50703
Iterating post reduction 0 with 54903 rules applied. Total rules applied 54904 place count 55614 transition count 8736
Reduce places removed 50703 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50704 rules applied. Total rules applied 105608 place count 4911 transition count 8735
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105609 place count 4910 transition count 8735
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 105609 place count 4910 transition count 8733
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 105613 place count 4908 transition count 8733
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 105663 place count 4858 transition count 8683
Iterating global reduction 3 with 50 rules applied. Total rules applied 105713 place count 4858 transition count 8683
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 13 rules applied. Total rules applied 105726 place count 4857 transition count 8671
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 105728 place count 4855 transition count 8671
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 105728 place count 4855 transition count 8669
Deduced a syphon composed of 2 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 105733 place count 4852 transition count 8669
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 105753 place count 4832 transition count 8649
Iterating global reduction 5 with 20 rules applied. Total rules applied 105773 place count 4832 transition count 8649
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 105774 place count 4831 transition count 8649
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 105774 place count 4831 transition count 8647
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 105778 place count 4829 transition count 8647
Discarding 4019 places :
Symmetric choice reduction at 6 with 4019 rule applications. Total rules 109797 place count 810 transition count 4628
Iterating global reduction 6 with 4019 rules applied. Total rules applied 113816 place count 810 transition count 4628
Ensure Unique test removed 4019 transitions
Reduce isomorphic transitions removed 4019 transitions.
Discarding 200 places :
Implicit places reduction removed 200 places
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 6 with 4619 rules applied. Total rules applied 118435 place count 610 transition count 209
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 7 with 400 rules applied. Total rules applied 118835 place count 210 transition count 209
Discarding 198 places :
Symmetric choice reduction at 8 with 198 rule applications. Total rules 119033 place count 12 transition count 11
Iterating global reduction 8 with 198 rules applied. Total rules applied 119231 place count 12 transition count 11
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 8 with 2 rules applied. Total rules applied 119233 place count 11 transition count 10
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 119234 place count 11 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 119235 place count 10 transition count 9
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 119237 place count 10 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 119238 place count 9 transition count 8
Applied a total of 119238 rules in 3884 ms. Remains 9 /116842 variables (removed 116833) and now considering 8/131264 (removed 131256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3884 ms. Remains : 9/116842 places, 8/131264 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8 reset in 7157 ms.
Product exploration explored 100000 steps with 8 reset in 7045 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 116842 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116842/116842 places, 131264/131264 transitions.
Graph (complete) has 168840 edges and 116842 vertex of which 60414 are kept as prefixes of interest. Removing 56428 places using SCC suffix rule.101 ms
Discarding 56428 places :
Also discarding 63025 output transitions
Drop transitions removed 63025 transitions
Performed 29779 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29779 rules applied. Total rules applied 29780 place count 60414 transition count 68239
Performed 17106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 17106 Pre rules applied. Total rules applied 29780 place count 60414 transition count 68239
Deduced a syphon composed of 46885 places in 41 ms
Iterating global reduction 1 with 17106 rules applied. Total rules applied 46886 place count 60414 transition count 68239
Discarding 199 places :
Symmetric choice reduction at 1 with 199 rule applications. Total rules 47085 place count 60215 transition count 64060
Deduced a syphon composed of 46885 places in 41 ms
Iterating global reduction 1 with 199 rules applied. Total rules applied 47284 place count 60215 transition count 64060
Performed 8644 Post agglomeration using F-continuation condition.Transition count delta: -4020
Deduced a syphon composed of 55529 places in 26 ms
Iterating global reduction 1 with 8644 rules applied. Total rules applied 55928 place count 60215 transition count 68080
Deduced a syphon composed of 55529 places in 27 ms
Applied a total of 55928 rules in 61858 ms. Remains 60215 /116842 variables (removed 56627) and now considering 68080/131264 (removed 63184) transitions.
// Phase 1: matrix 68080 rows 60215 cols
[2023-03-11 14:39:58] [INFO ] Computed 205 place invariants in 49345 ms
[2023-03-11 14:40:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:40:03] [INFO ] Dead Transitions using invariants and state equation in 53747 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60215/116842 places, 68080/131264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115609 ms. Remains : 60215/116842 places, 68080/131264 transitions.
Support contains 2 out of 116842 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116842/116842 places, 131264/131264 transitions.
Applied a total of 0 rules in 1447 ms. Remains 116842 /116842 variables (removed 0) and now considering 131264/131264 (removed 0) transitions.
// Phase 1: matrix 131264 rows 116842 cols
[2023-03-11 14:40:29] [INFO ] Computed 4829 place invariants in 24562 ms
[2023-03-11 14:40:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:40:37] [INFO ] Implicit Places using invariants in 33165 ms returned []
Implicit Place search using SMT only with invariants took 33166 ms to find 0 implicit places.
[2023-03-11 14:40:37] [INFO ] Invariant cache hit.
[2023-03-11 14:40:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:40:46] [INFO ] Dead Transitions using invariants and state equation in 8481 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43102 ms. Remains : 116842/116842 places, 131264/131264 transitions.
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-11 finished in 313325 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((X(p0)&&(!p0||F(G(p1)))))))'
Support contains 4 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Discarding 1004 places :
Symmetric choice reduction at 1 with 1004 rule applications. Total rules 1005 place count 116848 transition count 132271
Iterating global reduction 1 with 1004 rules applied. Total rules applied 2009 place count 116848 transition count 132271
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 2013 place count 116844 transition count 131467
Iterating global reduction 1 with 4 rules applied. Total rules applied 2017 place count 116844 transition count 131467
Applied a total of 2017 rules in 6388 ms. Remains 116844 /117853 variables (removed 1009) and now considering 131467/134279 (removed 2812) transitions.
// Phase 1: matrix 131467 rows 116844 cols
[2023-03-11 14:41:27] [INFO ] Computed 4829 place invariants in 29838 ms
[2023-03-11 14:41:35] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:41:35] [INFO ] Implicit Places using invariants in 38014 ms returned []
Implicit Place search using SMT only with invariants took 38015 ms to find 0 implicit places.
[2023-03-11 14:41:35] [INFO ] Invariant cache hit.
[2023-03-11 14:41:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:41:44] [INFO ] Dead Transitions using invariants and state equation in 8436 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116844/117853 places, 131467/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52842 ms. Remains : 116844/117853 places, 131467/134279 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s8263 s74410), p1:(GT s115935 s28992)], 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 11513 steps with 2 reset in 812 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-12 finished in 54288 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(p1)||p0)) U X(X(p2))))'
Support contains 4 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1005 places :
Symmetric choice reduction at 0 with 1005 rule applications. Total rules 1005 place count 116848 transition count 132269
Iterating global reduction 0 with 1005 rules applied. Total rules applied 2010 place count 116848 transition count 132269
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 2015 place count 116843 transition count 131264
Iterating global reduction 0 with 5 rules applied. Total rules applied 2020 place count 116843 transition count 131264
Applied a total of 2020 rules in 5046 ms. Remains 116843 /117853 variables (removed 1010) and now considering 131264/134279 (removed 3015) transitions.
// Phase 1: matrix 131264 rows 116843 cols
[2023-03-11 14:42:15] [INFO ] Computed 4830 place invariants in 24622 ms
[2023-03-11 14:42:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:42:23] [INFO ] Implicit Places using invariants in 33181 ms returned []
Implicit Place search using SMT only with invariants took 33183 ms to find 0 implicit places.
[2023-03-11 14:42:23] [INFO ] Invariant cache hit.
[2023-03-11 14:42:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:42:32] [INFO ] Dead Transitions using invariants and state equation in 8439 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116843/117853 places, 131264/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46677 ms. Remains : 116843/117853 places, 131264/134279 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LEQ 3 s94879) (LEQ 3 s830)), p1:(GT 3 s94879), p2:(LEQ s55688 s39102)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 19370 steps with 7756 reset in 10019 ms.
Product exploration timeout after 19500 steps with 7796 reset in 10015 ms.
Computed a total of 116843 stabilizing places and 131264 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116843 transition count 131264
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)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 9 factoid took 168 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-13 finished in 88677 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(p0)&&F(p1)))))'
Support contains 4 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 117852 transition count 134279
Discarding 1005 places :
Symmetric choice reduction at 1 with 1005 rule applications. Total rules 1006 place count 116847 transition count 132269
Iterating global reduction 1 with 1005 rules applied. Total rules applied 2011 place count 116847 transition count 132269
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 2016 place count 116842 transition count 131264
Iterating global reduction 1 with 5 rules applied. Total rules applied 2021 place count 116842 transition count 131264
Applied a total of 2021 rules in 5544 ms. Remains 116842 /117853 variables (removed 1011) and now considering 131264/134279 (removed 3015) transitions.
// Phase 1: matrix 131264 rows 116842 cols
[2023-03-11 14:43:45] [INFO ] Computed 4829 place invariants in 25254 ms
[2023-03-11 14:43:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:43:53] [INFO ] Implicit Places using invariants in 33529 ms returned []
Implicit Place search using SMT only with invariants took 33535 ms to find 0 implicit places.
[2023-03-11 14:43:53] [INFO ] Invariant cache hit.
[2023-03-11 14:44:01] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:44:01] [INFO ] Dead Transitions using invariants and state equation in 8179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116842/117853 places, 131264/134279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47263 ms. Remains : 116842/117853 places, 131264/134279 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (GT 1 s85679) (LEQ 2 s40432)), p0:(OR (LEQ s95006 s992) (LEQ 1 s85679))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11510 steps with 0 reset in 725 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-14 finished in 48581 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' '!(G((F(p0)&&F((p1&&X((p1 U (p2||G(p1)))))))))'
Found a Shortening insensitive property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-07
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 6633 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Graph (complete) has 172862 edges and 117853 vertex of which 109991 are kept as prefixes of interest. Removing 7862 places using SCC suffix rule.147 ms
Discarding 7862 places :
Also discarding 10664 output transitions
Drop transitions removed 10664 transitions
Reduce places removed 201 places and 201 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 53868 transitions
Trivial Post-agglo rules discarded 53868 transitions
Performed 53868 trivial Post agglomeration. Transition count delta: 53868
Iterating post reduction 0 with 53869 rules applied. Total rules applied 53870 place count 109789 transition count 69546
Reduce places removed 53868 places and 0 transitions.
Performed 8442 Post agglomeration using F-continuation condition.Transition count delta: 8442
Iterating post reduction 1 with 62310 rules applied. Total rules applied 116180 place count 55921 transition count 61104
Reduce places removed 8442 places and 0 transitions.
Iterating post reduction 2 with 8442 rules applied. Total rules applied 124622 place count 47479 transition count 61104
Performed 5829 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5829 Pre rules applied. Total rules applied 124622 place count 47479 transition count 55275
Deduced a syphon composed of 5829 places in 34 ms
Ensure Unique test removed 2814 places
Reduce places removed 8643 places and 0 transitions.
Iterating global reduction 3 with 14472 rules applied. Total rules applied 139094 place count 38836 transition count 55275
Drop transitions removed 2412 transitions
Trivial Post-agglo rules discarded 2412 transitions
Performed 2412 trivial Post agglomeration. Transition count delta: 2412
Iterating post reduction 3 with 2412 rules applied. Total rules applied 141506 place count 38836 transition count 52863
Reduce places removed 2412 places and 0 transitions.
Iterating post reduction 4 with 2412 rules applied. Total rules applied 143918 place count 36424 transition count 52863
Performed 1206 Post agglomeration using F-continuation condition.Transition count delta: 1206
Deduced a syphon composed of 1206 places in 31 ms
Reduce places removed 1206 places and 0 transitions.
Iterating global reduction 5 with 2412 rules applied. Total rules applied 146330 place count 35218 transition count 51657
Applied a total of 146330 rules in 22889 ms. Remains 35218 /117853 variables (removed 82635) and now considering 51657/134279 (removed 82622) transitions.
// Phase 1: matrix 51657 rows 35218 cols
[2023-03-11 14:44:29] [INFO ] Computed 1611 place invariants in 3509 ms
[2023-03-11 14:44:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:44:32] [INFO ] Implicit Places using invariants in 6103 ms returned []
Implicit Place search using SMT only with invariants took 6113 ms to find 0 implicit places.
[2023-03-11 14:44:32] [INFO ] Invariant cache hit.
[2023-03-11 14:44:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:44:34] [INFO ] Dead Transitions using invariants and state equation in 2571 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 35218/117853 places, 51657/134279 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 31576 ms. Remains : 35218/117853 places, 51657/134279 transitions.
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-07 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=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 3 (ADD s13880 s13881 s13882 s13883 s13884 s13885 s13886 s13887 s13888 s13889 s13890 s13891 s13892 s13893 s13894 s13895 s13896 s13897 s13898 s13899 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 30700 steps with 10191 reset in 10001 ms.
Product exploration timeout after 30640 steps with 10200 reset in 10006 ms.
Computed a total of 35218 stabilizing places and 51657 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35218 transition count 51657
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)...)
Solver returned unknown.
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 510 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Finished random walk after 1484 steps, including 0 resets, run visited all 4 properties in 196 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 8 factoid took 414 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Support contains 2412 out of 35218 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 35218/35218 places, 51657/51657 transitions.
Applied a total of 0 rules in 1275 ms. Remains 35218 /35218 variables (removed 0) and now considering 51657/51657 (removed 0) transitions.
[2023-03-11 14:46:53] [INFO ] Invariant cache hit.
[2023-03-11 14:46:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:46:55] [INFO ] Implicit Places using invariants in 2718 ms returned []
Implicit Place search using SMT only with invariants took 2720 ms to find 0 implicit places.
[2023-03-11 14:46:55] [INFO ] Invariant cache hit.
[2023-03-11 14:46:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:46:58] [INFO ] Dead Transitions using invariants and state equation in 2662 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6659 ms. Remains : 35218/35218 places, 51657/51657 transitions.
Computed a total of 35218 stabilizing places and 51657 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35218 transition count 51657
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)...)
Solver returned unknown.
Knowledge obtained : [(AND p1 p2), (X (AND p1 p2)), (X p1), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Finished random walk after 1456 steps, including 0 resets, run visited all 4 properties in 189 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 p2), (X (AND p1 p2)), (X p1), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 246 reset in 8945 ms.
Product exploration explored 100000 steps with 248 reset in 9170 ms.
Support contains 2412 out of 35218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35218/35218 places, 51657/51657 transitions.
Drop transitions removed 8442 transitions
Trivial Post-agglo rules discarded 8442 transitions
Performed 8442 trivial Post agglomeration. Transition count delta: 8442
Iterating post reduction 0 with 8442 rules applied. Total rules applied 8442 place count 35218 transition count 43215
Reduce places removed 8442 places and 0 transitions.
Iterating post reduction 1 with 8442 rules applied. Total rules applied 16884 place count 26776 transition count 43215
Applied a total of 16884 rules in 1580 ms. Remains 26776 /35218 variables (removed 8442) and now considering 43215/51657 (removed 8442) transitions.
// Phase 1: matrix 43215 rows 26776 cols
[2023-03-11 14:49:11] [INFO ] Computed 1611 place invariants in 2870 ms
[2023-03-11 14:49:13] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:49:13] [INFO ] Implicit Places using invariants in 4909 ms returned []
Implicit Place search using SMT only with invariants took 4910 ms to find 0 implicit places.
[2023-03-11 14:49:13] [INFO ] Invariant cache hit.
[2023-03-11 14:49:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 14:49:15] [INFO ] Dead Transitions using invariants and state equation in 2029 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26776/35218 places, 43215/51657 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8523 ms. Remains : 26776/35218 places, 43215/51657 transitions.
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-07 finished in 316415 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(G(p0))))'
Found a Lengthening insensitive property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-11
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 117853 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 117853/117853 places, 134279/134279 transitions.
Graph (complete) has 172862 edges and 117853 vertex of which 60415 are kept as prefixes of interest. Removing 57438 places using SCC suffix rule.102 ms
Discarding 57438 places :
Also discarding 66040 output transitions
Drop transitions removed 66040 transitions
Reduce places removed 201 places and 201 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 50903 transitions
Trivial Post-agglo rules discarded 50903 transitions
Performed 50903 trivial Post agglomeration. Transition count delta: 50903
Iterating post reduction 0 with 50904 rules applied. Total rules applied 50905 place count 60213 transition count 17135
Reduce places removed 50903 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50904 rules applied. Total rules applied 101809 place count 9310 transition count 17134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101810 place count 9309 transition count 17134
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 202 Pre rules applied. Total rules applied 101810 place count 9309 transition count 16932
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 3 with 404 rules applied. Total rules applied 102214 place count 9107 transition count 16932
Discarding 4249 places :
Symmetric choice reduction at 3 with 4249 rule applications. Total rules 106463 place count 4858 transition count 8703
Iterating global reduction 3 with 4249 rules applied. Total rules applied 110712 place count 4858 transition count 8703
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 13 rules applied. Total rules applied 110725 place count 4857 transition count 8691
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 110727 place count 4855 transition count 8691
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 110727 place count 4855 transition count 8689
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 110732 place count 4852 transition count 8689
Discarding 219 places :
Symmetric choice reduction at 5 with 219 rule applications. Total rules 110951 place count 4633 transition count 8450
Iterating global reduction 5 with 219 rules applied. Total rules applied 111170 place count 4633 transition count 8450
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 111171 place count 4632 transition count 8450
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 111171 place count 4632 transition count 8448
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 111175 place count 4630 transition count 8448
Discarding 4019 places :
Symmetric choice reduction at 6 with 4019 rule applications. Total rules 115194 place count 611 transition count 4429
Iterating global reduction 6 with 4019 rules applied. Total rules applied 119213 place count 611 transition count 4429
Ensure Unique test removed 4019 transitions
Reduce isomorphic transitions removed 4019 transitions.
Iterating post reduction 6 with 4019 rules applied. Total rules applied 123232 place count 611 transition count 410
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 200 Pre rules applied. Total rules applied 123232 place count 611 transition count 210
Deduced a syphon composed of 200 places in 0 ms
Ensure Unique test removed 200 places
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 7 with 600 rules applied. Total rules applied 123832 place count 211 transition count 210
Discarding 198 places :
Symmetric choice reduction at 7 with 198 rule applications. Total rules 124030 place count 13 transition count 12
Iterating global reduction 7 with 198 rules applied. Total rules applied 124228 place count 13 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 124230 place count 11 transition count 10
Applied a total of 124230 rules in 6200 ms. Remains 11 /117853 variables (removed 117842) and now considering 10/134279 (removed 134269) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-11 14:49:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 14:49:26] [INFO ] Implicit Places using invariants in 29 ms returned [1, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/117853 places, 10/134279 transitions.
Graph (complete) has 8 edges and 9 vertex of which 7 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 5 transition count 6
Applied a total of 3 rules in 2 ms. Remains 5 /9 variables (removed 4) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 5 cols
[2023-03-11 14:49:26] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 14:49:26] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-11 14:49:26] [INFO ] Invariant cache hit.
[2023-03-11 14:49:26] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 5/117853 places, 6/134279 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 6270 ms. Remains : 5/117853 places, 6/134279 transitions.
Running random walk in product with property : FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 2 reset in 0 ms.
Treatment of property FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-11 finished in 7056 ms.
FORMULA FamilyReunion-PT-L00200M0020C010P010G005-LTLCardinality-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-11 14:49:29] [INFO ] Flatten gal took : 2634 ms
[2023-03-11 14:49:29] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2023-03-11 14:49:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117853 places, 134279 transitions and 320206 arcs took 667 ms.
Total runtime 1833581 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1774/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 144212 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15848144 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1774/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 766720 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15844680 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023

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-L00200M0020C010P010G005"
export BK_EXAMINATION="LTLCardinality"
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-L00200M0020C010P010G005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855900427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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