Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977800172.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:23 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 ShieldRVs-PT-100B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679302955763

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 09:02:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 09:02:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 09:02:38] [INFO ] Load time of PNML (sax parser for PT used): 293 ms
[2023-03-20 09:02:38] [INFO ] Transformed 4003 places.
[2023-03-20 09:02:38] [INFO ] Transformed 4503 transitions.
[2023-03-20 09:02:38] [INFO ] Found NUPN structural information;
[2023-03-20 09:02:38] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 578 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-100B-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 4003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Discarding 685 places :
Symmetric choice reduction at 0 with 685 rule applications. Total rules 685 place count 3318 transition count 3818
Iterating global reduction 0 with 685 rules applied. Total rules applied 1370 place count 3318 transition count 3818
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1371 place count 3317 transition count 3817
Iterating global reduction 0 with 1 rules applied. Total rules applied 1372 place count 3317 transition count 3817
Applied a total of 1372 rules in 1440 ms. Remains 3317 /4003 variables (removed 686) and now considering 3817/4503 (removed 686) transitions.
// Phase 1: matrix 3817 rows 3317 cols
[2023-03-20 09:02:40] [INFO ] Computed 401 place invariants in 74 ms
[2023-03-20 09:02:48] [INFO ] Implicit Places using invariants in 7570 ms returned []
[2023-03-20 09:02:48] [INFO ] Invariant cache hit.
[2023-03-20 09:02:55] [INFO ] Implicit Places using invariants and state equation in 7012 ms returned []
Implicit Place search using SMT with State Equation took 14613 ms to find 0 implicit places.
[2023-03-20 09:02:55] [INFO ] Invariant cache hit.
[2023-03-20 09:02:57] [INFO ] Dead Transitions using invariants and state equation in 2287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3317/4003 places, 3817/4503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18355 ms. Remains : 3317/4003 places, 3817/4503 transitions.
Support contains 50 out of 3317 places after structural reductions.
[2023-03-20 09:02:57] [INFO ] Flatten gal took : 287 ms
[2023-03-20 09:02:58] [INFO ] Flatten gal took : 180 ms
[2023-03-20 09:02:58] [INFO ] Input system was already deterministic with 3817 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 32) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-20 09:02:59] [INFO ] Invariant cache hit.
[2023-03-20 09:03:00] [INFO ] After 1097ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-20 09:03:01] [INFO ] [Nat]Absence check using 401 positive place invariants in 249 ms returned sat
[2023-03-20 09:03:07] [INFO ] After 4823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-20 09:03:08] [INFO ] Deduced a trap composed of 34 places in 1160 ms of which 8 ms to minimize.
[2023-03-20 09:03:09] [INFO ] Deduced a trap composed of 32 places in 966 ms of which 3 ms to minimize.
[2023-03-20 09:03:10] [INFO ] Deduced a trap composed of 21 places in 848 ms of which 10 ms to minimize.
[2023-03-20 09:03:11] [INFO ] Deduced a trap composed of 22 places in 756 ms of which 2 ms to minimize.
[2023-03-20 09:03:12] [INFO ] Deduced a trap composed of 26 places in 704 ms of which 2 ms to minimize.
[2023-03-20 09:03:13] [INFO ] Deduced a trap composed of 18 places in 809 ms of which 1 ms to minimize.
[2023-03-20 09:03:14] [INFO ] Deduced a trap composed of 44 places in 734 ms of which 2 ms to minimize.
[2023-03-20 09:03:15] [INFO ] Deduced a trap composed of 35 places in 749 ms of which 2 ms to minimize.
[2023-03-20 09:03:15] [INFO ] Deduced a trap composed of 48 places in 768 ms of which 1 ms to minimize.
[2023-03-20 09:03:16] [INFO ] Deduced a trap composed of 42 places in 717 ms of which 1 ms to minimize.
[2023-03-20 09:03:17] [INFO ] Deduced a trap composed of 35 places in 639 ms of which 2 ms to minimize.
[2023-03-20 09:03:18] [INFO ] Deduced a trap composed of 39 places in 889 ms of which 1 ms to minimize.
[2023-03-20 09:03:19] [INFO ] Deduced a trap composed of 41 places in 642 ms of which 2 ms to minimize.
[2023-03-20 09:03:20] [INFO ] Deduced a trap composed of 46 places in 806 ms of which 1 ms to minimize.
[2023-03-20 09:03:20] [INFO ] Deduced a trap composed of 40 places in 717 ms of which 1 ms to minimize.
[2023-03-20 09:03:21] [INFO ] Deduced a trap composed of 46 places in 654 ms of which 1 ms to minimize.
[2023-03-20 09:03:22] [INFO ] Deduced a trap composed of 35 places in 673 ms of which 2 ms to minimize.
[2023-03-20 09:03:23] [INFO ] Deduced a trap composed of 41 places in 681 ms of which 2 ms to minimize.
[2023-03-20 09:03:24] [INFO ] Deduced a trap composed of 51 places in 655 ms of which 2 ms to minimize.
[2023-03-20 09:03:24] [INFO ] Deduced a trap composed of 55 places in 616 ms of which 1 ms to minimize.
[2023-03-20 09:03:25] [INFO ] Deduced a trap composed of 59 places in 610 ms of which 2 ms to minimize.
[2023-03-20 09:03:27] [INFO ] Deduced a trap composed of 21 places in 2052 ms of which 3 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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-20 09:03:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 09:03:27] [INFO ] After 27093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Parikh walk visited 0 properties in 2737 ms.
Support contains 30 out of 3317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Drop transitions removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 394 rules applied. Total rules applied 394 place count 3317 transition count 3423
Reduce places removed 394 places and 0 transitions.
Iterating post reduction 1 with 394 rules applied. Total rules applied 788 place count 2923 transition count 3423
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 788 place count 2923 transition count 2923
Deduced a syphon composed of 500 places in 10 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1788 place count 2423 transition count 2923
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1798 place count 2413 transition count 2913
Iterating global reduction 2 with 10 rules applied. Total rules applied 1808 place count 2413 transition count 2913
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1808 place count 2413 transition count 2910
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1814 place count 2410 transition count 2910
Performed 989 Post agglomeration using F-continuation condition.Transition count delta: 989
Deduced a syphon composed of 989 places in 12 ms
Reduce places removed 989 places and 0 transitions.
Iterating global reduction 2 with 1978 rules applied. Total rules applied 3792 place count 1421 transition count 1921
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 197 times.
Drop transitions removed 197 transitions
Iterating global reduction 2 with 197 rules applied. Total rules applied 3989 place count 1421 transition count 1921
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3990 place count 1420 transition count 1920
Applied a total of 3990 rules in 1481 ms. Remains 1420 /3317 variables (removed 1897) and now considering 1920/3817 (removed 1897) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1481 ms. Remains : 1420/3317 places, 1920/3817 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1920 rows 1420 cols
[2023-03-20 09:03:32] [INFO ] Computed 401 place invariants in 8 ms
[2023-03-20 09:03:32] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 09:03:33] [INFO ] [Nat]Absence check using 401 positive place invariants in 92 ms returned sat
[2023-03-20 09:03:33] [INFO ] After 741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 09:03:34] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2023-03-20 09:03:34] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 0 ms to minimize.
[2023-03-20 09:03:34] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2023-03-20 09:03:34] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2023-03-20 09:03:34] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2023-03-20 09:03:34] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-20 09:03:34] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2023-03-20 09:03:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 897 ms
[2023-03-20 09:03:34] [INFO ] After 1848ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-20 09:03:35] [INFO ] After 2344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 8 out of 1420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1420/1420 places, 1920/1920 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 1420 transition count 1915
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 1415 transition count 1915
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 24 place count 1408 transition count 1908
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 1408 transition count 1908
Applied a total of 28 rules in 211 ms. Remains 1408 /1420 variables (removed 12) and now considering 1908/1920 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 1408/1420 places, 1908/1920 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1908 rows 1408 cols
[2023-03-20 09:03:35] [INFO ] Computed 401 place invariants in 7 ms
[2023-03-20 09:03:35] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:03:36] [INFO ] [Nat]Absence check using 401 positive place invariants in 80 ms returned sat
[2023-03-20 09:03:36] [INFO ] After 645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 09:03:36] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2023-03-20 09:03:37] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2023-03-20 09:03:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2023-03-20 09:03:37] [INFO ] After 1067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-20 09:03:37] [INFO ] After 1464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 47 ms.
Support contains 7 out of 1408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 1908/1908 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1407 transition count 1907
Applied a total of 2 rules in 141 ms. Remains 1407 /1408 variables (removed 1) and now considering 1907/1908 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 1407/1408 places, 1907/1908 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1907 rows 1407 cols
[2023-03-20 09:03:37] [INFO ] Computed 401 place invariants in 11 ms
[2023-03-20 09:03:37] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:03:38] [INFO ] [Nat]Absence check using 401 positive place invariants in 53 ms returned sat
[2023-03-20 09:03:38] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:03:38] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 4 ms to minimize.
[2023-03-20 09:03:39] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 0 ms to minimize.
[2023-03-20 09:03:39] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 0 ms to minimize.
[2023-03-20 09:03:39] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2023-03-20 09:03:39] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2023-03-20 09:03:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 946 ms
[2023-03-20 09:03:39] [INFO ] After 1598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-20 09:03:39] [INFO ] After 1908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 1407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1407/1407 places, 1907/1907 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1406 transition count 1906
Applied a total of 2 rules in 127 ms. Remains 1406 /1407 variables (removed 1) and now considering 1906/1907 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 1406/1407 places, 1906/1907 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 220187 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220187 steps, saw 215057 distinct states, run finished after 3004 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1906 rows 1406 cols
[2023-03-20 09:03:43] [INFO ] Computed 401 place invariants in 16 ms
[2023-03-20 09:03:43] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:03:43] [INFO ] [Nat]Absence check using 401 positive place invariants in 78 ms returned sat
[2023-03-20 09:03:44] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:03:44] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2023-03-20 09:03:44] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2023-03-20 09:03:44] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2023-03-20 09:03:45] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2023-03-20 09:03:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 834 ms
[2023-03-20 09:03:45] [INFO ] After 1637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-20 09:03:45] [INFO ] After 1987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 1406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 1906/1906 transitions.
Applied a total of 0 rules in 62 ms. Remains 1406 /1406 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1406/1406 places, 1906/1906 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 1906/1906 transitions.
Applied a total of 0 rules in 77 ms. Remains 1406 /1406 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
[2023-03-20 09:03:45] [INFO ] Invariant cache hit.
[2023-03-20 09:03:46] [INFO ] Implicit Places using invariants in 837 ms returned []
[2023-03-20 09:03:46] [INFO ] Invariant cache hit.
[2023-03-20 09:03:48] [INFO ] Implicit Places using invariants and state equation in 1696 ms returned []
Implicit Place search using SMT with State Equation took 2538 ms to find 0 implicit places.
[2023-03-20 09:03:48] [INFO ] Redundant transitions in 835 ms returned []
[2023-03-20 09:03:48] [INFO ] Invariant cache hit.
[2023-03-20 09:03:49] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4368 ms. Remains : 1406/1406 places, 1906/1906 transitions.
Applied a total of 0 rules in 61 ms. Remains 1406 /1406 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 09:03:49] [INFO ] Invariant cache hit.
[2023-03-20 09:03:50] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:03:50] [INFO ] [Nat]Absence check using 401 positive place invariants in 57 ms returned sat
[2023-03-20 09:03:50] [INFO ] After 594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:03:51] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-03-20 09:03:51] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2023-03-20 09:03:51] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 0 ms to minimize.
[2023-03-20 09:03:51] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2023-03-20 09:03:51] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2023-03-20 09:03:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 700 ms
[2023-03-20 09:03:51] [INFO ] After 1349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-20 09:03:51] [INFO ] After 1654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 809 stabilizing places and 809 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(p1 U G(p2)))))'
Support contains 8 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3303 transition count 3803
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3303 transition count 3803
Applied a total of 28 rules in 414 ms. Remains 3303 /3317 variables (removed 14) and now considering 3803/3817 (removed 14) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-20 09:03:52] [INFO ] Computed 401 place invariants in 19 ms
[2023-03-20 09:03:53] [INFO ] Implicit Places using invariants in 988 ms returned []
[2023-03-20 09:03:53] [INFO ] Invariant cache hit.
[2023-03-20 09:03:59] [INFO ] Implicit Places using invariants and state equation in 5480 ms returned []
Implicit Place search using SMT with State Equation took 6471 ms to find 0 implicit places.
[2023-03-20 09:03:59] [INFO ] Invariant cache hit.
[2023-03-20 09:04:02] [INFO ] Dead Transitions using invariants and state equation in 3086 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3303/3317 places, 3803/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9979 ms. Remains : 3303/3317 places, 3803/3817 transitions.
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR p2 p1), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s1762 1), p1:(EQ s1790 1), p0:(OR (EQ s2574 0) (EQ s2610 0) (EQ s2630 0) (EQ s1404 0) (EQ s1411 0) (EQ s1432 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 90 reset in 952 ms.
Product exploration explored 100000 steps with 89 reset in 989 ms.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1100 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-20 09:04:06] [INFO ] Invariant cache hit.
[2023-03-20 09:04:07] [INFO ] [Real]Absence check using 401 positive place invariants in 193 ms returned sat
[2023-03-20 09:04:07] [INFO ] After 976ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 09:04:08] [INFO ] [Nat]Absence check using 401 positive place invariants in 194 ms returned sat
[2023-03-20 09:04:12] [INFO ] After 3458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 09:04:13] [INFO ] Deduced a trap composed of 36 places in 985 ms of which 4 ms to minimize.
[2023-03-20 09:04:14] [INFO ] Deduced a trap composed of 21 places in 1008 ms of which 2 ms to minimize.
[2023-03-20 09:04:15] [INFO ] Deduced a trap composed of 24 places in 838 ms of which 2 ms to minimize.
[2023-03-20 09:04:16] [INFO ] Deduced a trap composed of 34 places in 836 ms of which 1 ms to minimize.
[2023-03-20 09:04:17] [INFO ] Deduced a trap composed of 28 places in 1061 ms of which 2 ms to minimize.
[2023-03-20 09:04:18] [INFO ] Deduced a trap composed of 37 places in 861 ms of which 3 ms to minimize.
[2023-03-20 09:04:19] [INFO ] Deduced a trap composed of 26 places in 978 ms of which 2 ms to minimize.
[2023-03-20 09:04:20] [INFO ] Deduced a trap composed of 35 places in 884 ms of which 1 ms to minimize.
[2023-03-20 09:04:21] [INFO ] Deduced a trap composed of 25 places in 862 ms of which 2 ms to minimize.
[2023-03-20 09:04:22] [INFO ] Deduced a trap composed of 20 places in 840 ms of which 1 ms to minimize.
[2023-03-20 09:04:23] [INFO ] Deduced a trap composed of 30 places in 825 ms of which 2 ms to minimize.
[2023-03-20 09:04:24] [INFO ] Deduced a trap composed of 23 places in 788 ms of which 1 ms to minimize.
[2023-03-20 09:04:25] [INFO ] Deduced a trap composed of 21 places in 795 ms of which 2 ms to minimize.
[2023-03-20 09:04:26] [INFO ] Deduced a trap composed of 30 places in 787 ms of which 1 ms to minimize.
[2023-03-20 09:04:27] [INFO ] Deduced a trap composed of 46 places in 990 ms of which 2 ms to minimize.
[2023-03-20 09:04:28] [INFO ] Deduced a trap composed of 22 places in 791 ms of which 3 ms to minimize.
[2023-03-20 09:04:29] [INFO ] Deduced a trap composed of 20 places in 887 ms of which 2 ms to minimize.
[2023-03-20 09:04:30] [INFO ] Deduced a trap composed of 54 places in 762 ms of which 1 ms to minimize.
[2023-03-20 09:04:31] [INFO ] Deduced a trap composed of 55 places in 782 ms of which 6 ms to minimize.
[2023-03-20 09:04:31] [INFO ] Deduced a trap composed of 57 places in 719 ms of which 2 ms to minimize.
[2023-03-20 09:04:32] [INFO ] Deduced a trap composed of 38 places in 938 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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-20 09:04:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 09:04:32] [INFO ] After 25242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1214 ms.
Support contains 8 out of 3303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Drop transitions removed 397 transitions
Trivial Post-agglo rules discarded 397 transitions
Performed 397 trivial Post agglomeration. Transition count delta: 397
Iterating post reduction 0 with 397 rules applied. Total rules applied 397 place count 3303 transition count 3406
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 1 with 397 rules applied. Total rules applied 794 place count 2906 transition count 3406
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 794 place count 2906 transition count 2907
Deduced a syphon composed of 499 places in 8 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1792 place count 2407 transition count 2907
Performed 997 Post agglomeration using F-continuation condition.Transition count delta: 997
Deduced a syphon composed of 997 places in 6 ms
Reduce places removed 997 places and 0 transitions.
Iterating global reduction 2 with 1994 rules applied. Total rules applied 3786 place count 1410 transition count 1910
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 2 with 201 rules applied. Total rules applied 3987 place count 1410 transition count 1910
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3988 place count 1409 transition count 1909
Applied a total of 3988 rules in 603 ms. Remains 1409 /3303 variables (removed 1894) and now considering 1909/3803 (removed 1894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 604 ms. Remains : 1409/3303 places, 1909/3803 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-20 09:04:35] [INFO ] Computed 401 place invariants in 8 ms
[2023-03-20 09:04:35] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 09:04:35] [INFO ] [Nat]Absence check using 401 positive place invariants in 52 ms returned sat
[2023-03-20 09:04:36] [INFO ] After 769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 09:04:36] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2023-03-20 09:04:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-20 09:04:37] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-03-20 09:04:37] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-20 09:04:37] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-20 09:04:37] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-20 09:04:37] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2023-03-20 09:04:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 885 ms
[2023-03-20 09:04:37] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2023-03-20 09:04:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-03-20 09:04:38] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2023-03-20 09:04:38] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-03-20 09:04:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2023-03-20 09:04:38] [INFO ] After 2640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 293 ms.
[2023-03-20 09:04:38] [INFO ] After 3258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 222 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 62 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 57127 steps, run timeout after 3002 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57127 steps, saw 55590 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-20 09:04:43] [INFO ] Invariant cache hit.
[2023-03-20 09:04:43] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 09:04:43] [INFO ] [Nat]Absence check using 401 positive place invariants in 52 ms returned sat
[2023-03-20 09:04:44] [INFO ] After 737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 09:04:44] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2023-03-20 09:04:44] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-03-20 09:04:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2023-03-20 09:04:45] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2023-03-20 09:04:45] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2023-03-20 09:04:45] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2023-03-20 09:04:45] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-20 09:04:45] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2023-03-20 09:04:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 785 ms
[2023-03-20 09:04:45] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2023-03-20 09:04:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-03-20 09:04:46] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-20 09:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-20 09:04:46] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2023-03-20 09:04:46] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2023-03-20 09:04:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
[2023-03-20 09:04:46] [INFO ] After 2708ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 257 ms.
[2023-03-20 09:04:46] [INFO ] After 3287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 201 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 79 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 57 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2023-03-20 09:04:47] [INFO ] Invariant cache hit.
[2023-03-20 09:04:47] [INFO ] Implicit Places using invariants in 752 ms returned []
[2023-03-20 09:04:47] [INFO ] Invariant cache hit.
[2023-03-20 09:04:49] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
[2023-03-20 09:04:49] [INFO ] Redundant transitions in 130 ms returned []
[2023-03-20 09:04:49] [INFO ] Invariant cache hit.
[2023-03-20 09:04:50] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3413 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 58 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-20 09:04:50] [INFO ] Invariant cache hit.
[2023-03-20 09:04:50] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 09:04:51] [INFO ] [Nat]Absence check using 401 positive place invariants in 52 ms returned sat
[2023-03-20 09:04:51] [INFO ] After 736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 09:04:52] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-20 09:04:52] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2023-03-20 09:04:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2023-03-20 09:04:52] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 1 ms to minimize.
[2023-03-20 09:04:52] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2023-03-20 09:04:52] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2023-03-20 09:04:53] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-20 09:04:53] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2023-03-20 09:04:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1075 ms
[2023-03-20 09:04:53] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2023-03-20 09:04:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-20 09:04:53] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2023-03-20 09:04:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-20 09:04:54] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2023-03-20 09:04:54] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2023-03-20 09:04:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 462 ms
[2023-03-20 09:04:54] [INFO ] After 3176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 288 ms.
[2023-03-20 09:04:54] [INFO ] After 3781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 21 factoid took 1028 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Support contains 8 out of 3303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Applied a total of 0 rules in 157 ms. Remains 3303 /3303 variables (removed 0) and now considering 3803/3803 (removed 0) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-20 09:04:56] [INFO ] Computed 401 place invariants in 22 ms
[2023-03-20 09:04:57] [INFO ] Implicit Places using invariants in 888 ms returned []
[2023-03-20 09:04:57] [INFO ] Invariant cache hit.
[2023-03-20 09:05:02] [INFO ] Implicit Places using invariants and state equation in 5021 ms returned []
Implicit Place search using SMT with State Equation took 5910 ms to find 0 implicit places.
[2023-03-20 09:05:02] [INFO ] Invariant cache hit.
[2023-03-20 09:05:04] [INFO ] Dead Transitions using invariants and state equation in 2315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8398 ms. Remains : 3303/3303 places, 3803/3803 transitions.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 709 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-20 09:05:06] [INFO ] Invariant cache hit.
[2023-03-20 09:05:07] [INFO ] [Real]Absence check using 401 positive place invariants in 178 ms returned sat
[2023-03-20 09:05:07] [INFO ] After 1009ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 09:05:07] [INFO ] [Nat]Absence check using 401 positive place invariants in 174 ms returned sat
[2023-03-20 09:05:11] [INFO ] After 3322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 09:05:12] [INFO ] Deduced a trap composed of 36 places in 1076 ms of which 2 ms to minimize.
[2023-03-20 09:05:13] [INFO ] Deduced a trap composed of 21 places in 815 ms of which 2 ms to minimize.
[2023-03-20 09:05:14] [INFO ] Deduced a trap composed of 24 places in 826 ms of which 1 ms to minimize.
[2023-03-20 09:05:15] [INFO ] Deduced a trap composed of 34 places in 899 ms of which 1 ms to minimize.
[2023-03-20 09:05:16] [INFO ] Deduced a trap composed of 28 places in 831 ms of which 1 ms to minimize.
[2023-03-20 09:05:17] [INFO ] Deduced a trap composed of 37 places in 886 ms of which 2 ms to minimize.
[2023-03-20 09:05:18] [INFO ] Deduced a trap composed of 26 places in 919 ms of which 1 ms to minimize.
[2023-03-20 09:05:19] [INFO ] Deduced a trap composed of 35 places in 839 ms of which 1 ms to minimize.
[2023-03-20 09:05:20] [INFO ] Deduced a trap composed of 25 places in 833 ms of which 1 ms to minimize.
[2023-03-20 09:05:21] [INFO ] Deduced a trap composed of 20 places in 820 ms of which 1 ms to minimize.
[2023-03-20 09:05:22] [INFO ] Deduced a trap composed of 30 places in 813 ms of which 1 ms to minimize.
[2023-03-20 09:05:23] [INFO ] Deduced a trap composed of 23 places in 816 ms of which 2 ms to minimize.
[2023-03-20 09:05:24] [INFO ] Deduced a trap composed of 21 places in 800 ms of which 1 ms to minimize.
[2023-03-20 09:05:25] [INFO ] Deduced a trap composed of 30 places in 830 ms of which 2 ms to minimize.
[2023-03-20 09:05:25] [INFO ] Deduced a trap composed of 46 places in 839 ms of which 1 ms to minimize.
[2023-03-20 09:05:26] [INFO ] Deduced a trap composed of 22 places in 749 ms of which 1 ms to minimize.
[2023-03-20 09:05:27] [INFO ] Deduced a trap composed of 20 places in 768 ms of which 1 ms to minimize.
[2023-03-20 09:05:28] [INFO ] Deduced a trap composed of 54 places in 750 ms of which 1 ms to minimize.
[2023-03-20 09:05:29] [INFO ] Deduced a trap composed of 55 places in 744 ms of which 2 ms to minimize.
[2023-03-20 09:05:30] [INFO ] Deduced a trap composed of 57 places in 754 ms of which 2 ms to minimize.
[2023-03-20 09:05:31] [INFO ] Deduced a trap composed of 38 places in 738 ms of which 2 ms to minimize.
[2023-03-20 09:05:32] [INFO ] Deduced a trap composed of 41 places in 769 ms of which 1 ms to minimize.
[2023-03-20 09:05:32] [INFO ] Deduced a trap composed of 28 places in 703 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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:261)
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-20 09:05:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 09:05:32] [INFO ] After 25703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1891 ms.
Support contains 8 out of 3303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Drop transitions removed 397 transitions
Trivial Post-agglo rules discarded 397 transitions
Performed 397 trivial Post agglomeration. Transition count delta: 397
Iterating post reduction 0 with 397 rules applied. Total rules applied 397 place count 3303 transition count 3406
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 1 with 397 rules applied. Total rules applied 794 place count 2906 transition count 3406
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 794 place count 2906 transition count 2907
Deduced a syphon composed of 499 places in 8 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1792 place count 2407 transition count 2907
Performed 997 Post agglomeration using F-continuation condition.Transition count delta: 997
Deduced a syphon composed of 997 places in 5 ms
Reduce places removed 997 places and 0 transitions.
Iterating global reduction 2 with 1994 rules applied. Total rules applied 3786 place count 1410 transition count 1910
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 2 with 201 rules applied. Total rules applied 3987 place count 1410 transition count 1910
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3988 place count 1409 transition count 1909
Applied a total of 3988 rules in 622 ms. Remains 1409 /3303 variables (removed 1894) and now considering 1909/3803 (removed 1894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 623 ms. Remains : 1409/3303 places, 1909/3803 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-20 09:05:36] [INFO ] Computed 401 place invariants in 8 ms
[2023-03-20 09:05:36] [INFO ] After 433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 09:05:37] [INFO ] [Nat]Absence check using 401 positive place invariants in 53 ms returned sat
[2023-03-20 09:05:37] [INFO ] After 803ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 09:05:38] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 1 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-20 09:05:38] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2023-03-20 09:05:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 751 ms
[2023-03-20 09:05:39] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2023-03-20 09:05:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-20 09:05:39] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2023-03-20 09:05:39] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2023-03-20 09:05:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 291 ms
[2023-03-20 09:05:39] [INFO ] After 2437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 232 ms.
[2023-03-20 09:05:39] [INFO ] After 2983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 317 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 57 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 72327 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72327 steps, saw 70510 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-20 09:05:44] [INFO ] Invariant cache hit.
[2023-03-20 09:05:44] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 09:05:44] [INFO ] [Nat]Absence check using 401 positive place invariants in 52 ms returned sat
[2023-03-20 09:05:45] [INFO ] After 773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 09:05:45] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2023-03-20 09:05:45] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2023-03-20 09:05:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2023-03-20 09:05:45] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2023-03-20 09:05:46] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2023-03-20 09:05:46] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2023-03-20 09:05:46] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2023-03-20 09:05:46] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2023-03-20 09:05:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 818 ms
[2023-03-20 09:05:46] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2023-03-20 09:05:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-20 09:05:47] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2023-03-20 09:05:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-20 09:05:47] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 0 ms to minimize.
[2023-03-20 09:05:47] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2023-03-20 09:05:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2023-03-20 09:05:47] [INFO ] After 2832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-20 09:05:47] [INFO ] After 3389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 130 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 56 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 56 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2023-03-20 09:05:48] [INFO ] Invariant cache hit.
[2023-03-20 09:05:48] [INFO ] Implicit Places using invariants in 753 ms returned []
[2023-03-20 09:05:48] [INFO ] Invariant cache hit.
[2023-03-20 09:05:50] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 2265 ms to find 0 implicit places.
[2023-03-20 09:05:50] [INFO ] Redundant transitions in 151 ms returned []
[2023-03-20 09:05:50] [INFO ] Invariant cache hit.
[2023-03-20 09:05:51] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3321 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 57 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-20 09:05:51] [INFO ] Invariant cache hit.
[2023-03-20 09:05:51] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 09:05:51] [INFO ] [Nat]Absence check using 401 positive place invariants in 51 ms returned sat
[2023-03-20 09:05:52] [INFO ] After 734ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 09:05:52] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2023-03-20 09:05:53] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2023-03-20 09:05:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
[2023-03-20 09:05:53] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 0 ms to minimize.
[2023-03-20 09:05:53] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2023-03-20 09:05:53] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-20 09:05:53] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2023-03-20 09:05:54] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2023-03-20 09:05:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 938 ms
[2023-03-20 09:05:54] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2023-03-20 09:05:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-20 09:05:54] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-20 09:05:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-20 09:05:54] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 1 ms to minimize.
[2023-03-20 09:05:55] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2023-03-20 09:05:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2023-03-20 09:05:55] [INFO ] After 3088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 280 ms.
[2023-03-20 09:05:55] [INFO ] After 3690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 21 factoid took 1107 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 101 reset in 709 ms.
Product exploration explored 100000 steps with 92 reset in 885 ms.
Support contains 8 out of 3303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Applied a total of 0 rules in 157 ms. Remains 3303 /3303 variables (removed 0) and now considering 3803/3803 (removed 0) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-20 09:05:59] [INFO ] Computed 401 place invariants in 24 ms
[2023-03-20 09:06:00] [INFO ] Implicit Places using invariants in 1022 ms returned []
[2023-03-20 09:06:00] [INFO ] Invariant cache hit.
[2023-03-20 09:06:04] [INFO ] Implicit Places using invariants and state equation in 4749 ms returned []
Implicit Place search using SMT with State Equation took 5797 ms to find 0 implicit places.
[2023-03-20 09:06:04] [INFO ] Invariant cache hit.
[2023-03-20 09:06:07] [INFO ] Dead Transitions using invariants and state equation in 2467 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8437 ms. Remains : 3303/3303 places, 3803/3803 transitions.
Treatment of property ShieldRVs-PT-100B-LTLFireability-00 finished in 135678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 2 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3304 transition count 3804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3304 transition count 3804
Applied a total of 26 rules in 346 ms. Remains 3304 /3317 variables (removed 13) and now considering 3804/3817 (removed 13) transitions.
// Phase 1: matrix 3804 rows 3304 cols
[2023-03-20 09:06:08] [INFO ] Computed 401 place invariants in 23 ms
[2023-03-20 09:06:09] [INFO ] Implicit Places using invariants in 924 ms returned []
[2023-03-20 09:06:09] [INFO ] Invariant cache hit.
[2023-03-20 09:06:13] [INFO ] Implicit Places using invariants and state equation in 3915 ms returned []
Implicit Place search using SMT with State Equation took 4863 ms to find 0 implicit places.
[2023-03-20 09:06:13] [INFO ] Invariant cache hit.
[2023-03-20 09:06:15] [INFO ] Dead Transitions using invariants and state equation in 2432 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3304/3317 places, 3804/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7655 ms. Remains : 3304/3317 places, 3804/3817 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s2604 1), p1:(NEQ s2932 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1016 ms.
Product exploration explored 100000 steps with 50000 reset in 1203 ms.
Computed a total of 801 stabilizing places and 801 stable transitions
Computed a total of 801 stabilizing places and 801 stable transitions
Detected a total of 801/3304 stabilizing places and 801/3804 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-100B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-100B-LTLFireability-03 finished in 10254 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 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3302 transition count 3802
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3302 transition count 3802
Applied a total of 30 rules in 402 ms. Remains 3302 /3317 variables (removed 15) and now considering 3802/3817 (removed 15) transitions.
// Phase 1: matrix 3802 rows 3302 cols
[2023-03-20 09:06:18] [INFO ] Computed 401 place invariants in 37 ms
[2023-03-20 09:06:19] [INFO ] Implicit Places using invariants in 961 ms returned []
[2023-03-20 09:06:19] [INFO ] Invariant cache hit.
[2023-03-20 09:06:23] [INFO ] Implicit Places using invariants and state equation in 4335 ms returned []
Implicit Place search using SMT with State Equation took 5310 ms to find 0 implicit places.
[2023-03-20 09:06:23] [INFO ] Invariant cache hit.
[2023-03-20 09:06:26] [INFO ] Dead Transitions using invariants and state equation in 2312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3302/3317 places, 3802/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8028 ms. Remains : 3302/3317 places, 3802/3817 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-04 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:(OR (NEQ s3289 1) (NEQ s3298 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 718 ms.
Entered a terminal (fully accepting) state of product in 89744 steps with 21 reset in 781 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-04 finished in 9686 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(G((F(p1)||p0))))'
Support contains 4 out of 3317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3316 transition count 3416
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2916 transition count 3416
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 800 place count 2916 transition count 2916
Deduced a syphon composed of 500 places in 11 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1800 place count 2416 transition count 2916
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1815 place count 2401 transition count 2901
Iterating global reduction 2 with 15 rules applied. Total rules applied 1830 place count 2401 transition count 2901
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1830 place count 2401 transition count 2896
Deduced a syphon composed of 5 places in 10 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1840 place count 2396 transition count 2896
Performed 991 Post agglomeration using F-continuation condition.Transition count delta: 991
Deduced a syphon composed of 991 places in 5 ms
Reduce places removed 991 places and 0 transitions.
Iterating global reduction 2 with 1982 rules applied. Total rules applied 3822 place count 1405 transition count 1905
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3824 place count 1403 transition count 1903
Applied a total of 3824 rules in 819 ms. Remains 1403 /3317 variables (removed 1914) and now considering 1903/3817 (removed 1914) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2023-03-20 09:06:28] [INFO ] Computed 401 place invariants in 4 ms
[2023-03-20 09:06:29] [INFO ] Implicit Places using invariants in 717 ms returned []
[2023-03-20 09:06:29] [INFO ] Invariant cache hit.
[2023-03-20 09:06:30] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 2065 ms to find 0 implicit places.
[2023-03-20 09:06:31] [INFO ] Redundant transitions in 698 ms returned [1902]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1902 rows 1403 cols
[2023-03-20 09:06:31] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-20 09:06:32] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1403/3317 places, 1902/3817 transitions.
Applied a total of 0 rules in 55 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4585 ms. Remains : 1403/3317 places, 1902/3817 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s516 0) (EQ s519 0) (EQ s528 0)), p1:(EQ s238 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 75 reset in 822 ms.
Product exploration explored 100000 steps with 75 reset in 951 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 09:06:34] [INFO ] Invariant cache hit.
[2023-03-20 09:06:34] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:06:35] [INFO ] [Nat]Absence check using 401 positive place invariants in 63 ms returned sat
[2023-03-20 09:06:35] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:06:35] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2023-03-20 09:06:36] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-20 09:06:36] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2023-03-20 09:06:36] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-20 09:06:36] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2023-03-20 09:06:36] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-20 09:06:36] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-03-20 09:06:36] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2023-03-20 09:06:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 868 ms
[2023-03-20 09:06:36] [INFO ] After 1462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-20 09:06:36] [INFO ] After 1740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1403 transition count 1902
Applied a total of 200 rules in 116 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 37534 steps, run visited all 1 properties in 434 ms. (steps per millisecond=86 )
Probabilistic random walk after 37534 steps, saw 36473 distinct states, run finished after 435 ms. (steps per millisecond=86 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 52 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2023-03-20 09:06:37] [INFO ] Invariant cache hit.
[2023-03-20 09:06:38] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-20 09:06:38] [INFO ] Invariant cache hit.
[2023-03-20 09:06:40] [INFO ] Implicit Places using invariants and state equation in 1529 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
[2023-03-20 09:06:40] [INFO ] Redundant transitions in 331 ms returned []
[2023-03-20 09:06:40] [INFO ] Invariant cache hit.
[2023-03-20 09:06:41] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3499 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2023-03-20 09:06:41] [INFO ] Invariant cache hit.
[2023-03-20 09:06:41] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:06:42] [INFO ] [Nat]Absence check using 401 positive place invariants in 52 ms returned sat
[2023-03-20 09:06:42] [INFO ] After 563ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:06:42] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2023-03-20 09:06:42] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2023-03-20 09:06:43] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-20 09:06:43] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2023-03-20 09:06:43] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-20 09:06:43] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2023-03-20 09:06:43] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2023-03-20 09:06:43] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-20 09:06:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 848 ms
[2023-03-20 09:06:43] [INFO ] After 1440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-20 09:06:43] [INFO ] After 1708ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1403 transition count 1902
Applied a total of 200 rules in 107 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 90 ms. (steps per millisecond=111 ) 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
Finished probabilistic random walk after 37534 steps, run visited all 1 properties in 446 ms. (steps per millisecond=84 )
Probabilistic random walk after 37534 steps, saw 36473 distinct states, run finished after 447 ms. (steps per millisecond=83 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 75 reset in 735 ms.
Product exploration explored 100000 steps with 75 reset in 1053 ms.
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 64 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2023-03-20 09:06:46] [INFO ] Invariant cache hit.
[2023-03-20 09:06:47] [INFO ] Implicit Places using invariants in 657 ms returned []
[2023-03-20 09:06:47] [INFO ] Invariant cache hit.
[2023-03-20 09:06:48] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
[2023-03-20 09:06:48] [INFO ] Redundant transitions in 289 ms returned []
[2023-03-20 09:06:48] [INFO ] Invariant cache hit.
[2023-03-20 09:06:49] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3259 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Treatment of property ShieldRVs-PT-100B-LTLFireability-05 finished in 22050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 3317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 401 transitions
Trivial Post-agglo rules discarded 401 transitions
Performed 401 trivial Post agglomeration. Transition count delta: 401
Iterating post reduction 0 with 401 rules applied. Total rules applied 401 place count 3316 transition count 3415
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 1 with 401 rules applied. Total rules applied 802 place count 2915 transition count 3415
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 802 place count 2915 transition count 2915
Deduced a syphon composed of 500 places in 12 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1802 place count 2415 transition count 2915
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1816 place count 2401 transition count 2901
Iterating global reduction 2 with 14 rules applied. Total rules applied 1830 place count 2401 transition count 2901
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1830 place count 2401 transition count 2897
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1838 place count 2397 transition count 2897
Performed 993 Post agglomeration using F-continuation condition.Transition count delta: 993
Deduced a syphon composed of 993 places in 6 ms
Reduce places removed 993 places and 0 transitions.
Iterating global reduction 2 with 1986 rules applied. Total rules applied 3824 place count 1404 transition count 1904
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3826 place count 1402 transition count 1902
Applied a total of 3826 rules in 756 ms. Remains 1402 /3317 variables (removed 1915) and now considering 1902/3817 (removed 1915) transitions.
// Phase 1: matrix 1902 rows 1402 cols
[2023-03-20 09:06:50] [INFO ] Computed 401 place invariants in 9 ms
[2023-03-20 09:06:51] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-20 09:06:51] [INFO ] Invariant cache hit.
[2023-03-20 09:06:52] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
[2023-03-20 09:06:52] [INFO ] Redundant transitions in 333 ms returned [1901]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1901 rows 1402 cols
[2023-03-20 09:06:52] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-20 09:06:53] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1402/3317 places, 1901/3817 transitions.
Applied a total of 0 rules in 64 ms. Remains 1402 /1402 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4036 ms. Remains : 1402/3317 places, 1901/3817 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s369 1) (EQ s371 1) (EQ s375 1) (EQ s418 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1292 steps with 0 reset in 10 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-06 finished in 4112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3303 transition count 3803
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3303 transition count 3803
Applied a total of 28 rules in 323 ms. Remains 3303 /3317 variables (removed 14) and now considering 3803/3817 (removed 14) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-20 09:06:54] [INFO ] Computed 401 place invariants in 24 ms
[2023-03-20 09:06:55] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2023-03-20 09:06:55] [INFO ] Invariant cache hit.
[2023-03-20 09:06:57] [INFO ] Implicit Places using invariants and state equation in 2160 ms returned []
Implicit Place search using SMT with State Equation took 3179 ms to find 0 implicit places.
[2023-03-20 09:06:57] [INFO ] Invariant cache hit.
[2023-03-20 09:07:00] [INFO ] Dead Transitions using invariants and state equation in 2596 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3303/3317 places, 3803/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6101 ms. Remains : 3303/3317 places, 3803/3817 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s2665 0) (EQ s3220 0)), p0:(EQ s2534 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 192 reset in 455 ms.
Product exploration explored 100000 steps with 189 reset in 481 ms.
Computed a total of 800 stabilizing places and 800 stable transitions
Computed a total of 800 stabilizing places and 800 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 323 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Applied a total of 0 rules in 199 ms. Remains 3303 /3303 variables (removed 0) and now considering 3803/3803 (removed 0) transitions.
[2023-03-20 09:07:01] [INFO ] Invariant cache hit.
[2023-03-20 09:07:02] [INFO ] Implicit Places using invariants in 929 ms returned []
[2023-03-20 09:07:02] [INFO ] Invariant cache hit.
[2023-03-20 09:07:05] [INFO ] Implicit Places using invariants and state equation in 2200 ms returned []
Implicit Place search using SMT with State Equation took 3131 ms to find 0 implicit places.
[2023-03-20 09:07:05] [INFO ] Invariant cache hit.
[2023-03-20 09:07:07] [INFO ] Dead Transitions using invariants and state equation in 2452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5796 ms. Remains : 3303/3303 places, 3803/3803 transitions.
Computed a total of 800 stabilizing places and 800 stable transitions
Computed a total of 800 stabilizing places and 800 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 249 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 194 reset in 450 ms.
Product exploration explored 100000 steps with 190 reset in 512 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 398 rules applied. Total rules applied 398 place count 3303 transition count 3803
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 398 place count 3303 transition count 3902
Deduced a syphon composed of 599 places in 13 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 599 place count 3303 transition count 3902
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 600 place count 3302 transition count 3901
Deduced a syphon composed of 598 places in 13 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 601 place count 3302 transition count 3901
Performed 1297 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1895 places in 8 ms
Iterating global reduction 1 with 1297 rules applied. Total rules applied 1898 place count 3302 transition count 3901
Renaming transitions due to excessive name length > 1024 char.
Discarding 697 places :
Symmetric choice reduction at 1 with 697 rule applications. Total rules 2595 place count 2605 transition count 3204
Deduced a syphon composed of 1198 places in 7 ms
Iterating global reduction 1 with 697 rules applied. Total rules applied 3292 place count 2605 transition count 3204
Deduced a syphon composed of 1198 places in 7 ms
Applied a total of 3292 rules in 2363 ms. Remains 2605 /3303 variables (removed 698) and now considering 3204/3803 (removed 599) transitions.
[2023-03-20 09:07:12] [INFO ] Redundant transitions in 1014 ms returned [3203]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 3203 rows 2605 cols
[2023-03-20 09:07:12] [INFO ] Computed 401 place invariants in 49 ms
[2023-03-20 09:07:14] [INFO ] Dead Transitions using invariants and state equation in 2058 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2605/3303 places, 3203/3803 transitions.
Deduced a syphon composed of 1198 places in 11 ms
Applied a total of 0 rules in 156 ms. Remains 2605 /2605 variables (removed 0) and now considering 3203/3203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5617 ms. Remains : 2605/3303 places, 3203/3803 transitions.
Support contains 3 out of 3303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3303/3303 places, 3803/3803 transitions.
Applied a total of 0 rules in 197 ms. Remains 3303 /3303 variables (removed 0) and now considering 3803/3803 (removed 0) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-20 09:07:15] [INFO ] Computed 401 place invariants in 23 ms
[2023-03-20 09:07:16] [INFO ] Implicit Places using invariants in 961 ms returned []
[2023-03-20 09:07:16] [INFO ] Invariant cache hit.
[2023-03-20 09:07:18] [INFO ] Implicit Places using invariants and state equation in 2106 ms returned []
Implicit Place search using SMT with State Equation took 3103 ms to find 0 implicit places.
[2023-03-20 09:07:18] [INFO ] Invariant cache hit.
[2023-03-20 09:07:20] [INFO ] Dead Transitions using invariants and state equation in 2480 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5800 ms. Remains : 3303/3303 places, 3803/3803 transitions.
Treatment of property ShieldRVs-PT-100B-LTLFireability-07 finished in 26862 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((G(p0)||G((p1||X(X(p2)))))))'
Support contains 5 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3303 transition count 3803
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3303 transition count 3803
Applied a total of 28 rules in 373 ms. Remains 3303 /3317 variables (removed 14) and now considering 3803/3817 (removed 14) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-20 09:07:21] [INFO ] Computed 401 place invariants in 23 ms
[2023-03-20 09:07:22] [INFO ] Implicit Places using invariants in 1126 ms returned []
[2023-03-20 09:07:22] [INFO ] Invariant cache hit.
[2023-03-20 09:07:26] [INFO ] Implicit Places using invariants and state equation in 4578 ms returned []
Implicit Place search using SMT with State Equation took 5741 ms to find 0 implicit places.
[2023-03-20 09:07:26] [INFO ] Invariant cache hit.
[2023-03-20 09:07:29] [INFO ] Dead Transitions using invariants and state equation in 2437 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3303/3317 places, 3803/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8564 ms. Remains : 3303/3317 places, 3803/3817 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={1} source=1 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}]], initial=0, aps=[p0:(AND (EQ s700 1) (EQ s709 1) (EQ s728 1)), p1:(EQ s1838 1), p2:(EQ s2044 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 44 reset in 647 ms.
Stuttering criterion allowed to conclude after 88979 steps with 38 reset in 702 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-08 finished in 10030 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(F(p1))&&(p2 U (p3||G(p2)))))))'
Support contains 5 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3303 transition count 3803
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3303 transition count 3803
Applied a total of 28 rules in 357 ms. Remains 3303 /3317 variables (removed 14) and now considering 3803/3817 (removed 14) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-20 09:07:31] [INFO ] Computed 401 place invariants in 23 ms
[2023-03-20 09:07:32] [INFO ] Implicit Places using invariants in 1055 ms returned []
[2023-03-20 09:07:32] [INFO ] Invariant cache hit.
[2023-03-20 09:07:36] [INFO ] Implicit Places using invariants and state equation in 3882 ms returned []
Implicit Place search using SMT with State Equation took 4961 ms to find 0 implicit places.
[2023-03-20 09:07:36] [INFO ] Invariant cache hit.
[2023-03-20 09:07:38] [INFO ] Dead Transitions using invariants and state equation in 2470 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3303/3317 places, 3803/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7790 ms. Remains : 3303/3317 places, 3803/3817 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s3182 1) (EQ s3216 1) (EQ s3237 1)), p3:(AND (NEQ s2256 1) (NEQ s1490 1)), p2:(NEQ s1490 1), p1:(OR (EQ s3182 0) (EQ s3216 0) (EQ s3237 0) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 726 ms.
Product exploration explored 100000 steps with 33333 reset in 897 ms.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p2 p1), (X (OR (AND (NOT p0) p3) (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), true, (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 8 factoid took 159 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-100B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-100B-LTLFireability-09 finished in 9797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 3317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3316 transition count 3416
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2916 transition count 3416
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 800 place count 2916 transition count 2916
Deduced a syphon composed of 500 places in 8 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1800 place count 2416 transition count 2916
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1813 place count 2403 transition count 2903
Iterating global reduction 2 with 13 rules applied. Total rules applied 1826 place count 2403 transition count 2903
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1826 place count 2403 transition count 2900
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1832 place count 2400 transition count 2900
Performed 994 Post agglomeration using F-continuation condition.Transition count delta: 994
Deduced a syphon composed of 994 places in 5 ms
Reduce places removed 994 places and 0 transitions.
Iterating global reduction 2 with 1988 rules applied. Total rules applied 3820 place count 1406 transition count 1906
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3822 place count 1404 transition count 1904
Applied a total of 3822 rules in 697 ms. Remains 1404 /3317 variables (removed 1913) and now considering 1904/3817 (removed 1913) transitions.
// Phase 1: matrix 1904 rows 1404 cols
[2023-03-20 09:07:41] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-20 09:07:42] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-20 09:07:42] [INFO ] Invariant cache hit.
[2023-03-20 09:07:43] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
[2023-03-20 09:07:43] [INFO ] Redundant transitions in 291 ms returned [1903]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1903 rows 1404 cols
[2023-03-20 09:07:43] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-20 09:07:44] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1404/3317 places, 1903/3817 transitions.
Applied a total of 0 rules in 58 ms. Remains 1404 /1404 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3889 ms. Remains : 1404/3317 places, 1903/3817 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1044 1), p1:(EQ s884 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1333 steps with 0 reset in 11 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-11 finished in 4081 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||G(p1))))'
Support contains 4 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3302 transition count 3802
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3302 transition count 3802
Applied a total of 30 rules in 362 ms. Remains 3302 /3317 variables (removed 15) and now considering 3802/3817 (removed 15) transitions.
// Phase 1: matrix 3802 rows 3302 cols
[2023-03-20 09:07:45] [INFO ] Computed 401 place invariants in 25 ms
[2023-03-20 09:07:46] [INFO ] Implicit Places using invariants in 943 ms returned []
[2023-03-20 09:07:46] [INFO ] Invariant cache hit.
[2023-03-20 09:07:47] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 2382 ms to find 0 implicit places.
[2023-03-20 09:07:47] [INFO ] Invariant cache hit.
[2023-03-20 09:07:49] [INFO ] Dead Transitions using invariants and state equation in 2466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3302/3317 places, 3802/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5213 ms. Remains : 3302/3317 places, 3802/3817 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s1153 1), p0:(AND (EQ s2157 1) (EQ s2193 1) (EQ s2212 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-12 finished in 5330 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||((p1 U (p2||G(p1))) U p3)))))'
Support contains 2 out of 3317 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 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3316 transition count 3416
Reduce places removed 400 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 401 rules applied. Total rules applied 801 place count 2916 transition count 3415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 802 place count 2915 transition count 3415
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 802 place count 2915 transition count 2916
Deduced a syphon composed of 499 places in 8 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 1800 place count 2416 transition count 2916
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1812 place count 2404 transition count 2904
Iterating global reduction 3 with 12 rules applied. Total rules applied 1824 place count 2404 transition count 2904
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1824 place count 2404 transition count 2899
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1834 place count 2399 transition count 2899
Performed 990 Post agglomeration using F-continuation condition.Transition count delta: 990
Deduced a syphon composed of 990 places in 5 ms
Reduce places removed 990 places and 0 transitions.
Iterating global reduction 3 with 1980 rules applied. Total rules applied 3814 place count 1409 transition count 1909
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3816 place count 1407 transition count 1907
Applied a total of 3816 rules in 688 ms. Remains 1407 /3317 variables (removed 1910) and now considering 1907/3817 (removed 1910) transitions.
// Phase 1: matrix 1907 rows 1407 cols
[2023-03-20 09:07:50] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-20 09:07:51] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-20 09:07:51] [INFO ] Invariant cache hit.
[2023-03-20 09:07:52] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
[2023-03-20 09:07:52] [INFO ] Redundant transitions in 299 ms returned [1906]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1906 rows 1407 cols
[2023-03-20 09:07:52] [INFO ] Computed 401 place invariants in 4 ms
[2023-03-20 09:07:53] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1407/3317 places, 1906/3817 transitions.
Applied a total of 0 rules in 56 ms. Remains 1407 /1407 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3782 ms. Remains : 1407/3317 places, 1906/3817 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(EQ s177 1), p0:(EQ s67 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 76 reset in 811 ms.
Product exploration explored 100000 steps with 76 reset in 1076 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1407 stabilizing places and 4/1906 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 76 ms. (steps per millisecond=131 ) 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 148881 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148881 steps, saw 117863 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 09:07:59] [INFO ] Invariant cache hit.
[2023-03-20 09:07:59] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:07:59] [INFO ] [Nat]Absence check using 401 positive place invariants in 57 ms returned sat
[2023-03-20 09:08:00] [INFO ] After 612ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:08:00] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-20 09:08:00] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 0 ms to minimize.
[2023-03-20 09:08:00] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2023-03-20 09:08:00] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2023-03-20 09:08:00] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2023-03-20 09:08:01] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2023-03-20 09:08:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 860 ms
[2023-03-20 09:08:01] [INFO ] After 1517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-20 09:08:01] [INFO ] After 1836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 1407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1407/1407 places, 1906/1906 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1405 transition count 1904
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 0 with 202 rules applied. Total rules applied 206 place count 1405 transition count 1904
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 207 place count 1404 transition count 1903
Applied a total of 207 rules in 230 ms. Remains 1404 /1407 variables (removed 3) and now considering 1903/1906 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 1404/1407 places, 1903/1906 transitions.
Finished random walk after 4499 steps, including 3 resets, run visited all 1 properties in 36 ms. (steps per millisecond=124 )
Knowledge obtained : [(AND (NOT p3) p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 2 out of 1407 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 : 1407/1407 places, 1906/1906 transitions.
Applied a total of 0 rules in 57 ms. Remains 1407 /1407 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
[2023-03-20 09:08:01] [INFO ] Invariant cache hit.
[2023-03-20 09:08:02] [INFO ] Implicit Places using invariants in 590 ms returned []
[2023-03-20 09:08:02] [INFO ] Invariant cache hit.
[2023-03-20 09:08:04] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 2252 ms to find 0 implicit places.
[2023-03-20 09:08:04] [INFO ] Redundant transitions in 349 ms returned []
[2023-03-20 09:08:04] [INFO ] Invariant cache hit.
[2023-03-20 09:08:05] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3562 ms. Remains : 1407/1407 places, 1906/1906 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/1407 stabilizing places and 4/1906 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Finished random walk after 5172 steps, including 3 resets, run visited all 1 properties in 40 ms. (steps per millisecond=129 )
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 76 reset in 736 ms.
Product exploration explored 100000 steps with 76 reset in 1110 ms.
Support contains 2 out of 1407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1407/1407 places, 1906/1906 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1405 transition count 1904
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1404 transition count 1903
Applied a total of 3 rules in 171 ms. Remains 1404 /1407 variables (removed 3) and now considering 1903/1906 (removed 3) transitions.
// Phase 1: matrix 1903 rows 1404 cols
[2023-03-20 09:08:08] [INFO ] Computed 401 place invariants in 6 ms
[2023-03-20 09:08:08] [INFO ] Implicit Places using invariants in 599 ms returned []
[2023-03-20 09:08:08] [INFO ] Invariant cache hit.
[2023-03-20 09:08:10] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
[2023-03-20 09:08:10] [INFO ] Redundant transitions in 285 ms returned []
[2023-03-20 09:08:10] [INFO ] Invariant cache hit.
[2023-03-20 09:08:11] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1404/1407 places, 1903/1906 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3398 ms. Remains : 1404/1407 places, 1903/1906 transitions.
Treatment of property ShieldRVs-PT-100B-LTLFireability-13 finished in 21286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))||X(F(p2))))'
Support contains 2 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3303 transition count 3803
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3303 transition count 3803
Applied a total of 28 rules in 421 ms. Remains 3303 /3317 variables (removed 14) and now considering 3803/3817 (removed 14) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2023-03-20 09:08:11] [INFO ] Computed 401 place invariants in 18 ms
[2023-03-20 09:08:12] [INFO ] Implicit Places using invariants in 1002 ms returned []
[2023-03-20 09:08:12] [INFO ] Invariant cache hit.
[2023-03-20 09:08:16] [INFO ] Implicit Places using invariants and state equation in 3851 ms returned []
Implicit Place search using SMT with State Equation took 4866 ms to find 0 implicit places.
[2023-03-20 09:08:16] [INFO ] Invariant cache hit.
[2023-03-20 09:08:18] [INFO ] Dead Transitions using invariants and state equation in 2305 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3303/3317 places, 3803/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7605 ms. Remains : 3303/3317 places, 3803/3817 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2883 1), p1:(EQ s2883 0), p2:(EQ s2964 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 132 reset in 478 ms.
Stuttering criterion allowed to conclude after 77016 steps with 97 reset in 492 ms.
FORMULA ShieldRVs-PT-100B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLFireability-14 finished in 8715 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((F(p0)&&(p1||F(p2))))))'
Support contains 5 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3304 transition count 3804
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3304 transition count 3804
Applied a total of 26 rules in 483 ms. Remains 3304 /3317 variables (removed 13) and now considering 3804/3817 (removed 13) transitions.
// Phase 1: matrix 3804 rows 3304 cols
[2023-03-20 09:08:20] [INFO ] Computed 401 place invariants in 21 ms
[2023-03-20 09:08:21] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2023-03-20 09:08:21] [INFO ] Invariant cache hit.
[2023-03-20 09:08:25] [INFO ] Implicit Places using invariants and state equation in 3915 ms returned []
Implicit Place search using SMT with State Equation took 4960 ms to find 0 implicit places.
[2023-03-20 09:08:25] [INFO ] Invariant cache hit.
[2023-03-20 09:08:27] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3304/3317 places, 3804/3817 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7270 ms. Remains : 3304/3317 places, 3804/3817 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s1778 1) (EQ s1781 1) (EQ s1788 1)), p2:(EQ s1619 1), p0:(EQ s2776 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 74 reset in 569 ms.
Product exploration explored 100000 steps with 76 reset in 621 ms.
Computed a total of 801 stabilizing places and 801 stable transitions
Computed a total of 801 stabilizing places and 801 stable transitions
Detected a total of 801/3304 stabilizing places and 801/3804 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 435 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 09:08:29] [INFO ] Invariant cache hit.
[2023-03-20 09:08:30] [INFO ] [Real]Absence check using 401 positive place invariants in 237 ms returned sat
[2023-03-20 09:08:30] [INFO ] After 692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:08:30] [INFO ] [Nat]Absence check using 401 positive place invariants in 202 ms returned sat
[2023-03-20 09:08:32] [INFO ] After 1949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:08:34] [INFO ] Deduced a trap composed of 14 places in 1100 ms of which 2 ms to minimize.
[2023-03-20 09:08:35] [INFO ] Deduced a trap composed of 34 places in 918 ms of which 1 ms to minimize.
[2023-03-20 09:08:36] [INFO ] Deduced a trap composed of 16 places in 997 ms of which 2 ms to minimize.
[2023-03-20 09:08:37] [INFO ] Deduced a trap composed of 47 places in 886 ms of which 2 ms to minimize.
[2023-03-20 09:08:38] [INFO ] Deduced a trap composed of 42 places in 881 ms of which 1 ms to minimize.
[2023-03-20 09:08:39] [INFO ] Deduced a trap composed of 26 places in 915 ms of which 1 ms to minimize.
[2023-03-20 09:08:40] [INFO ] Deduced a trap composed of 18 places in 965 ms of which 2 ms to minimize.
[2023-03-20 09:08:41] [INFO ] Deduced a trap composed of 33 places in 963 ms of which 2 ms to minimize.
[2023-03-20 09:08:42] [INFO ] Deduced a trap composed of 29 places in 931 ms of which 1 ms to minimize.
[2023-03-20 09:08:43] [INFO ] Deduced a trap composed of 26 places in 844 ms of which 1 ms to minimize.
[2023-03-20 09:08:44] [INFO ] Deduced a trap composed of 18 places in 901 ms of which 2 ms to minimize.
[2023-03-20 09:08:45] [INFO ] Deduced a trap composed of 31 places in 889 ms of which 2 ms to minimize.
[2023-03-20 09:08:46] [INFO ] Deduced a trap composed of 29 places in 873 ms of which 2 ms to minimize.
[2023-03-20 09:08:47] [INFO ] Deduced a trap composed of 23 places in 896 ms of which 1 ms to minimize.
[2023-03-20 09:08:48] [INFO ] Deduced a trap composed of 40 places in 856 ms of which 1 ms to minimize.
[2023-03-20 09:08:49] [INFO ] Deduced a trap composed of 27 places in 845 ms of which 1 ms to minimize.
[2023-03-20 09:08:50] [INFO ] Deduced a trap composed of 31 places in 917 ms of which 2 ms to minimize.
[2023-03-20 09:08:51] [INFO ] Deduced a trap composed of 67 places in 858 ms of which 2 ms to minimize.
[2023-03-20 09:08:52] [INFO ] Deduced a trap composed of 45 places in 840 ms of which 1 ms to minimize.
[2023-03-20 09:08:53] [INFO ] Deduced a trap composed of 40 places in 883 ms of which 1 ms to minimize.
[2023-03-20 09:08:54] [INFO ] Deduced a trap composed of 39 places in 830 ms of which 2 ms to minimize.
[2023-03-20 09:08:55] [INFO ] Deduced a trap composed of 40 places in 786 ms of which 2 ms to minimize.
[2023-03-20 09:08:55] [INFO ] Deduced a trap composed of 45 places in 852 ms of which 2 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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-20 09:08:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 09:08:55] [INFO ] After 25736ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 39 ms.
Support contains 5 out of 3304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3304/3304 places, 3804/3804 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3304 transition count 3404
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2904 transition count 3404
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 800 place count 2904 transition count 2905
Deduced a syphon composed of 499 places in 8 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1798 place count 2405 transition count 2905
Performed 999 Post agglomeration using F-continuation condition.Transition count delta: 999
Deduced a syphon composed of 999 places in 6 ms
Reduce places removed 999 places and 0 transitions.
Iterating global reduction 2 with 1998 rules applied. Total rules applied 3796 place count 1406 transition count 1906
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 2 with 202 rules applied. Total rules applied 3998 place count 1406 transition count 1906
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3999 place count 1405 transition count 1905
Applied a total of 3999 rules in 585 ms. Remains 1405 /3304 variables (removed 1899) and now considering 1905/3804 (removed 1899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 585 ms. Remains : 1405/3304 places, 1905/3804 transitions.
Finished random walk after 539 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 11 factoid took 558 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-20 09:08:57] [INFO ] Invariant cache hit.
[2023-03-20 09:09:00] [INFO ] [Real]Absence check using 401 positive place invariants in 837 ms returned sat
[2023-03-20 09:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:09:12] [INFO ] [Real]Absence check using state equation in 12424 ms returned unknown
Could not prove EG (NOT p0)
[2023-03-20 09:09:12] [INFO ] Invariant cache hit.
[2023-03-20 09:09:15] [INFO ] [Real]Absence check using 401 positive place invariants in 773 ms returned sat
[2023-03-20 09:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:09:27] [INFO ] [Real]Absence check using state equation in 12279 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 3304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3304/3304 places, 3804/3804 transitions.
Applied a total of 0 rules in 173 ms. Remains 3304 /3304 variables (removed 0) and now considering 3804/3804 (removed 0) transitions.
[2023-03-20 09:09:27] [INFO ] Invariant cache hit.
[2023-03-20 09:09:28] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2023-03-20 09:09:28] [INFO ] Invariant cache hit.
[2023-03-20 09:09:32] [INFO ] Implicit Places using invariants and state equation in 3991 ms returned []
Implicit Place search using SMT with State Equation took 5035 ms to find 0 implicit places.
[2023-03-20 09:09:32] [INFO ] Invariant cache hit.
[2023-03-20 09:09:35] [INFO ] Dead Transitions using invariants and state equation in 2423 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7647 ms. Remains : 3304/3304 places, 3804/3804 transitions.
Computed a total of 801 stabilizing places and 801 stable transitions
Computed a total of 801 stabilizing places and 801 stable transitions
Detected a total of 801/3304 stabilizing places and 801/3804 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 282 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 6083 steps, including 1 resets, run visited all 7 properties in 100 ms. (steps per millisecond=60 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 11 factoid took 411 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-20 09:09:36] [INFO ] Invariant cache hit.
[2023-03-20 09:09:39] [INFO ] [Real]Absence check using 401 positive place invariants in 880 ms returned sat
[2023-03-20 09:09:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:09:51] [INFO ] [Real]Absence check using state equation in 12417 ms returned unknown
Could not prove EG (NOT p0)
[2023-03-20 09:09:51] [INFO ] Invariant cache hit.
[2023-03-20 09:09:54] [INFO ] [Real]Absence check using 401 positive place invariants in 794 ms returned sat
[2023-03-20 09:09:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:10:06] [INFO ] [Real]Absence check using state equation in 12358 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 76 reset in 703 ms.
Product exploration explored 100000 steps with 74 reset in 696 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 3304 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3304/3304 places, 3804/3804 transitions.
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 3304 transition count 3804
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 399 place count 3304 transition count 3903
Deduced a syphon composed of 600 places in 12 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 600 place count 3304 transition count 3903
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 601 place count 3303 transition count 3902
Deduced a syphon composed of 599 places in 12 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 602 place count 3303 transition count 3902
Performed 1298 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1897 places in 20 ms
Iterating global reduction 1 with 1298 rules applied. Total rules applied 1900 place count 3303 transition count 3902
Renaming transitions due to excessive name length > 1024 char.
Discarding 698 places :
Symmetric choice reduction at 1 with 698 rule applications. Total rules 2598 place count 2605 transition count 3204
Deduced a syphon composed of 1199 places in 7 ms
Iterating global reduction 1 with 698 rules applied. Total rules applied 3296 place count 2605 transition count 3204
Deduced a syphon composed of 1199 places in 7 ms
Applied a total of 3296 rules in 1923 ms. Remains 2605 /3304 variables (removed 699) and now considering 3204/3804 (removed 600) transitions.
[2023-03-20 09:10:10] [INFO ] Redundant transitions in 461 ms returned [3203]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 3203 rows 2605 cols
[2023-03-20 09:10:10] [INFO ] Computed 401 place invariants in 48 ms
[2023-03-20 09:10:12] [INFO ] Dead Transitions using invariants and state equation in 1943 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2605/3304 places, 3203/3804 transitions.
Deduced a syphon composed of 1199 places in 7 ms
Applied a total of 0 rules in 125 ms. Remains 2605 /2605 variables (removed 0) and now considering 3203/3203 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4478 ms. Remains : 2605/3304 places, 3203/3804 transitions.
Support contains 5 out of 3304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3304/3304 places, 3804/3804 transitions.
Applied a total of 0 rules in 177 ms. Remains 3304 /3304 variables (removed 0) and now considering 3804/3804 (removed 0) transitions.
// Phase 1: matrix 3804 rows 3304 cols
[2023-03-20 09:10:13] [INFO ] Computed 401 place invariants in 22 ms
[2023-03-20 09:10:14] [INFO ] Implicit Places using invariants in 1071 ms returned []
[2023-03-20 09:10:14] [INFO ] Invariant cache hit.
[2023-03-20 09:10:18] [INFO ] Implicit Places using invariants and state equation in 4108 ms returned []
Implicit Place search using SMT with State Equation took 5205 ms to find 0 implicit places.
[2023-03-20 09:10:18] [INFO ] Invariant cache hit.
[2023-03-20 09:10:20] [INFO ] Dead Transitions using invariants and state equation in 2434 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7830 ms. Remains : 3304/3304 places, 3804/3804 transitions.
Treatment of property ShieldRVs-PT-100B-LTLFireability-15 finished in 120865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(p1 U G(p2)))))'
Found a Shortening insensitive property : ShieldRVs-PT-100B-LTLFireability-00
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0))]
Support contains 8 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 398 transitions
Trivial Post-agglo rules discarded 398 transitions
Performed 398 trivial Post agglomeration. Transition count delta: 398
Iterating post reduction 0 with 398 rules applied. Total rules applied 398 place count 3316 transition count 3418
Reduce places removed 398 places and 0 transitions.
Iterating post reduction 1 with 398 rules applied. Total rules applied 796 place count 2918 transition count 3418
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 796 place count 2918 transition count 2919
Deduced a syphon composed of 499 places in 8 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1794 place count 2419 transition count 2919
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1808 place count 2405 transition count 2905
Iterating global reduction 2 with 14 rules applied. Total rules applied 1822 place count 2405 transition count 2905
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1822 place count 2405 transition count 2901
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1830 place count 2401 transition count 2901
Performed 990 Post agglomeration using F-continuation condition.Transition count delta: 990
Deduced a syphon composed of 990 places in 6 ms
Reduce places removed 990 places and 0 transitions.
Iterating global reduction 2 with 1980 rules applied. Total rules applied 3810 place count 1411 transition count 1911
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3812 place count 1409 transition count 1909
Applied a total of 3812 rules in 657 ms. Remains 1409 /3317 variables (removed 1908) and now considering 1909/3817 (removed 1908) transitions.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-20 09:10:21] [INFO ] Computed 401 place invariants in 6 ms
[2023-03-20 09:10:22] [INFO ] Implicit Places using invariants in 636 ms returned []
[2023-03-20 09:10:22] [INFO ] Invariant cache hit.
[2023-03-20 09:10:23] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2023-03-20 09:10:23] [INFO ] Invariant cache hit.
[2023-03-20 09:10:24] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1409/3317 places, 1909/3817 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3502 ms. Remains : 1409/3317 places, 1909/3817 transitions.
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR p2 p1), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s730 1), p1:(EQ s744 1), p0:(OR (EQ s1086 0) (EQ s1104 0) (EQ s1115 0) (EQ s572 0) (EQ s575 0) (EQ s584 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 469 reset in 787 ms.
Product exploration explored 100000 steps with 505 reset in 1059 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 17 factoid took 895 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 09:10:28] [INFO ] Invariant cache hit.
[2023-03-20 09:10:28] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 09:10:29] [INFO ] [Nat]Absence check using 401 positive place invariants in 68 ms returned sat
[2023-03-20 09:10:30] [INFO ] After 986ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 09:10:30] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2023-03-20 09:10:30] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2023-03-20 09:10:30] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2023-03-20 09:10:30] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 0 ms to minimize.
[2023-03-20 09:10:31] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-20 09:10:31] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2023-03-20 09:10:31] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 0 ms to minimize.
[2023-03-20 09:10:31] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2023-03-20 09:10:31] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-20 09:10:31] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2023-03-20 09:10:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1655 ms
[2023-03-20 09:10:32] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2023-03-20 09:10:32] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2023-03-20 09:10:32] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-20 09:10:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 493 ms
[2023-03-20 09:10:32] [INFO ] After 3594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 385 ms.
[2023-03-20 09:10:33] [INFO ] After 4381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 283 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1409 transition count 1909
Applied a total of 201 rules in 145 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 115656 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115656 steps, saw 112887 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-20 09:10:37] [INFO ] Computed 401 place invariants in 6 ms
[2023-03-20 09:10:37] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 09:10:37] [INFO ] [Nat]Absence check using 401 positive place invariants in 79 ms returned sat
[2023-03-20 09:10:39] [INFO ] After 1037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 09:10:39] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2023-03-20 09:10:39] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-03-20 09:10:39] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2023-03-20 09:10:39] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2023-03-20 09:10:39] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2023-03-20 09:10:39] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-20 09:10:40] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2023-03-20 09:10:40] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 1 ms to minimize.
[2023-03-20 09:10:40] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2023-03-20 09:10:40] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2023-03-20 09:10:40] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-20 09:10:41] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2023-03-20 09:10:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2044 ms
[2023-03-20 09:10:41] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2023-03-20 09:10:41] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2023-03-20 09:10:41] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2023-03-20 09:10:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 522 ms
[2023-03-20 09:10:41] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2023-03-20 09:10:42] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2023-03-20 09:10:42] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2023-03-20 09:10:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 482 ms
[2023-03-20 09:10:42] [INFO ] After 4431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 378 ms.
[2023-03-20 09:10:42] [INFO ] After 5219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 174 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 77 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 76 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2023-03-20 09:10:43] [INFO ] Invariant cache hit.
[2023-03-20 09:10:43] [INFO ] Implicit Places using invariants in 767 ms returned []
[2023-03-20 09:10:43] [INFO ] Invariant cache hit.
[2023-03-20 09:10:45] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 2293 ms to find 0 implicit places.
[2023-03-20 09:10:45] [INFO ] Redundant transitions in 129 ms returned []
[2023-03-20 09:10:45] [INFO ] Invariant cache hit.
[2023-03-20 09:10:46] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3353 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 78 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-20 09:10:46] [INFO ] Invariant cache hit.
[2023-03-20 09:10:46] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 09:10:46] [INFO ] [Nat]Absence check using 401 positive place invariants in 52 ms returned sat
[2023-03-20 09:10:47] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 09:10:47] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2023-03-20 09:10:48] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2023-03-20 09:10:48] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-20 09:10:48] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2023-03-20 09:10:48] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-03-20 09:10:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 693 ms
[2023-03-20 09:10:48] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2023-03-20 09:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-20 09:10:49] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2023-03-20 09:10:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-20 09:10:49] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2023-03-20 09:10:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-20 09:10:49] [INFO ] After 2354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 341 ms.
[2023-03-20 09:10:49] [INFO ] After 3017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 17 factoid took 1095 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 81 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-20 09:10:51] [INFO ] Computed 401 place invariants in 8 ms
[2023-03-20 09:10:52] [INFO ] Implicit Places using invariants in 765 ms returned []
[2023-03-20 09:10:52] [INFO ] Invariant cache hit.
[2023-03-20 09:10:53] [INFO ] Implicit Places using invariants and state equation in 1461 ms returned []
Implicit Place search using SMT with State Equation took 2240 ms to find 0 implicit places.
[2023-03-20 09:10:53] [INFO ] Invariant cache hit.
[2023-03-20 09:10:54] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3099 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 17 factoid took 777 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-20 09:10:56] [INFO ] Invariant cache hit.
[2023-03-20 09:10:56] [INFO ] [Real]Absence check using 401 positive place invariants in 52 ms returned sat
[2023-03-20 09:10:56] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 09:10:57] [INFO ] [Nat]Absence check using 401 positive place invariants in 54 ms returned sat
[2023-03-20 09:10:58] [INFO ] After 996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 09:10:58] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2023-03-20 09:10:58] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-20 09:10:58] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2023-03-20 09:10:58] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 14 ms to minimize.
[2023-03-20 09:10:59] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2023-03-20 09:10:59] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-20 09:10:59] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2023-03-20 09:10:59] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2023-03-20 09:10:59] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2023-03-20 09:10:59] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-03-20 09:10:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1459 ms
[2023-03-20 09:10:59] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2023-03-20 09:11:00] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2023-03-20 09:11:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 366 ms
[2023-03-20 09:11:00] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2023-03-20 09:11:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-20 09:11:00] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-20 09:11:00] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-20 09:11:00] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2023-03-20 09:11:00] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2023-03-20 09:11:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 597 ms
[2023-03-20 09:11:01] [INFO ] After 4217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 604 ms.
[2023-03-20 09:11:02] [INFO ] After 5211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 450 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1409 transition count 1909
Applied a total of 201 rules in 140 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-20 09:11:03] [INFO ] Computed 401 place invariants in 19 ms
[2023-03-20 09:11:03] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 09:11:03] [INFO ] [Nat]Absence check using 401 positive place invariants in 54 ms returned sat
[2023-03-20 09:11:04] [INFO ] After 850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 09:11:05] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2023-03-20 09:11:05] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2023-03-20 09:11:05] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2023-03-20 09:11:05] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2023-03-20 09:11:05] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2023-03-20 09:11:05] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-20 09:11:06] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2023-03-20 09:11:06] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 0 ms to minimize.
[2023-03-20 09:11:06] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2023-03-20 09:11:06] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2023-03-20 09:11:06] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2023-03-20 09:11:06] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2023-03-20 09:11:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2194 ms
[2023-03-20 09:11:07] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-20 09:11:07] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2023-03-20 09:11:07] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2023-03-20 09:11:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 600 ms
[2023-03-20 09:11:08] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2023-03-20 09:11:08] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2023-03-20 09:11:08] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2023-03-20 09:11:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 744 ms
[2023-03-20 09:11:08] [INFO ] After 4778ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 350 ms.
[2023-03-20 09:11:09] [INFO ] After 5459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 228 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 84 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 108442 steps, run timeout after 3002 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108442 steps, saw 105863 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-20 09:11:13] [INFO ] Invariant cache hit.
[2023-03-20 09:11:13] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 09:11:13] [INFO ] [Nat]Absence check using 401 positive place invariants in 68 ms returned sat
[2023-03-20 09:11:14] [INFO ] After 845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 09:11:14] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2023-03-20 09:11:15] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-20 09:11:15] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-20 09:11:15] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2023-03-20 09:11:15] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-20 09:11:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 898 ms
[2023-03-20 09:11:16] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2023-03-20 09:11:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-20 09:11:16] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2023-03-20 09:11:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-20 09:11:16] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-20 09:11:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-20 09:11:16] [INFO ] After 2660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 316 ms.
[2023-03-20 09:11:16] [INFO ] After 3377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 266 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 77 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 76 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2023-03-20 09:11:17] [INFO ] Invariant cache hit.
[2023-03-20 09:11:18] [INFO ] Implicit Places using invariants in 756 ms returned []
[2023-03-20 09:11:18] [INFO ] Invariant cache hit.
[2023-03-20 09:11:19] [INFO ] Implicit Places using invariants and state equation in 1691 ms returned []
Implicit Place search using SMT with State Equation took 2462 ms to find 0 implicit places.
[2023-03-20 09:11:19] [INFO ] Redundant transitions in 148 ms returned []
[2023-03-20 09:11:19] [INFO ] Invariant cache hit.
[2023-03-20 09:11:20] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3542 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 62 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-20 09:11:20] [INFO ] Invariant cache hit.
[2023-03-20 09:11:21] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 09:11:21] [INFO ] [Nat]Absence check using 401 positive place invariants in 58 ms returned sat
[2023-03-20 09:11:22] [INFO ] After 961ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 09:11:22] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 0 ms to minimize.
[2023-03-20 09:11:22] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 1 ms to minimize.
[2023-03-20 09:11:23] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-20 09:11:23] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2023-03-20 09:11:23] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2023-03-20 09:11:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 989 ms
[2023-03-20 09:11:23] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2023-03-20 09:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-20 09:11:24] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2023-03-20 09:11:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-20 09:11:24] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-03-20 09:11:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-20 09:11:24] [INFO ] After 3029ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 353 ms.
[2023-03-20 09:11:24] [INFO ] After 3753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 17 factoid took 1205 ms. Reduced automaton from 5 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 524 reset in 998 ms.
Product exploration explored 100000 steps with 525 reset in 980 ms.
Support contains 8 out of 1409 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1409/1409 places, 1909/1909 transitions.
Applied a total of 0 rules in 94 ms. Remains 1409 /1409 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
// Phase 1: matrix 1909 rows 1409 cols
[2023-03-20 09:11:29] [INFO ] Computed 401 place invariants in 8 ms
[2023-03-20 09:11:29] [INFO ] Implicit Places using invariants in 734 ms returned []
[2023-03-20 09:11:29] [INFO ] Invariant cache hit.
[2023-03-20 09:11:31] [INFO ] Implicit Places using invariants and state equation in 1620 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
[2023-03-20 09:11:31] [INFO ] Invariant cache hit.
[2023-03-20 09:11:32] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3323 ms. Remains : 1409/1409 places, 1909/1909 transitions.
Treatment of property ShieldRVs-PT-100B-LTLFireability-00 finished in 71408 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(G((F(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Found a Shortening insensitive property : ShieldRVs-PT-100B-LTLFireability-07
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 399 transitions
Trivial Post-agglo rules discarded 399 transitions
Performed 399 trivial Post agglomeration. Transition count delta: 399
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 3316 transition count 3417
Reduce places removed 399 places and 0 transitions.
Iterating post reduction 1 with 399 rules applied. Total rules applied 798 place count 2917 transition count 3417
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 798 place count 2917 transition count 2918
Deduced a syphon composed of 499 places in 9 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1796 place count 2418 transition count 2918
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1810 place count 2404 transition count 2904
Iterating global reduction 2 with 14 rules applied. Total rules applied 1824 place count 2404 transition count 2904
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1824 place count 2404 transition count 2899
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1834 place count 2399 transition count 2899
Performed 991 Post agglomeration using F-continuation condition.Transition count delta: 991
Deduced a syphon composed of 991 places in 5 ms
Reduce places removed 991 places and 0 transitions.
Iterating global reduction 2 with 1982 rules applied. Total rules applied 3816 place count 1408 transition count 1908
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3818 place count 1406 transition count 1906
Applied a total of 3818 rules in 716 ms. Remains 1406 /3317 variables (removed 1911) and now considering 1906/3817 (removed 1911) transitions.
// Phase 1: matrix 1906 rows 1406 cols
[2023-03-20 09:11:33] [INFO ] Computed 401 place invariants in 5 ms
[2023-03-20 09:11:34] [INFO ] Implicit Places using invariants in 740 ms returned []
[2023-03-20 09:11:34] [INFO ] Invariant cache hit.
[2023-03-20 09:11:35] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
[2023-03-20 09:11:35] [INFO ] Invariant cache hit.
[2023-03-20 09:11:36] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1406/3317 places, 1906/3817 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3615 ms. Remains : 1406/3317 places, 1906/3817 transitions.
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s1125 0) (EQ s1368 0)), p0:(EQ s1067 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 22437 reset in 834 ms.
Product exploration explored 100000 steps with 22278 reset in 1014 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 1 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 230 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1406/1406 places, 1906/1906 transitions.
Applied a total of 0 rules in 76 ms. Remains 1406 /1406 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
[2023-03-20 09:11:38] [INFO ] Invariant cache hit.
[2023-03-20 09:11:39] [INFO ] Implicit Places using invariants in 737 ms returned []
[2023-03-20 09:11:39] [INFO ] Invariant cache hit.
[2023-03-20 09:11:41] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 2255 ms to find 0 implicit places.
[2023-03-20 09:11:41] [INFO ] Invariant cache hit.
[2023-03-20 09:11:42] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3192 ms. Remains : 1406/1406 places, 1906/1906 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 230 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22247 reset in 1079 ms.
Product exploration explored 100000 steps with 22457 reset in 1165 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1406 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1406/1406 places, 1906/1906 transitions.
Applied a total of 0 rules in 62 ms. Remains 1406 /1406 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
[2023-03-20 09:11:45] [INFO ] Redundant transitions in 369 ms returned [1905]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1905 rows 1406 cols
[2023-03-20 09:11:45] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-20 09:11:46] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1406/1406 places, 1905/1906 transitions.
Applied a total of 0 rules in 66 ms. Remains 1406 /1406 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1404 ms. Remains : 1406/1406 places, 1905/1906 transitions.
Support contains 3 out of 1406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1406/1406 places, 1906/1906 transitions.
Applied a total of 0 rules in 47 ms. Remains 1406 /1406 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
// Phase 1: matrix 1906 rows 1406 cols
[2023-03-20 09:11:46] [INFO ] Computed 401 place invariants in 8 ms
[2023-03-20 09:11:47] [INFO ] Implicit Places using invariants in 666 ms returned []
[2023-03-20 09:11:47] [INFO ] Invariant cache hit.
[2023-03-20 09:11:48] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 2078 ms to find 0 implicit places.
[2023-03-20 09:11:48] [INFO ] Invariant cache hit.
[2023-03-20 09:11:49] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2969 ms. Remains : 1406/1406 places, 1906/1906 transitions.
Treatment of property ShieldRVs-PT-100B-LTLFireability-07 finished in 17258 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||((p1 U (p2||G(p1))) U p3)))))'
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((F(p0)&&(p1||F(p2))))))'
Found a Shortening insensitive property : ShieldRVs-PT-100B-LTLFireability-15
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 3317 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3317/3317 places, 3817/3817 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3316 transition count 3416
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2916 transition count 3416
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 800 place count 2916 transition count 2917
Deduced a syphon composed of 499 places in 9 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1798 place count 2417 transition count 2917
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1811 place count 2404 transition count 2904
Iterating global reduction 2 with 13 rules applied. Total rules applied 1824 place count 2404 transition count 2904
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1824 place count 2404 transition count 2900
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1832 place count 2400 transition count 2900
Performed 993 Post agglomeration using F-continuation condition.Transition count delta: 993
Deduced a syphon composed of 993 places in 6 ms
Reduce places removed 993 places and 0 transitions.
Iterating global reduction 2 with 1986 rules applied. Total rules applied 3818 place count 1407 transition count 1907
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3820 place count 1405 transition count 1905
Applied a total of 3820 rules in 679 ms. Remains 1405 /3317 variables (removed 1912) and now considering 1905/3817 (removed 1912) transitions.
// Phase 1: matrix 1905 rows 1405 cols
[2023-03-20 09:11:50] [INFO ] Computed 401 place invariants in 7 ms
[2023-03-20 09:11:51] [INFO ] Implicit Places using invariants in 685 ms returned []
[2023-03-20 09:11:51] [INFO ] Invariant cache hit.
[2023-03-20 09:11:52] [INFO ] Implicit Places using invariants and state equation in 1367 ms returned []
Implicit Place search using SMT with State Equation took 2055 ms to find 0 implicit places.
[2023-03-20 09:11:52] [INFO ] Invariant cache hit.
[2023-03-20 09:11:53] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1405/3317 places, 1905/3817 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3576 ms. Remains : 1405/3317 places, 1905/3817 transitions.
Running random walk in product with property : ShieldRVs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s736 1) (EQ s738 1) (EQ s742 1)), p2:(EQ s665 1), p0:(EQ s1173 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 485 reset in 799 ms.
Product exploration explored 100000 steps with 488 reset in 1088 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1405 stabilizing places and 2/1905 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 6 factoid took 382 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 4605 steps, including 3 resets, run visited all 7 properties in 64 ms. (steps per millisecond=71 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 619 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-20 09:11:57] [INFO ] Invariant cache hit.
[2023-03-20 09:11:58] [INFO ] [Real]Absence check using 401 positive place invariants in 183 ms returned sat
[2023-03-20 09:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:12:02] [INFO ] [Real]Absence check using state equation in 3488 ms returned sat
[2023-03-20 09:12:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:12:03] [INFO ] [Nat]Absence check using 401 positive place invariants in 199 ms returned sat
[2023-03-20 09:12:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:12:06] [INFO ] [Nat]Absence check using state equation in 2917 ms returned sat
[2023-03-20 09:12:06] [INFO ] Computed and/alt/rep : 1701/7381/1701 causal constraints (skipped 201 transitions) in 127 ms.
[2023-03-20 09:12:18] [INFO ] Deduced a trap composed of 2 places in 913 ms of which 2 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-20 09:12:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
[2023-03-20 09:12:18] [INFO ] Invariant cache hit.
[2023-03-20 09:12:19] [INFO ] [Real]Absence check using 401 positive place invariants in 185 ms returned sat
[2023-03-20 09:12:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:12:22] [INFO ] [Real]Absence check using state equation in 2803 ms returned sat
[2023-03-20 09:12:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:12:23] [INFO ] [Nat]Absence check using 401 positive place invariants in 188 ms returned sat
[2023-03-20 09:12:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:12:27] [INFO ] [Nat]Absence check using state equation in 3249 ms returned sat
[2023-03-20 09:12:27] [INFO ] Computed and/alt/rep : 1701/7381/1701 causal constraints (skipped 201 transitions) in 131 ms.
[2023-03-20 09:12:37] [INFO ] Added : 365 causal constraints over 73 iterations in 10315 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 1405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1405/1405 places, 1905/1905 transitions.
Applied a total of 0 rules in 94 ms. Remains 1405 /1405 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
[2023-03-20 09:12:37] [INFO ] Invariant cache hit.
[2023-03-20 09:12:38] [INFO ] Implicit Places using invariants in 693 ms returned []
[2023-03-20 09:12:38] [INFO ] Invariant cache hit.
[2023-03-20 09:12:39] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 2222 ms to find 0 implicit places.
[2023-03-20 09:12:39] [INFO ] Invariant cache hit.
[2023-03-20 09:12:40] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3136 ms. Remains : 1405/1405 places, 1905/1905 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1405 stabilizing places and 2/1905 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 371 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 3232 steps, including 2 resets, run visited all 7 properties in 35 ms. (steps per millisecond=92 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 563 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-20 09:12:42] [INFO ] Invariant cache hit.
[2023-03-20 09:12:43] [INFO ] [Real]Absence check using 401 positive place invariants in 185 ms returned sat
[2023-03-20 09:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:12:46] [INFO ] [Real]Absence check using state equation in 3477 ms returned sat
[2023-03-20 09:12:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:12:48] [INFO ] [Nat]Absence check using 401 positive place invariants in 185 ms returned sat
[2023-03-20 09:12:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:12:51] [INFO ] [Nat]Absence check using state equation in 2958 ms returned sat
[2023-03-20 09:12:51] [INFO ] Computed and/alt/rep : 1701/7381/1701 causal constraints (skipped 201 transitions) in 127 ms.
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-20 09:13:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
[2023-03-20 09:13:02] [INFO ] Invariant cache hit.
[2023-03-20 09:13:03] [INFO ] [Real]Absence check using 401 positive place invariants in 203 ms returned sat
[2023-03-20 09:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 09:13:06] [INFO ] [Real]Absence check using state equation in 2652 ms returned sat
[2023-03-20 09:13:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 09:13:07] [INFO ] [Nat]Absence check using 401 positive place invariants in 205 ms returned sat
[2023-03-20 09:13:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 09:13:10] [INFO ] [Nat]Absence check using state equation in 3113 ms returned sat
[2023-03-20 09:13:11] [INFO ] Computed and/alt/rep : 1701/7381/1701 causal constraints (skipped 201 transitions) in 118 ms.
[2023-03-20 09:13:22] [INFO ] Deduced a trap composed of 2 places in 1263 ms of which 2 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-20 09:13:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 488 reset in 940 ms.
Product exploration explored 100000 steps with 487 reset in 1052 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 1405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1405/1405 places, 1905/1905 transitions.
Applied a total of 0 rules in 101 ms. Remains 1405 /1405 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
[2023-03-20 09:13:25] [INFO ] Redundant transitions in 398 ms returned [1904]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1904 rows 1405 cols
[2023-03-20 09:13:25] [INFO ] Computed 401 place invariants in 4 ms
[2023-03-20 09:13:26] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1405/1405 places, 1904/1905 transitions.
Applied a total of 0 rules in 53 ms. Remains 1405 /1405 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1456 ms. Remains : 1405/1405 places, 1904/1905 transitions.
Support contains 5 out of 1405 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1405/1405 places, 1905/1905 transitions.
Applied a total of 0 rules in 43 ms. Remains 1405 /1405 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
// Phase 1: matrix 1905 rows 1405 cols
[2023-03-20 09:13:26] [INFO ] Computed 401 place invariants in 8 ms
[2023-03-20 09:13:27] [INFO ] Implicit Places using invariants in 640 ms returned []
[2023-03-20 09:13:27] [INFO ] Invariant cache hit.
[2023-03-20 09:13:28] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 2114 ms to find 0 implicit places.
[2023-03-20 09:13:28] [INFO ] Invariant cache hit.
[2023-03-20 09:13:29] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2969 ms. Remains : 1405/1405 places, 1905/1905 transitions.
Treatment of property ShieldRVs-PT-100B-LTLFireability-15 finished in 99782 ms.
[2023-03-20 09:13:30] [INFO ] Flatten gal took : 347 ms
[2023-03-20 09:13:30] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2023-03-20 09:13:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3317 places, 3817 transitions and 13028 arcs took 34 ms.
Total runtime 652086 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4452/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4452/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4452/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4452/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/4452/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVs-PT-100B-LTLFireability-00
Could not compute solution for formula : ShieldRVs-PT-100B-LTLFireability-05
Could not compute solution for formula : ShieldRVs-PT-100B-LTLFireability-07
Could not compute solution for formula : ShieldRVs-PT-100B-LTLFireability-13
Could not compute solution for formula : ShieldRVs-PT-100B-LTLFireability-15

BK_STOP 1679303623331

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldRVs-PT-100B-LTLFireability-00
ltl formula formula --ltl=/tmp/4452/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3317 places, 3817 transitions and 13028 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.210 user 0.240 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4452/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4452/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4452/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4452/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldRVs-PT-100B-LTLFireability-05
ltl formula formula --ltl=/tmp/4452/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3317 places, 3817 transitions and 13028 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4452/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4452/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.140 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4452/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4452/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldRVs-PT-100B-LTLFireability-07
ltl formula formula --ltl=/tmp/4452/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3317 places, 3817 transitions and 13028 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4452/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4452/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.750 real 0.130 user 0.220 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4452/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4452/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldRVs-PT-100B-LTLFireability-13
ltl formula formula --ltl=/tmp/4452/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3317 places, 3817 transitions and 13028 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4452/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4452/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4452/ltl_3_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.800 real 0.160 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4452/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55b1d0fa23f4]
1: pnml2lts-mc(+0xa2496) [0x55b1d0fa2496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f42056c0140]
3: pnml2lts-mc(+0x405be5) [0x55b1d1305be5]
4: pnml2lts-mc(+0x16b3f9) [0x55b1d106b3f9]
5: pnml2lts-mc(+0x164ac4) [0x55b1d1064ac4]
6: pnml2lts-mc(+0x272e0a) [0x55b1d1172e0a]
7: pnml2lts-mc(+0xb61f0) [0x55b1d0fb61f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f42055134d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f420551367a]
10: pnml2lts-mc(+0xa1581) [0x55b1d0fa1581]
11: pnml2lts-mc(+0xa1910) [0x55b1d0fa1910]
12: pnml2lts-mc(+0xa32a2) [0x55b1d0fa32a2]
13: pnml2lts-mc(+0xa50f4) [0x55b1d0fa50f4]
14: pnml2lts-mc(+0xa516b) [0x55b1d0fa516b]
15: pnml2lts-mc(+0x3f34b3) [0x55b1d12f34b3]
16: pnml2lts-mc(+0x7c63d) [0x55b1d0f7c63d]
17: pnml2lts-mc(+0x67d86) [0x55b1d0f67d86]
18: pnml2lts-mc(+0x60a8a) [0x55b1d0f60a8a]
19: pnml2lts-mc(+0x5eb15) [0x55b1d0f5eb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f42054fbd0a]
21: pnml2lts-mc(+0x6075e) [0x55b1d0f6075e]
ltl formula name ShieldRVs-PT-100B-LTLFireability-15
ltl formula formula --ltl=/tmp/4452/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3317 places, 3817 transitions and 13028 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.770 real 0.160 user 0.260 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4452/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4452/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4452/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4452/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

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="ShieldRVs-PT-100B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-100B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905977800172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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