Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903717300699.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPt-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300699
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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.9M 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 ShieldPPPt-PT-100B-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-100B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679471811242

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:56:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 07:56:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:56:54] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2023-03-22 07:56:55] [INFO ] Transformed 7803 places.
[2023-03-22 07:56:55] [INFO ] Transformed 7103 transitions.
[2023-03-22 07:56:55] [INFO ] Found NUPN structural information;
[2023-03-22 07:56:55] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 658 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 7803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Discarding 1095 places :
Symmetric choice reduction at 0 with 1095 rule applications. Total rules 1095 place count 6708 transition count 6008
Iterating global reduction 0 with 1095 rules applied. Total rules applied 2190 place count 6708 transition count 6008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2191 place count 6707 transition count 6007
Iterating global reduction 0 with 1 rules applied. Total rules applied 2192 place count 6707 transition count 6007
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2193 place count 6706 transition count 6006
Iterating global reduction 0 with 1 rules applied. Total rules applied 2194 place count 6706 transition count 6006
Applied a total of 2194 rules in 5454 ms. Remains 6706 /7803 variables (removed 1097) and now considering 6006/7103 (removed 1097) transitions.
// Phase 1: matrix 6006 rows 6706 cols
[2023-03-22 07:57:01] [INFO ] Computed 1101 place invariants in 145 ms
[2023-03-22 07:57:07] [INFO ] Implicit Places using invariants in 5944 ms returned []
[2023-03-22 07:57:07] [INFO ] Invariant cache hit.
[2023-03-22 07:57:07] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 6942 ms to find 0 implicit places.
[2023-03-22 07:57:07] [INFO ] Invariant cache hit.
[2023-03-22 07:57:13] [INFO ] Dead Transitions using invariants and state equation in 5686 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6706/7803 places, 6006/7103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18095 ms. Remains : 6706/7803 places, 6006/7103 transitions.
Support contains 29 out of 6706 places after structural reductions.
[2023-03-22 07:57:14] [INFO ] Flatten gal took : 333 ms
[2023-03-22 07:57:14] [INFO ] Flatten gal took : 221 ms
[2023-03-22 07:57:15] [INFO ] Input system was already deterministic with 6006 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-22 07:57:16] [INFO ] Invariant cache hit.
[2023-03-22 07:57:18] [INFO ] After 2010ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 07:57:20] [INFO ] [Nat]Absence check using 1101 positive place invariants in 830 ms returned sat
[2023-03-22 07:57:30] [INFO ] After 8175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 07:57:33] [INFO ] Deduced a trap composed of 21 places in 2739 ms of which 12 ms to minimize.
[2023-03-22 07:57:36] [INFO ] Deduced a trap composed of 27 places in 2844 ms of which 5 ms to minimize.
[2023-03-22 07:57:39] [INFO ] Deduced a trap composed of 26 places in 2936 ms of which 17 ms to minimize.
[2023-03-22 07:57:42] [INFO ] Deduced a trap composed of 28 places in 2800 ms of which 4 ms to minimize.
[2023-03-22 07:57:45] [INFO ] Deduced a trap composed of 32 places in 2949 ms of which 16 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-22 07:57:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:57:45] [INFO ] After 27554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 3979 ms.
Support contains 21 out of 6706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Drop transitions removed 1383 transitions
Trivial Post-agglo rules discarded 1383 transitions
Performed 1383 trivial Post agglomeration. Transition count delta: 1383
Iterating post reduction 0 with 1383 rules applied. Total rules applied 1383 place count 6706 transition count 4623
Reduce places removed 1383 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1387 rules applied. Total rules applied 2770 place count 5323 transition count 4619
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2774 place count 5319 transition count 4619
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2774 place count 5319 transition count 3820
Deduced a syphon composed of 799 places in 12 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 4372 place count 4520 transition count 3820
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 4373 place count 4519 transition count 3819
Iterating global reduction 3 with 1 rules applied. Total rules applied 4374 place count 4519 transition count 3819
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4374 place count 4519 transition count 3818
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4376 place count 4518 transition count 3818
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 13 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 3 with 3390 rules applied. Total rules applied 7766 place count 2823 transition count 2123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7767 place count 2823 transition count 2122
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 7769 place count 2822 transition count 2121
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7971 place count 2721 transition count 2121
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8173 place count 2620 transition count 2121
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 4 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 8355 place count 2529 transition count 2121
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8356 place count 2529 transition count 2120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8357 place count 2528 transition count 2120
Partial Free-agglomeration rule applied 295 times.
Drop transitions removed 295 transitions
Iterating global reduction 5 with 295 rules applied. Total rules applied 8652 place count 2528 transition count 2120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8653 place count 2527 transition count 2119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8654 place count 2526 transition count 2119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 8654 place count 2526 transition count 2117
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 8658 place count 2524 transition count 2117
Applied a total of 8658 rules in 2800 ms. Remains 2524 /6706 variables (removed 4182) and now considering 2117/6006 (removed 3889) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2801 ms. Remains : 2524/6706 places, 2117/6006 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2117 rows 2524 cols
[2023-03-22 07:57:54] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-22 07:57:55] [INFO ] After 1056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 07:57:56] [INFO ] [Nat]Absence check using 1100 positive place invariants in 364 ms returned sat
[2023-03-22 07:57:59] [INFO ] After 2359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 07:57:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 07:58:00] [INFO ] After 724ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 07:58:00] [INFO ] Deduced a trap composed of 8 places in 354 ms of which 1 ms to minimize.
[2023-03-22 07:58:01] [INFO ] Deduced a trap composed of 7 places in 276 ms of which 0 ms to minimize.
[2023-03-22 07:58:01] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 1 ms to minimize.
[2023-03-22 07:58:01] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 0 ms to minimize.
[2023-03-22 07:58:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1606 ms
[2023-03-22 07:58:03] [INFO ] Deduced a trap composed of 3 places in 256 ms of which 0 ms to minimize.
[2023-03-22 07:58:03] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2023-03-22 07:58:04] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 1 ms to minimize.
[2023-03-22 07:58:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1177 ms
[2023-03-22 07:58:04] [INFO ] After 5052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 973 ms.
[2023-03-22 07:58:05] [INFO ] After 10129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 976 ms.
Support contains 19 out of 2524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2524/2524 places, 2117/2117 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2524 transition count 2116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2523 transition count 2116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2522 transition count 2115
Applied a total of 4 rules in 204 ms. Remains 2522 /2524 variables (removed 2) and now considering 2115/2117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 2522/2524 places, 2115/2117 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2115 rows 2522 cols
[2023-03-22 07:58:08] [INFO ] Computed 1100 place invariants in 6 ms
[2023-03-22 07:58:08] [INFO ] [Real]Absence check using 1100 positive place invariants in 279 ms returned sat
[2023-03-22 07:58:08] [INFO ] After 951ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 07:58:09] [INFO ] [Nat]Absence check using 1100 positive place invariants in 366 ms returned sat
[2023-03-22 07:58:12] [INFO ] After 1792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 07:58:12] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 07:58:12] [INFO ] After 767ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 07:58:13] [INFO ] Deduced a trap composed of 5 places in 375 ms of which 1 ms to minimize.
[2023-03-22 07:58:13] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2023-03-22 07:58:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 835 ms
[2023-03-22 07:58:14] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 1 ms to minimize.
[2023-03-22 07:58:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 494 ms
[2023-03-22 07:58:15] [INFO ] After 2982ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 707 ms.
[2023-03-22 07:58:15] [INFO ] After 6873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 291 ms.
Support contains 13 out of 2522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2522/2522 places, 2115/2115 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2522 transition count 2114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2521 transition count 2114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 2521 transition count 2112
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 2519 transition count 2112
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 2 with 2 rules applied. Total rules applied 8 place count 2518 transition count 2111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 2517 transition count 2111
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 2517 transition count 2111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 2516 transition count 2110
Applied a total of 12 rules in 485 ms. Remains 2516 /2522 variables (removed 6) and now considering 2110/2115 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 2516/2522 places, 2110/2115 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 42556 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42556 steps, saw 35329 distinct states, run finished after 3002 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2110 rows 2516 cols
[2023-03-22 07:58:20] [INFO ] Computed 1100 place invariants in 4 ms
[2023-03-22 07:58:21] [INFO ] [Real]Absence check using 1100 positive place invariants in 497 ms returned sat
[2023-03-22 07:58:21] [INFO ] After 1096ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 07:58:22] [INFO ] [Nat]Absence check using 1100 positive place invariants in 306 ms returned sat
[2023-03-22 07:58:24] [INFO ] After 1817ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 07:58:24] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 07:58:25] [INFO ] After 732ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 07:58:25] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 1 ms to minimize.
[2023-03-22 07:58:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 530 ms
[2023-03-22 07:58:27] [INFO ] After 2429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 770 ms.
[2023-03-22 07:58:27] [INFO ] After 6097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 375 ms.
Support contains 13 out of 2516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2516/2516 places, 2110/2110 transitions.
Applied a total of 0 rules in 102 ms. Remains 2516 /2516 variables (removed 0) and now considering 2110/2110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 2516/2516 places, 2110/2110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2516/2516 places, 2110/2110 transitions.
Applied a total of 0 rules in 103 ms. Remains 2516 /2516 variables (removed 0) and now considering 2110/2110 (removed 0) transitions.
[2023-03-22 07:58:28] [INFO ] Invariant cache hit.
[2023-03-22 07:58:30] [INFO ] Implicit Places using invariants in 2455 ms returned [2499, 2503]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2459 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2514/2516 places, 2110/2110 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2512 transition count 2108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2512 transition count 2108
Applied a total of 4 rules in 174 ms. Remains 2512 /2514 variables (removed 2) and now considering 2108/2110 (removed 2) transitions.
// Phase 1: matrix 2108 rows 2512 cols
[2023-03-22 07:58:31] [INFO ] Computed 1098 place invariants in 11 ms
[2023-03-22 07:58:33] [INFO ] Implicit Places using invariants in 2000 ms returned []
[2023-03-22 07:58:33] [INFO ] Invariant cache hit.
[2023-03-22 07:58:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-22 07:58:38] [INFO ] Implicit Places using invariants and state equation in 4968 ms returned []
Implicit Place search using SMT with State Equation took 7010 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2512/2516 places, 2108/2110 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9746 ms. Remains : 2512/2516 places, 2108/2110 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 44055 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 44055 steps, saw 36505 distinct states, run finished after 3002 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-22 07:58:42] [INFO ] Invariant cache hit.
[2023-03-22 07:58:43] [INFO ] [Real]Absence check using 1098 positive place invariants in 438 ms returned sat
[2023-03-22 07:58:43] [INFO ] After 1153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 07:58:44] [INFO ] [Nat]Absence check using 1098 positive place invariants in 705 ms returned sat
[2023-03-22 07:58:47] [INFO ] After 1948ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 07:58:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-22 07:58:47] [INFO ] After 643ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 07:58:48] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
[2023-03-22 07:58:48] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 14 ms to minimize.
[2023-03-22 07:58:48] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2023-03-22 07:58:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1127 ms
[2023-03-22 07:58:49] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 1 ms to minimize.
[2023-03-22 07:58:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2023-03-22 07:58:49] [INFO ] After 2816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 554 ms.
[2023-03-22 07:58:50] [INFO ] After 6765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 191 ms.
Support contains 13 out of 2512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2512/2512 places, 2108/2108 transitions.
Applied a total of 0 rules in 105 ms. Remains 2512 /2512 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 2512/2512 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2512/2512 places, 2108/2108 transitions.
Applied a total of 0 rules in 104 ms. Remains 2512 /2512 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-22 07:58:50] [INFO ] Invariant cache hit.
[2023-03-22 07:58:52] [INFO ] Implicit Places using invariants in 1975 ms returned []
[2023-03-22 07:58:52] [INFO ] Invariant cache hit.
[2023-03-22 07:58:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-22 07:58:57] [INFO ] Implicit Places using invariants and state equation in 4435 ms returned []
Implicit Place search using SMT with State Equation took 6425 ms to find 0 implicit places.
[2023-03-22 07:58:57] [INFO ] Redundant transitions in 187 ms returned []
[2023-03-22 07:58:57] [INFO ] Invariant cache hit.
[2023-03-22 07:58:59] [INFO ] Dead Transitions using invariants and state equation in 2175 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8904 ms. Remains : 2512/2512 places, 2108/2108 transitions.
Computed a total of 1599 stabilizing places and 1599 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(G((F(p1)||p0))))'
Support contains 4 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1396 transitions
Trivial Post-agglo rules discarded 1396 transitions
Performed 1396 trivial Post agglomeration. Transition count delta: 1396
Iterating post reduction 0 with 1396 rules applied. Total rules applied 1396 place count 6705 transition count 4609
Reduce places removed 1396 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1397 rules applied. Total rules applied 2793 place count 5309 transition count 4608
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2794 place count 5308 transition count 4608
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2794 place count 5308 transition count 3809
Deduced a syphon composed of 799 places in 15 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 4396 place count 4505 transition count 3805
Iterating global reduction 3 with 4 rules applied. Total rules applied 4400 place count 4505 transition count 3805
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4400 place count 4505 transition count 3801
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4408 place count 4501 transition count 3801
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 5 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 3 with 3392 rules applied. Total rules applied 7800 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7801 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 7803 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8005 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8207 place count 2602 transition count 2103
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 7 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8401 place count 2505 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8403 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8404 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8404 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8408 place count 2500 transition count 2099
Applied a total of 8408 rules in 2521 ms. Remains 2500 /6706 variables (removed 4206) and now considering 2099/6006 (removed 3907) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2023-03-22 07:59:02] [INFO ] Computed 1100 place invariants in 4 ms
[2023-03-22 07:59:04] [INFO ] Implicit Places using invariants in 2063 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2066 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6706 places, 2099/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 177 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-22 07:59:04] [INFO ] Computed 1098 place invariants in 5 ms
[2023-03-22 07:59:06] [INFO ] Implicit Places using invariants in 1867 ms returned []
[2023-03-22 07:59:06] [INFO ] Invariant cache hit.
[2023-03-22 07:59:11] [INFO ] Implicit Places using invariants and state equation in 4702 ms returned []
Implicit Place search using SMT with State Equation took 6589 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6706 places, 2097/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11354 ms. Remains : 2496/6706 places, 2097/6006 transitions.
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-00 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 s405 0) (EQ s512 1) (EQ s2153 0) (EQ s1885 1)), p1:(OR (EQ s2153 0) (EQ s1885 1))], 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 4 reset in 1607 ms.
Product exploration explored 100000 steps with 3 reset in 1873 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 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 239 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 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 72587 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 72587 steps, saw 55116 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 07:59:19] [INFO ] Invariant cache hit.
[2023-03-22 07:59:19] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:59:20] [INFO ] [Nat]Absence check using 1098 positive place invariants in 217 ms returned sat
[2023-03-22 07:59:21] [INFO ] After 1337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:59:22] [INFO ] After 1729ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-22 07:59:22] [INFO ] After 2552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 116 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 123 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 80794 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80794 steps, saw 60771 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 07:59:25] [INFO ] Invariant cache hit.
[2023-03-22 07:59:26] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:59:27] [INFO ] [Nat]Absence check using 1098 positive place invariants in 327 ms returned sat
[2023-03-22 07:59:28] [INFO ] After 1430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:59:28] [INFO ] After 1774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 167 ms.
[2023-03-22 07:59:29] [INFO ] After 2754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 87 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 97 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 97 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-22 07:59:29] [INFO ] Invariant cache hit.
[2023-03-22 07:59:31] [INFO ] Implicit Places using invariants in 2272 ms returned []
[2023-03-22 07:59:31] [INFO ] Invariant cache hit.
[2023-03-22 07:59:36] [INFO ] Implicit Places using invariants and state equation in 4657 ms returned []
Implicit Place search using SMT with State Equation took 6941 ms to find 0 implicit places.
[2023-03-22 07:59:36] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-22 07:59:36] [INFO ] Invariant cache hit.
[2023-03-22 07:59:38] [INFO ] Dead Transitions using invariants and state equation in 2248 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9361 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2496 transition count 2097
Applied a total of 595 rules in 236 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-22 07:59:38] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-22 07:59:39] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:59:39] [INFO ] [Nat]Absence check using 1098 positive place invariants in 235 ms returned sat
[2023-03-22 07:59:41] [INFO ] After 1642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:59:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 07:59:41] [INFO ] After 229ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 07:59:42] [INFO ] After 584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 220 ms.
[2023-03-22 07:59:42] [INFO ] After 3052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
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 300 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 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 129 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-22 07:59:43] [INFO ] Computed 1098 place invariants in 17 ms
[2023-03-22 07:59:45] [INFO ] Implicit Places using invariants in 2245 ms returned []
[2023-03-22 07:59:45] [INFO ] Invariant cache hit.
[2023-03-22 07:59:47] [INFO ] Implicit Places using invariants and state equation in 2643 ms returned []
Implicit Place search using SMT with State Equation took 4893 ms to find 0 implicit places.
[2023-03-22 07:59:48] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-22 07:59:48] [INFO ] Invariant cache hit.
[2023-03-22 07:59:49] [INFO ] Dead Transitions using invariants and state equation in 1559 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6676 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 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 276 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 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 78089 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78089 steps, saw 58787 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 07:59:53] [INFO ] Invariant cache hit.
[2023-03-22 07:59:53] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:59:54] [INFO ] [Nat]Absence check using 1098 positive place invariants in 340 ms returned sat
[2023-03-22 07:59:56] [INFO ] After 1304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:59:56] [INFO ] After 1689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 272 ms.
[2023-03-22 07:59:56] [INFO ] After 2822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 107 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 85 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 87427 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87427 steps, saw 66074 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 08:00:00] [INFO ] Invariant cache hit.
[2023-03-22 08:00:00] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:00:01] [INFO ] [Nat]Absence check using 1098 positive place invariants in 271 ms returned sat
[2023-03-22 08:00:02] [INFO ] After 1272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:00:03] [INFO ] After 1641ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 244 ms.
[2023-03-22 08:00:03] [INFO ] After 2596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 152 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 109 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 99 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-22 08:00:03] [INFO ] Invariant cache hit.
[2023-03-22 08:00:05] [INFO ] Implicit Places using invariants in 1888 ms returned []
[2023-03-22 08:00:05] [INFO ] Invariant cache hit.
[2023-03-22 08:00:09] [INFO ] Implicit Places using invariants and state equation in 4234 ms returned []
Implicit Place search using SMT with State Equation took 6140 ms to find 0 implicit places.
[2023-03-22 08:00:09] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-22 08:00:09] [INFO ] Invariant cache hit.
[2023-03-22 08:00:11] [INFO ] Dead Transitions using invariants and state equation in 1627 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7969 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2496 transition count 2097
Applied a total of 595 rules in 209 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-22 08:00:11] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-22 08:00:12] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 08:00:12] [INFO ] [Nat]Absence check using 1098 positive place invariants in 259 ms returned sat
[2023-03-22 08:00:14] [INFO ] After 1327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 08:00:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 08:00:14] [INFO ] After 211ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 08:00:15] [INFO ] After 587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 247 ms.
[2023-03-22 08:00:15] [INFO ] After 3050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
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 388 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 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 1450 ms.
Product exploration explored 100000 steps with 3 reset in 1876 ms.
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 82 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2023-03-22 08:00:19] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:00:21] [INFO ] Implicit Places using invariants in 2332 ms returned []
[2023-03-22 08:00:21] [INFO ] Invariant cache hit.
[2023-03-22 08:00:26] [INFO ] Implicit Places using invariants and state equation in 4262 ms returned []
Implicit Place search using SMT with State Equation took 6611 ms to find 0 implicit places.
[2023-03-22 08:00:26] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-22 08:00:26] [INFO ] Invariant cache hit.
[2023-03-22 08:00:27] [INFO ] Dead Transitions using invariants and state equation in 1750 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8523 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-00 finished in 88331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 2 out of 6706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6701 transition count 6001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6701 transition count 6001
Applied a total of 10 rules in 2010 ms. Remains 6701 /6706 variables (removed 5) and now considering 6001/6006 (removed 5) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-22 08:00:30] [INFO ] Computed 1101 place invariants in 45 ms
[2023-03-22 08:00:31] [INFO ] Implicit Places using invariants in 980 ms returned []
[2023-03-22 08:00:31] [INFO ] Invariant cache hit.
[2023-03-22 08:00:34] [INFO ] Implicit Places using invariants and state equation in 2948 ms returned []
Implicit Place search using SMT with State Equation took 3933 ms to find 0 implicit places.
[2023-03-22 08:00:34] [INFO ] Invariant cache hit.
[2023-03-22 08:00:40] [INFO ] Dead Transitions using invariants and state equation in 6215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6706 places, 6001/6006 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12161 ms. Remains : 6701/6706 places, 6001/6006 transitions.
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(OR (EQ s6249 0) (EQ s5074 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 150 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-01 finished in 12594 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))'
Support contains 2 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6705 transition count 4608
Reduce places removed 1397 places and 0 transitions.
Iterating post reduction 1 with 1397 rules applied. Total rules applied 2794 place count 5308 transition count 4608
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 797 Pre rules applied. Total rules applied 2794 place count 5308 transition count 3811
Deduced a syphon composed of 797 places in 15 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 2 with 1594 rules applied. Total rules applied 4388 place count 4511 transition count 3811
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 4392 place count 4507 transition count 3807
Iterating global reduction 2 with 4 rules applied. Total rules applied 4396 place count 4507 transition count 3807
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4396 place count 4507 transition count 3803
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4404 place count 4503 transition count 3803
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7802 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7803 place count 2804 transition count 2103
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 7805 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8007 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8209 place count 2601 transition count 2102
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 5 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 8399 place count 2506 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8401 place count 2504 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8402 place count 2503 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8402 place count 2503 transition count 2098
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8406 place count 2501 transition count 2098
Applied a total of 8406 rules in 2261 ms. Remains 2501 /6706 variables (removed 4205) and now considering 2098/6006 (removed 3908) transitions.
// Phase 1: matrix 2098 rows 2501 cols
[2023-03-22 08:00:43] [INFO ] Computed 1100 place invariants in 3 ms
[2023-03-22 08:00:45] [INFO ] Implicit Places using invariants in 2137 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2140 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6706 places, 2098/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2096
Applied a total of 4 rules in 197 ms. Remains 2497 /2499 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2497 cols
[2023-03-22 08:00:45] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-22 08:00:47] [INFO ] Implicit Places using invariants in 1847 ms returned []
[2023-03-22 08:00:47] [INFO ] Invariant cache hit.
[2023-03-22 08:00:51] [INFO ] Implicit Places using invariants and state equation in 4122 ms returned []
Implicit Place search using SMT with State Equation took 5982 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6706 places, 2096/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10594 ms. Remains : 2497/6706 places, 2096/6006 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1001 0) (EQ s2203 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19 reset in 1398 ms.
Stack based approach found an accepted trace after 91 steps with 0 reset with depth 92 and stack size 92 in 2 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-02 finished in 12093 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 2 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6705 transition count 4606
Reduce places removed 1399 places and 0 transitions.
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2798 place count 5306 transition count 4606
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 797 Pre rules applied. Total rules applied 2798 place count 5306 transition count 3809
Deduced a syphon composed of 797 places in 13 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 2 with 1594 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 4395 place count 4506 transition count 3806
Iterating global reduction 2 with 3 rules applied. Total rules applied 4398 place count 4506 transition count 3806
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4398 place count 4506 transition count 3803
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 4404 place count 4503 transition count 3803
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7802 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7803 place count 2804 transition count 2103
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 7805 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8007 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8209 place count 2601 transition count 2102
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8403 place count 2504 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8405 place count 2502 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8406 place count 2501 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8406 place count 2501 transition count 2098
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8410 place count 2499 transition count 2098
Applied a total of 8410 rules in 2281 ms. Remains 2499 /6706 variables (removed 4207) and now considering 2098/6006 (removed 3908) transitions.
// Phase 1: matrix 2098 rows 2499 cols
[2023-03-22 08:00:55] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-22 08:00:57] [INFO ] Implicit Places using invariants in 1937 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1939 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/6706 places, 2098/6006 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 2495 transition count 2096
Applied a total of 4 rules in 171 ms. Remains 2495 /2497 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2495 cols
[2023-03-22 08:00:57] [INFO ] Computed 1098 place invariants in 3 ms
[2023-03-22 08:01:00] [INFO ] Implicit Places using invariants in 2499 ms returned []
[2023-03-22 08:01:00] [INFO ] Invariant cache hit.
[2023-03-22 08:01:04] [INFO ] Implicit Places using invariants and state equation in 4330 ms returned []
Implicit Place search using SMT with State Equation took 6838 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2495/6706 places, 2096/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11229 ms. Remains : 2495/6706 places, 2096/6006 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-03 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:(OR (EQ s1175 0) (EQ s2147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 1286 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-03 finished in 12678 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)))'
Support contains 2 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6705 transition count 4608
Reduce places removed 1397 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2795 place count 5308 transition count 4607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2796 place count 5307 transition count 4607
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2796 place count 5307 transition count 3809
Deduced a syphon composed of 798 places in 13 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 4395 place count 4506 transition count 3806
Iterating global reduction 3 with 3 rules applied. Total rules applied 4398 place count 4506 transition count 3806
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4398 place count 4506 transition count 3803
Deduced a syphon composed of 3 places in 14 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4404 place count 4503 transition count 3803
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 5 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 3 with 3398 rules applied. Total rules applied 7802 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7803 place count 2804 transition count 2103
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 7805 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8007 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8209 place count 2601 transition count 2102
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 8 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8401 place count 2505 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8403 place count 2503 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8404 place count 2502 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8404 place count 2502 transition count 2098
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8408 place count 2500 transition count 2098
Applied a total of 8408 rules in 2342 ms. Remains 2500 /6706 variables (removed 4206) and now considering 2098/6006 (removed 3908) transitions.
// Phase 1: matrix 2098 rows 2500 cols
[2023-03-22 08:01:08] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-22 08:01:09] [INFO ] Implicit Places using invariants in 1726 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1745 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6706 places, 2098/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2096
Applied a total of 4 rules in 172 ms. Remains 2496 /2498 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-22 08:01:10] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-22 08:01:12] [INFO ] Implicit Places using invariants in 1991 ms returned []
[2023-03-22 08:01:12] [INFO ] Invariant cache hit.
[2023-03-22 08:01:16] [INFO ] Implicit Places using invariants and state equation in 4064 ms returned []
Implicit Place search using SMT with State Equation took 6071 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6706 places, 2096/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10331 ms. Remains : 2496/6706 places, 2096/6006 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s719 0) (EQ s1452 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1305 ms.
Stack based approach found an accepted trace after 84 steps with 0 reset with depth 85 and stack size 85 in 2 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-07 finished in 11767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 6706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6701 transition count 6001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6701 transition count 6001
Applied a total of 10 rules in 2129 ms. Remains 6701 /6706 variables (removed 5) and now considering 6001/6006 (removed 5) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-22 08:01:19] [INFO ] Computed 1101 place invariants in 51 ms
[2023-03-22 08:01:22] [INFO ] Implicit Places using invariants in 2849 ms returned []
[2023-03-22 08:01:22] [INFO ] Invariant cache hit.
[2023-03-22 08:01:25] [INFO ] Implicit Places using invariants and state equation in 2542 ms returned []
Implicit Place search using SMT with State Equation took 5429 ms to find 0 implicit places.
[2023-03-22 08:01:25] [INFO ] Invariant cache hit.
[2023-03-22 08:01:30] [INFO ] Dead Transitions using invariants and state equation in 5412 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6706 places, 6001/6006 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12976 ms. Remains : 6701/6706 places, 6001/6006 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s3136 0) (NEQ s3665 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][false, false]]
Product exploration explored 100000 steps with 0 reset in 1419 ms.
Stack based approach found an accepted trace after 8679 steps with 0 reset with depth 8680 and stack size 8680 in 150 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-08 finished in 14738 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||G(p1)))))'
Support contains 3 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6705 transition count 4608
Reduce places removed 1397 places and 0 transitions.
Iterating post reduction 1 with 1397 rules applied. Total rules applied 2794 place count 5308 transition count 4608
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2794 place count 5308 transition count 3809
Deduced a syphon composed of 799 places in 12 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 4396 place count 4505 transition count 3805
Iterating global reduction 2 with 4 rules applied. Total rules applied 4400 place count 4505 transition count 3805
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4400 place count 4505 transition count 3801
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4408 place count 4501 transition count 3801
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 7 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 2 with 3390 rules applied. Total rules applied 7798 place count 2806 transition count 2106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2806 transition count 2105
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 7801 place count 2805 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8003 place count 2704 transition count 2104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8205 place count 2603 transition count 2104
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8399 place count 2506 transition count 2104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8401 place count 2504 transition count 2102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8402 place count 2503 transition count 2102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8402 place count 2503 transition count 2100
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8406 place count 2501 transition count 2100
Applied a total of 8406 rules in 2428 ms. Remains 2501 /6706 variables (removed 4205) and now considering 2100/6006 (removed 3906) transitions.
// Phase 1: matrix 2100 rows 2501 cols
[2023-03-22 08:01:34] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-22 08:01:37] [INFO ] Implicit Places using invariants in 2273 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2289 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6706 places, 2100/6006 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 2497 transition count 2098
Applied a total of 4 rules in 217 ms. Remains 2497 /2499 variables (removed 2) and now considering 2098/2100 (removed 2) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-22 08:01:37] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:01:39] [INFO ] Implicit Places using invariants in 1888 ms returned []
[2023-03-22 08:01:39] [INFO ] Invariant cache hit.
[2023-03-22 08:01:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 08:01:43] [INFO ] Implicit Places using invariants and state equation in 4841 ms returned []
Implicit Place search using SMT with State Equation took 6746 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6706 places, 2098/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11682 ms. Remains : 2497/6706 places, 2098/6006 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s938 0) (EQ s2363 1)), p0:(EQ s1477 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 5 reset in 1432 ms.
Product exploration explored 100000 steps with 1 reset in 1981 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/2497 stabilizing places and 2/2098 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 357 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 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:01:48] [INFO ] Invariant cache hit.
[2023-03-22 08:01:48] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:01:49] [INFO ] [Nat]Absence check using 1098 positive place invariants in 361 ms returned sat
[2023-03-22 08:01:50] [INFO ] After 1331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:01:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 08:01:50] [INFO ] After 100ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:01:51] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-22 08:01:51] [INFO ] After 2580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 64 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 4 factoid took 488 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 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 102 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
[2023-03-22 08:01:51] [INFO ] Invariant cache hit.
[2023-03-22 08:01:53] [INFO ] Implicit Places using invariants in 1692 ms returned []
[2023-03-22 08:01:53] [INFO ] Invariant cache hit.
[2023-03-22 08:01:55] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 08:01:59] [INFO ] Implicit Places using invariants and state equation in 5422 ms returned []
Implicit Place search using SMT with State Equation took 7130 ms to find 0 implicit places.
[2023-03-22 08:01:59] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-22 08:01:59] [INFO ] Invariant cache hit.
[2023-03-22 08:02:00] [INFO ] Dead Transitions using invariants and state equation in 1417 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8729 ms. Remains : 2497/2497 places, 2098/2098 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/2497 stabilizing places and 2/2098 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 262 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 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:02:01] [INFO ] Invariant cache hit.
[2023-03-22 08:02:01] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:02:02] [INFO ] [Nat]Absence check using 1098 positive place invariants in 189 ms returned sat
[2023-03-22 08:02:03] [INFO ] After 1173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:02:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 08:02:03] [INFO ] After 139ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:02:03] [INFO ] After 330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-22 08:02:03] [INFO ] After 2159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 72 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 4 factoid took 375 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 118 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1356 ms.
Product exploration explored 100000 steps with 2 reset in 1756 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 82 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
[2023-03-22 08:02:07] [INFO ] Invariant cache hit.
[2023-03-22 08:02:09] [INFO ] Implicit Places using invariants in 2068 ms returned []
[2023-03-22 08:02:09] [INFO ] Invariant cache hit.
[2023-03-22 08:02:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 08:02:14] [INFO ] Implicit Places using invariants and state equation in 4476 ms returned []
Implicit Place search using SMT with State Equation took 6562 ms to find 0 implicit places.
[2023-03-22 08:02:14] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-22 08:02:14] [INFO ] Invariant cache hit.
[2023-03-22 08:02:15] [INFO ] Dead Transitions using invariants and state equation in 1191 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7896 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-09 finished in 43290 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((F(p0)&&X(p1)))&&G(p2)))'
Support contains 4 out of 6706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6701 transition count 6001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6701 transition count 6001
Applied a total of 10 rules in 2124 ms. Remains 6701 /6706 variables (removed 5) and now considering 6001/6006 (removed 5) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-22 08:02:17] [INFO ] Computed 1101 place invariants in 20 ms
[2023-03-22 08:02:20] [INFO ] Implicit Places using invariants in 2925 ms returned []
[2023-03-22 08:02:20] [INFO ] Invariant cache hit.
[2023-03-22 08:02:23] [INFO ] Implicit Places using invariants and state equation in 2990 ms returned []
Implicit Place search using SMT with State Equation took 5923 ms to find 0 implicit places.
[2023-03-22 08:02:23] [INFO ] Invariant cache hit.
[2023-03-22 08:02:30] [INFO ] Dead Transitions using invariants and state equation in 7004 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6706 places, 6001/6006 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15055 ms. Remains : 6701/6706 places, 6001/6006 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s1895 0), p0:(OR (EQ s6537 0) (EQ s4173 1)), p1:(EQ s4053 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1530 ms.
Product exploration explored 100000 steps with 0 reset in 2101 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 705 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:02:36] [INFO ] Invariant cache hit.
[2023-03-22 08:02:37] [INFO ] After 830ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:02:38] [INFO ] [Nat]Absence check using 1101 positive place invariants in 729 ms returned sat
[2023-03-22 08:02:44] [INFO ] After 5562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:02:46] [INFO ] Deduced a trap composed of 16 places in 2503 ms of which 4 ms to minimize.
[2023-03-22 08:02:49] [INFO ] Deduced a trap composed of 21 places in 2708 ms of which 4 ms to minimize.
[2023-03-22 08:02:53] [INFO ] Deduced a trap composed of 16 places in 3379 ms of which 3 ms to minimize.
[2023-03-22 08:02:56] [INFO ] Deduced a trap composed of 17 places in 2714 ms of which 4 ms to minimize.
[2023-03-22 08:02:59] [INFO ] Deduced a trap composed of 21 places in 2471 ms of which 4 ms to minimize.
[2023-03-22 08:03:01] [INFO ] Deduced a trap composed of 21 places in 2475 ms of which 4 ms to minimize.
[2023-03-22 08:03:10] [INFO ] Deduced a trap composed of 31 places in 8047 ms of which 6 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-22 08:03:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:03:10] [INFO ] After 33072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 101 ms.
Support contains 1 out of 6701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6701 transition count 4601
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5301 transition count 4601
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2800 place count 5301 transition count 3801
Deduced a syphon composed of 800 places in 13 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4400 place count 4501 transition count 3801
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 4 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7800 place count 2801 transition count 2101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7801 place count 2801 transition count 2100
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 7803 place count 2800 transition count 2099
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8005 place count 2699 transition count 2099
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8207 place count 2598 transition count 2099
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8401 place count 2501 transition count 2099
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8700 place count 2501 transition count 2099
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8701 place count 2500 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8702 place count 2499 transition count 2098
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8702 place count 2499 transition count 2096
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8706 place count 2497 transition count 2096
Applied a total of 8706 rules in 1894 ms. Remains 2497 /6701 variables (removed 4204) and now considering 2096/6001 (removed 3905) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1894 ms. Remains : 2497/6701 places, 2096/6001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 76070 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76070 steps, saw 51474 distinct states, run finished after 3013 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2497 cols
[2023-03-22 08:03:15] [INFO ] Computed 1100 place invariants in 4 ms
[2023-03-22 08:03:15] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:03:16] [INFO ] [Nat]Absence check using 1100 positive place invariants in 555 ms returned sat
[2023-03-22 08:03:18] [INFO ] After 1569ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:03:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 08:03:18] [INFO ] After 98ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:03:18] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 1 ms to minimize.
[2023-03-22 08:03:19] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 27 ms to minimize.
[2023-03-22 08:03:19] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-22 08:03:19] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 0 ms to minimize.
[2023-03-22 08:03:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1448 ms
[2023-03-22 08:03:19] [INFO ] After 1632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-22 08:03:20] [INFO ] After 4248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2096/2096 transitions.
Applied a total of 0 rules in 158 ms. Remains 2497 /2497 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 2497/2497 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2096/2096 transitions.
Applied a total of 0 rules in 103 ms. Remains 2497 /2497 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-22 08:03:20] [INFO ] Invariant cache hit.
[2023-03-22 08:03:23] [INFO ] Implicit Places using invariants in 2831 ms returned [2480, 2484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2848 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2495/2497 places, 2096/2096 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2493 transition count 2094
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2493 transition count 2094
Applied a total of 4 rules in 188 ms. Remains 2493 /2495 variables (removed 2) and now considering 2094/2096 (removed 2) transitions.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-22 08:03:23] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:03:25] [INFO ] Implicit Places using invariants in 2272 ms returned []
[2023-03-22 08:03:25] [INFO ] Invariant cache hit.
[2023-03-22 08:03:30] [INFO ] Implicit Places using invariants and state equation in 5066 ms returned []
Implicit Place search using SMT with State Equation took 7355 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2493/2497 places, 2094/2096 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10494 ms. Remains : 2493/2497 places, 2094/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 77035 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77035 steps, saw 52231 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:03:33] [INFO ] Invariant cache hit.
[2023-03-22 08:03:34] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:03:34] [INFO ] [Nat]Absence check using 1098 positive place invariants in 212 ms returned sat
[2023-03-22 08:03:37] [INFO ] After 2985ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:03:38] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 0 ms to minimize.
[2023-03-22 08:03:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 484 ms
[2023-03-22 08:03:38] [INFO ] After 3602ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-22 08:03:38] [INFO ] After 4273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 2493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 100 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 94 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
[2023-03-22 08:03:38] [INFO ] Invariant cache hit.
[2023-03-22 08:03:42] [INFO ] Implicit Places using invariants in 4012 ms returned []
[2023-03-22 08:03:42] [INFO ] Invariant cache hit.
[2023-03-22 08:03:46] [INFO ] Implicit Places using invariants and state equation in 3989 ms returned []
Implicit Place search using SMT with State Equation took 8007 ms to find 0 implicit places.
[2023-03-22 08:03:46] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-22 08:03:46] [INFO ] Invariant cache hit.
[2023-03-22 08:03:48] [INFO ] Dead Transitions using invariants and state equation in 1714 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9877 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2493 transition count 2094
Applied a total of 596 rules in 260 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-22 08:03:48] [INFO ] Computed 1098 place invariants in 5 ms
[2023-03-22 08:03:49] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:03:50] [INFO ] [Nat]Absence check using 1098 positive place invariants in 294 ms returned sat
[2023-03-22 08:03:51] [INFO ] After 1197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:03:51] [INFO ] State equation strengthened by 594 read => feed constraints.
[2023-03-22 08:03:51] [INFO ] After 252ms SMT Verify possible using 594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:03:52] [INFO ] Deduced a trap composed of 6 places in 704 ms of which 2 ms to minimize.
[2023-03-22 08:03:53] [INFO ] Deduced a trap composed of 6 places in 732 ms of which 1 ms to minimize.
[2023-03-22 08:03:54] [INFO ] Deduced a trap composed of 5 places in 973 ms of which 25 ms to minimize.
[2023-03-22 08:03:55] [INFO ] Deduced a trap composed of 5 places in 882 ms of which 2 ms to minimize.
[2023-03-22 08:03:56] [INFO ] Deduced a trap composed of 5 places in 672 ms of which 2 ms to minimize.
[2023-03-22 08:03:57] [INFO ] Deduced a trap composed of 7 places in 776 ms of which 3 ms to minimize.
[2023-03-22 08:03:57] [INFO ] Deduced a trap composed of 5 places in 715 ms of which 1 ms to minimize.
[2023-03-22 08:03:59] [INFO ] Deduced a trap composed of 5 places in 1301 ms of which 30 ms to minimize.
[2023-03-22 08:04:00] [INFO ] Deduced a trap composed of 5 places in 692 ms of which 2 ms to minimize.
[2023-03-22 08:04:01] [INFO ] Deduced a trap composed of 5 places in 768 ms of which 1 ms to minimize.
[2023-03-22 08:04:02] [INFO ] Deduced a trap composed of 5 places in 877 ms of which 1 ms to minimize.
[2023-03-22 08:04:03] [INFO ] Deduced a trap composed of 5 places in 889 ms of which 2 ms to minimize.
[2023-03-22 08:04:04] [INFO ] Deduced a trap composed of 7 places in 867 ms of which 2 ms to minimize.
[2023-03-22 08:04:05] [INFO ] Deduced a trap composed of 9 places in 1187 ms of which 2 ms to minimize.
[2023-03-22 08:04:06] [INFO ] Deduced a trap composed of 5 places in 963 ms of which 2 ms to minimize.
[2023-03-22 08:04:07] [INFO ] Deduced a trap composed of 11 places in 823 ms of which 24 ms to minimize.
[2023-03-22 08:04:08] [INFO ] Deduced a trap composed of 5 places in 711 ms of which 2 ms to minimize.
[2023-03-22 08:04:09] [INFO ] Deduced a trap composed of 7 places in 664 ms of which 1 ms to minimize.
[2023-03-22 08:04:10] [INFO ] Deduced a trap composed of 7 places in 721 ms of which 1 ms to minimize.
[2023-03-22 08:04:10] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 18761 ms
[2023-03-22 08:04:10] [INFO ] After 19164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-03-22 08:04:10] [INFO ] After 21308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 732 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 292 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-22 08:04:12] [INFO ] Computed 1101 place invariants in 44 ms
[2023-03-22 08:04:27] [INFO ] [Real]Absence check using 1101 positive place invariants in 7322 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 6701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Applied a total of 0 rules in 958 ms. Remains 6701 /6701 variables (removed 0) and now considering 6001/6001 (removed 0) transitions.
[2023-03-22 08:04:28] [INFO ] Invariant cache hit.
[2023-03-22 08:04:31] [INFO ] Implicit Places using invariants in 3094 ms returned []
[2023-03-22 08:04:31] [INFO ] Invariant cache hit.
[2023-03-22 08:04:34] [INFO ] Implicit Places using invariants and state equation in 3241 ms returned []
Implicit Place search using SMT with State Equation took 6340 ms to find 0 implicit places.
[2023-03-22 08:04:34] [INFO ] Invariant cache hit.
[2023-03-22 08:04:40] [INFO ] Dead Transitions using invariants and state equation in 6057 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13360 ms. Remains : 6701/6701 places, 6001/6001 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 551 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 318 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:04:41] [INFO ] Invariant cache hit.
[2023-03-22 08:04:42] [INFO ] After 885ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:04:44] [INFO ] [Nat]Absence check using 1101 positive place invariants in 859 ms returned sat
[2023-03-22 08:04:51] [INFO ] After 6701ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:04:54] [INFO ] Deduced a trap composed of 16 places in 2600 ms of which 6 ms to minimize.
[2023-03-22 08:04:57] [INFO ] Deduced a trap composed of 21 places in 2922 ms of which 4 ms to minimize.
[2023-03-22 08:05:00] [INFO ] Deduced a trap composed of 16 places in 2872 ms of which 19 ms to minimize.
[2023-03-22 08:05:03] [INFO ] Deduced a trap composed of 17 places in 2708 ms of which 3 ms to minimize.
[2023-03-22 08:05:06] [INFO ] Deduced a trap composed of 21 places in 2458 ms of which 4 ms to minimize.
[2023-03-22 08:05:08] [INFO ] Deduced a trap composed of 21 places in 2448 ms of which 6 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-22 08:05:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:05:08] [INFO ] After 26219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 126 ms.
Support contains 1 out of 6701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Drop transitions removed 1400 transitions
Trivial Post-agglo rules discarded 1400 transitions
Performed 1400 trivial Post agglomeration. Transition count delta: 1400
Iterating post reduction 0 with 1400 rules applied. Total rules applied 1400 place count 6701 transition count 4601
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5301 transition count 4601
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 2800 place count 5301 transition count 3801
Deduced a syphon composed of 800 places in 13 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 4400 place count 4501 transition count 3801
Performed 1700 Post agglomeration using F-continuation condition.Transition count delta: 1700
Deduced a syphon composed of 1700 places in 6 ms
Reduce places removed 1700 places and 0 transitions.
Iterating global reduction 2 with 3400 rules applied. Total rules applied 7800 place count 2801 transition count 2101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7801 place count 2801 transition count 2100
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 7803 place count 2800 transition count 2099
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8005 place count 2699 transition count 2099
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8207 place count 2598 transition count 2099
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 8 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8401 place count 2501 transition count 2099
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8700 place count 2501 transition count 2099
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8701 place count 2500 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8702 place count 2499 transition count 2098
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8702 place count 2499 transition count 2096
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8706 place count 2497 transition count 2096
Applied a total of 8706 rules in 2109 ms. Remains 2497 /6701 variables (removed 4204) and now considering 2096/6001 (removed 3905) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2109 ms. Remains : 2497/6701 places, 2096/6001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 76797 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76797 steps, saw 52020 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2497 cols
[2023-03-22 08:05:14] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-22 08:05:14] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:05:15] [INFO ] [Nat]Absence check using 1100 positive place invariants in 404 ms returned sat
[2023-03-22 08:05:17] [INFO ] After 1470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:05:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 08:05:17] [INFO ] After 137ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:05:17] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 1 ms to minimize.
[2023-03-22 08:05:18] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 0 ms to minimize.
[2023-03-22 08:05:18] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 0 ms to minimize.
[2023-03-22 08:05:18] [INFO ] Deduced a trap composed of 5 places in 355 ms of which 1 ms to minimize.
[2023-03-22 08:05:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1566 ms
[2023-03-22 08:05:18] [INFO ] After 1819ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-22 08:05:19] [INFO ] After 4245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2096/2096 transitions.
Applied a total of 0 rules in 92 ms. Remains 2497 /2497 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 2497/2497 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2096/2096 transitions.
Applied a total of 0 rules in 85 ms. Remains 2497 /2497 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-22 08:05:19] [INFO ] Invariant cache hit.
[2023-03-22 08:05:22] [INFO ] Implicit Places using invariants in 3277 ms returned [2480, 2484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3281 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2495/2497 places, 2096/2096 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2493 transition count 2094
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2493 transition count 2094
Applied a total of 4 rules in 254 ms. Remains 2493 /2495 variables (removed 2) and now considering 2094/2096 (removed 2) transitions.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-22 08:05:22] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-22 08:05:25] [INFO ] Implicit Places using invariants in 2348 ms returned []
[2023-03-22 08:05:25] [INFO ] Invariant cache hit.
[2023-03-22 08:05:29] [INFO ] Implicit Places using invariants and state equation in 4578 ms returned []
Implicit Place search using SMT with State Equation took 6956 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2493/2497 places, 2094/2096 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10577 ms. Remains : 2493/2497 places, 2094/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 77644 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77644 steps, saw 52572 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:05:33] [INFO ] Invariant cache hit.
[2023-03-22 08:05:33] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:05:33] [INFO ] [Nat]Absence check using 1098 positive place invariants in 236 ms returned sat
[2023-03-22 08:05:35] [INFO ] After 1223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:05:35] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
[2023-03-22 08:05:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 449 ms
[2023-03-22 08:05:35] [INFO ] After 1796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-22 08:05:35] [INFO ] After 2550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 2493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 99 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 93 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
[2023-03-22 08:05:36] [INFO ] Invariant cache hit.
[2023-03-22 08:05:38] [INFO ] Implicit Places using invariants in 2322 ms returned []
[2023-03-22 08:05:38] [INFO ] Invariant cache hit.
[2023-03-22 08:05:43] [INFO ] Implicit Places using invariants and state equation in 4704 ms returned []
Implicit Place search using SMT with State Equation took 7053 ms to find 0 implicit places.
[2023-03-22 08:05:43] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-22 08:05:43] [INFO ] Invariant cache hit.
[2023-03-22 08:05:45] [INFO ] Dead Transitions using invariants and state equation in 2473 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9711 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2493 transition count 2094
Applied a total of 596 rules in 227 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-22 08:05:46] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-22 08:05:46] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:05:47] [INFO ] [Nat]Absence check using 1098 positive place invariants in 578 ms returned sat
[2023-03-22 08:05:49] [INFO ] After 1580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:05:49] [INFO ] State equation strengthened by 594 read => feed constraints.
[2023-03-22 08:05:49] [INFO ] After 294ms SMT Verify possible using 594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:05:50] [INFO ] Deduced a trap composed of 6 places in 935 ms of which 2 ms to minimize.
[2023-03-22 08:05:51] [INFO ] Deduced a trap composed of 6 places in 968 ms of which 2 ms to minimize.
[2023-03-22 08:05:52] [INFO ] Deduced a trap composed of 5 places in 813 ms of which 2 ms to minimize.
[2023-03-22 08:05:53] [INFO ] Deduced a trap composed of 5 places in 817 ms of which 2 ms to minimize.
[2023-03-22 08:05:54] [INFO ] Deduced a trap composed of 5 places in 915 ms of which 2 ms to minimize.
[2023-03-22 08:05:55] [INFO ] Deduced a trap composed of 7 places in 881 ms of which 2 ms to minimize.
[2023-03-22 08:05:56] [INFO ] Deduced a trap composed of 5 places in 707 ms of which 2 ms to minimize.
[2023-03-22 08:05:57] [INFO ] Deduced a trap composed of 5 places in 981 ms of which 2 ms to minimize.
[2023-03-22 08:05:58] [INFO ] Deduced a trap composed of 5 places in 872 ms of which 2 ms to minimize.
[2023-03-22 08:05:59] [INFO ] Deduced a trap composed of 5 places in 878 ms of which 1 ms to minimize.
[2023-03-22 08:06:00] [INFO ] Deduced a trap composed of 5 places in 847 ms of which 3 ms to minimize.
[2023-03-22 08:06:02] [INFO ] Deduced a trap composed of 5 places in 1292 ms of which 2 ms to minimize.
[2023-03-22 08:06:03] [INFO ] Deduced a trap composed of 7 places in 1288 ms of which 2 ms to minimize.
[2023-03-22 08:06:04] [INFO ] Deduced a trap composed of 9 places in 1166 ms of which 1 ms to minimize.
[2023-03-22 08:06:05] [INFO ] Deduced a trap composed of 5 places in 844 ms of which 1 ms to minimize.
[2023-03-22 08:06:06] [INFO ] Deduced a trap composed of 11 places in 944 ms of which 2 ms to minimize.
[2023-03-22 08:06:07] [INFO ] Deduced a trap composed of 5 places in 902 ms of which 2 ms to minimize.
[2023-03-22 08:06:09] [INFO ] Deduced a trap composed of 7 places in 1436 ms of which 1 ms to minimize.
[2023-03-22 08:06:10] [INFO ] Deduced a trap composed of 7 places in 864 ms of which 2 ms to minimize.
[2023-03-22 08:06:10] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 21258 ms
[2023-03-22 08:06:10] [INFO ] After 21770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-22 08:06:11] [INFO ] After 24605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 731 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 393 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-22 08:06:12] [INFO ] Computed 1101 place invariants in 35 ms
[2023-03-22 08:06:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 6661 ms returned sat
[2023-03-22 08:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:06:27] [INFO ] [Real]Absence check using state equation in 1376 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 1565 ms.
Product exploration explored 100000 steps with 7 reset in 1941 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Support contains 4 out of 6701 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Performed 1399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6701 transition count 6001
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 499 Pre rules applied. Total rules applied 1399 place count 6701 transition count 6400
Deduced a syphon composed of 1898 places in 18 ms
Iterating global reduction 1 with 499 rules applied. Total rules applied 1898 place count 6701 transition count 6400
Performed 1898 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3796 places in 24 ms
Iterating global reduction 1 with 1898 rules applied. Total rules applied 3796 place count 6701 transition count 6400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3797 place count 6701 transition count 6399
Renaming transitions due to excessive name length > 1024 char.
Discarding 701 places :
Symmetric choice reduction at 2 with 701 rule applications. Total rules 4498 place count 6000 transition count 5698
Deduced a syphon composed of 3095 places in 24 ms
Iterating global reduction 2 with 701 rules applied. Total rules applied 5199 place count 6000 transition count 5698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3096 places in 28 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5200 place count 6000 transition count 5698
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5202 place count 5998 transition count 5696
Deduced a syphon composed of 3094 places in 29 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5204 place count 5998 transition count 5696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3195 places in 22 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5305 place count 5998 transition count 6126
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5406 place count 5897 transition count 5924
Deduced a syphon composed of 3094 places in 26 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5507 place count 5897 transition count 5924
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 3195 places in 27 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5608 place count 5897 transition count 6351
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5709 place count 5796 transition count 6149
Deduced a syphon composed of 3094 places in 19 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5810 place count 5796 transition count 6149
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -431
Deduced a syphon composed of 3195 places in 18 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5911 place count 5796 transition count 6580
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6012 place count 5695 transition count 6378
Deduced a syphon composed of 3094 places in 17 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6113 place count 5695 transition count 6378
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -403
Deduced a syphon composed of 3189 places in 19 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6208 place count 5695 transition count 6781
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 6303 place count 5600 transition count 6591
Deduced a syphon composed of 3094 places in 14 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6398 place count 5600 transition count 6591
Deduced a syphon composed of 3094 places in 18 ms
Applied a total of 6398 rules in 10743 ms. Remains 5600 /6701 variables (removed 1101) and now considering 6591/6001 (removed -590) transitions.
[2023-03-22 08:06:43] [INFO ] Redundant transitions in 475 ms returned []
// Phase 1: matrix 6591 rows 5600 cols
[2023-03-22 08:06:43] [INFO ] Computed 1101 place invariants in 213 ms
[2023-03-22 08:06:50] [INFO ] Dead Transitions using invariants and state equation in 6773 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5600/6701 places, 6591/6001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18017 ms. Remains : 5600/6701 places, 6591/6001 transitions.
Support contains 4 out of 6701 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Applied a total of 0 rules in 1114 ms. Remains 6701 /6701 variables (removed 0) and now considering 6001/6001 (removed 0) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-22 08:06:51] [INFO ] Computed 1101 place invariants in 52 ms
[2023-03-22 08:06:54] [INFO ] Implicit Places using invariants in 2817 ms returned []
[2023-03-22 08:06:54] [INFO ] Invariant cache hit.
[2023-03-22 08:06:57] [INFO ] Implicit Places using invariants and state equation in 3324 ms returned []
Implicit Place search using SMT with State Equation took 6144 ms to find 0 implicit places.
[2023-03-22 08:06:57] [INFO ] Invariant cache hit.
[2023-03-22 08:07:03] [INFO ] Dead Transitions using invariants and state equation in 6037 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13299 ms. Remains : 6701/6701 places, 6001/6001 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-11 finished in 288209 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 2 out of 6706 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6705 transition count 4607
Reduce places removed 1398 places and 0 transitions.
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2796 place count 5307 transition count 4607
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 798 Pre rules applied. Total rules applied 2796 place count 5307 transition count 3809
Deduced a syphon composed of 798 places in 12 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 2 with 1596 rules applied. Total rules applied 4392 place count 4509 transition count 3809
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 4396 place count 4505 transition count 3805
Iterating global reduction 2 with 4 rules applied. Total rules applied 4400 place count 4505 transition count 3805
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4400 place count 4505 transition count 3801
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4408 place count 4501 transition count 3801
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 6 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 2 with 3394 rules applied. Total rules applied 7802 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7803 place count 2804 transition count 2103
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 7805 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8007 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8209 place count 2601 transition count 2102
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 7 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8401 place count 2505 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8403 place count 2503 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8404 place count 2502 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8404 place count 2502 transition count 2098
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8408 place count 2500 transition count 2098
Applied a total of 8408 rules in 2499 ms. Remains 2500 /6706 variables (removed 4206) and now considering 2098/6006 (removed 3908) transitions.
// Phase 1: matrix 2098 rows 2500 cols
[2023-03-22 08:07:06] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-22 08:07:08] [INFO ] Implicit Places using invariants in 2546 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2550 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6706 places, 2098/6006 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 2496 transition count 2096
Applied a total of 4 rules in 219 ms. Remains 2496 /2498 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-22 08:07:09] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-22 08:07:12] [INFO ] Implicit Places using invariants in 3726 ms returned []
[2023-03-22 08:07:12] [INFO ] Invariant cache hit.
[2023-03-22 08:07:17] [INFO ] Implicit Places using invariants and state equation in 4691 ms returned []
Implicit Place search using SMT with State Equation took 8422 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6706 places, 2096/6006 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13691 ms. Remains : 2496/6706 places, 2096/6006 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-12 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:(OR (EQ s1697 0) (EQ s1893 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1495 ms.
Product exploration explored 100000 steps with 0 reset in 1797 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 106803 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106803 steps, saw 80895 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:07:24] [INFO ] Invariant cache hit.
[2023-03-22 08:07:24] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:07:25] [INFO ] [Nat]Absence check using 1098 positive place invariants in 246 ms returned sat
[2023-03-22 08:07:26] [INFO ] After 1249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:07:26] [INFO ] After 1402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-22 08:07:27] [INFO ] After 2124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 104 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 106803 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106803 steps, saw 80895 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:07:30] [INFO ] Invariant cache hit.
[2023-03-22 08:07:30] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:07:31] [INFO ] [Nat]Absence check using 1098 positive place invariants in 586 ms returned sat
[2023-03-22 08:07:33] [INFO ] After 1487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:07:33] [INFO ] After 1675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-22 08:07:33] [INFO ] After 2721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 127 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 94 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-22 08:07:33] [INFO ] Invariant cache hit.
[2023-03-22 08:07:36] [INFO ] Implicit Places using invariants in 2730 ms returned []
[2023-03-22 08:07:36] [INFO ] Invariant cache hit.
[2023-03-22 08:07:41] [INFO ] Implicit Places using invariants and state equation in 5089 ms returned []
Implicit Place search using SMT with State Equation took 7847 ms to find 0 implicit places.
[2023-03-22 08:07:41] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-22 08:07:41] [INFO ] Invariant cache hit.
[2023-03-22 08:07:43] [INFO ] Dead Transitions using invariants and state equation in 2093 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10117 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2496 transition count 2096
Applied a total of 593 rules in 250 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-22 08:07:44] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-22 08:07:44] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:07:45] [INFO ] [Nat]Absence check using 1098 positive place invariants in 250 ms returned sat
[2023-03-22 08:07:47] [INFO ] After 1864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:07:47] [INFO ] After 2103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-22 08:07:47] [INFO ] After 2953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 99 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-22 08:07:48] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:07:50] [INFO ] Implicit Places using invariants in 2243 ms returned []
[2023-03-22 08:07:50] [INFO ] Invariant cache hit.
[2023-03-22 08:07:54] [INFO ] Implicit Places using invariants and state equation in 4272 ms returned []
Implicit Place search using SMT with State Equation took 6519 ms to find 0 implicit places.
[2023-03-22 08:07:54] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-22 08:07:54] [INFO ] Invariant cache hit.
[2023-03-22 08:07:56] [INFO ] Dead Transitions using invariants and state equation in 1736 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8438 ms. Remains : 2496/2496 places, 2096/2096 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 107505 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107505 steps, saw 81462 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:08:00] [INFO ] Invariant cache hit.
[2023-03-22 08:08:00] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:08:01] [INFO ] [Nat]Absence check using 1098 positive place invariants in 316 ms returned sat
[2023-03-22 08:08:02] [INFO ] After 1271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:08:02] [INFO ] After 1514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-22 08:08:02] [INFO ] After 2364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 48 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 109 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 103355 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103355 steps, saw 78194 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:08:06] [INFO ] Invariant cache hit.
[2023-03-22 08:08:06] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:08:07] [INFO ] [Nat]Absence check using 1098 positive place invariants in 252 ms returned sat
[2023-03-22 08:08:08] [INFO ] After 1657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:08:09] [INFO ] After 1849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-22 08:08:09] [INFO ] After 2653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 100 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 88 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2023-03-22 08:08:09] [INFO ] Invariant cache hit.
[2023-03-22 08:08:11] [INFO ] Implicit Places using invariants in 1638 ms returned []
[2023-03-22 08:08:11] [INFO ] Invariant cache hit.
[2023-03-22 08:08:15] [INFO ] Implicit Places using invariants and state equation in 4573 ms returned []
Implicit Place search using SMT with State Equation took 6226 ms to find 0 implicit places.
[2023-03-22 08:08:15] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-22 08:08:15] [INFO ] Invariant cache hit.
[2023-03-22 08:08:18] [INFO ] Dead Transitions using invariants and state equation in 2541 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8965 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2496 transition count 2096
Applied a total of 593 rules in 266 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-22 08:08:18] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-22 08:08:18] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:08:19] [INFO ] [Nat]Absence check using 1098 positive place invariants in 271 ms returned sat
[2023-03-22 08:08:20] [INFO ] After 1290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:08:21] [INFO ] After 1477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-22 08:08:21] [INFO ] After 2435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 240 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1472 ms.
Product exploration explored 100000 steps with 0 reset in 1876 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 99 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2023-03-22 08:08:25] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:08:28] [INFO ] Implicit Places using invariants in 2898 ms returned []
[2023-03-22 08:08:28] [INFO ] Invariant cache hit.
[2023-03-22 08:08:33] [INFO ] Implicit Places using invariants and state equation in 4654 ms returned []
Implicit Place search using SMT with State Equation took 7561 ms to find 0 implicit places.
[2023-03-22 08:08:33] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-22 08:08:33] [INFO ] Invariant cache hit.
[2023-03-22 08:08:35] [INFO ] Dead Transitions using invariants and state equation in 2066 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9837 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-12 finished in 91664 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(G(p0)) U p1)))'
Support contains 6 out of 6706 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 6703 transition count 6003
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 6703 transition count 6003
Applied a total of 6 rules in 2259 ms. Remains 6703 /6706 variables (removed 3) and now considering 6003/6006 (removed 3) transitions.
// Phase 1: matrix 6003 rows 6703 cols
[2023-03-22 08:08:37] [INFO ] Computed 1101 place invariants in 45 ms
[2023-03-22 08:08:40] [INFO ] Implicit Places using invariants in 3208 ms returned []
[2023-03-22 08:08:41] [INFO ] Invariant cache hit.
[2023-03-22 08:08:44] [INFO ] Implicit Places using invariants and state equation in 3396 ms returned []
Implicit Place search using SMT with State Equation took 6642 ms to find 0 implicit places.
[2023-03-22 08:08:44] [INFO ] Invariant cache hit.
[2023-03-22 08:08:50] [INFO ] Dead Transitions using invariants and state equation in 6364 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6703/6706 places, 6003/6006 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15271 ms. Remains : 6703/6706 places, 6003/6006 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s894 0) (EQ s3804 1)), p0:(OR (EQ s4938 0) (EQ s4337 1) (EQ s1878 0) (EQ s3048 1))], nbAcceptance=1, 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 50000 reset in 4699 ms.
Product exploration explored 100000 steps with 50000 reset in 4722 ms.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-14 finished in 25277 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' '!(G(F((p0||G(p1)))))'
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((F(p0)&&X(p1)))&&G(p2)))'
Found a Shortening insensitive property : ShieldPPPt-PT-100B-LTLCardinality-11
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p2), (NOT p0), (NOT p1)]
Support contains 4 out of 6706 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6706/6706 places, 6006/6006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6705 transition count 4608
Reduce places removed 1397 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2795 place count 5308 transition count 4607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2796 place count 5307 transition count 4607
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 797 Pre rules applied. Total rules applied 2796 place count 5307 transition count 3810
Deduced a syphon composed of 797 places in 13 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 3 with 1594 rules applied. Total rules applied 4390 place count 4510 transition count 3810
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 4394 place count 4506 transition count 3806
Iterating global reduction 3 with 4 rules applied. Total rules applied 4398 place count 4506 transition count 3806
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4398 place count 4506 transition count 3802
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4406 place count 4502 transition count 3802
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 6 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 3 with 3390 rules applied. Total rules applied 7796 place count 2807 transition count 2107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7797 place count 2807 transition count 2106
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 7799 place count 2806 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8001 place count 2705 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8203 place count 2604 transition count 2105
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 8 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8397 place count 2507 transition count 2105
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 8398 place count 2507 transition count 2105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8400 place count 2505 transition count 2103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8401 place count 2504 transition count 2103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8401 place count 2504 transition count 2101
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8405 place count 2502 transition count 2101
Applied a total of 8405 rules in 2610 ms. Remains 2502 /6706 variables (removed 4204) and now considering 2101/6006 (removed 3905) transitions.
// Phase 1: matrix 2101 rows 2502 cols
[2023-03-22 08:09:03] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-22 08:09:06] [INFO ] Implicit Places using invariants in 2492 ms returned [2485, 2489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2494 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/6706 places, 2101/6006 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 2099
Applied a total of 4 rules in 180 ms. Remains 2498 /2500 variables (removed 2) and now considering 2099/2101 (removed 2) transitions.
// Phase 1: matrix 2099 rows 2498 cols
[2023-03-22 08:09:06] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-22 08:09:08] [INFO ] Implicit Places using invariants in 2369 ms returned []
[2023-03-22 08:09:08] [INFO ] Invariant cache hit.
[2023-03-22 08:09:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 08:09:13] [INFO ] Implicit Places using invariants and state equation in 4891 ms returned []
Implicit Place search using SMT with State Equation took 7296 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2498/6706 places, 2099/6006 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 12580 ms. Remains : 2498/6706 places, 2099/6006 transitions.
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s678 0), p0:(OR (EQ s2448 0) (EQ s1549 1)), p1:(EQ s1500 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 0 reset in 1421 ms.
Product exploration explored 100000 steps with 3 reset in 1831 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 p2 p0 (NOT p1)), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 811 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:09:18] [INFO ] Invariant cache hit.
[2023-03-22 08:09:19] [INFO ] After 472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:09:19] [INFO ] [Nat]Absence check using 1098 positive place invariants in 256 ms returned sat
[2023-03-22 08:09:20] [INFO ] After 1195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:09:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 08:09:21] [INFO ] After 109ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:09:21] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-22 08:09:21] [INFO ] After 2231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 2498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2498 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2497 transition count 2098
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 2497 transition count 2096
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 2495 transition count 2096
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 2 with 2 rules applied. Total rules applied 8 place count 2494 transition count 2095
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 2494 transition count 2095
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 2493 transition count 2094
Applied a total of 12 rules in 438 ms. Remains 2493 /2498 variables (removed 5) and now considering 2094/2099 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 438 ms. Remains : 2493/2498 places, 2094/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 100887 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100887 steps, saw 72244 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-22 08:09:25] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-22 08:09:25] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:09:25] [INFO ] [Nat]Absence check using 1098 positive place invariants in 238 ms returned sat
[2023-03-22 08:09:27] [INFO ] After 1169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:09:27] [INFO ] After 1399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-22 08:09:27] [INFO ] After 2108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 2493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 102 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 90 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
[2023-03-22 08:09:27] [INFO ] Invariant cache hit.
[2023-03-22 08:09:29] [INFO ] Implicit Places using invariants in 2261 ms returned []
[2023-03-22 08:09:29] [INFO ] Invariant cache hit.
[2023-03-22 08:09:34] [INFO ] Implicit Places using invariants and state equation in 4700 ms returned []
Implicit Place search using SMT with State Equation took 6980 ms to find 0 implicit places.
[2023-03-22 08:09:34] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-22 08:09:34] [INFO ] Invariant cache hit.
[2023-03-22 08:09:36] [INFO ] Dead Transitions using invariants and state equation in 2126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9274 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2493 transition count 2094
Applied a total of 596 rules in 252 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-22 08:09:37] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:09:37] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:09:38] [INFO ] [Nat]Absence check using 1098 positive place invariants in 261 ms returned sat
[2023-03-22 08:09:39] [INFO ] After 1528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:09:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-22 08:09:39] [INFO ] After 100ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:09:39] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-22 08:09:39] [INFO ] After 2523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p1), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 761 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 284 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 2099 rows 2498 cols
[2023-03-22 08:09:41] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:09:46] [INFO ] [Real]Absence check using 1098 positive place invariants in 1267 ms returned sat
[2023-03-22 08:09:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:09:56] [INFO ] [Real]Absence check using state equation in 10309 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Applied a total of 0 rules in 93 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2023-03-22 08:09:56] [INFO ] Invariant cache hit.
[2023-03-22 08:09:58] [INFO ] Implicit Places using invariants in 2444 ms returned []
[2023-03-22 08:09:58] [INFO ] Invariant cache hit.
[2023-03-22 08:10:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 08:10:04] [INFO ] Implicit Places using invariants and state equation in 5472 ms returned []
Implicit Place search using SMT with State Equation took 7925 ms to find 0 implicit places.
[2023-03-22 08:10:04] [INFO ] Invariant cache hit.
[2023-03-22 08:10:06] [INFO ] Dead Transitions using invariants and state equation in 2108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10161 ms. Remains : 2498/2498 places, 2099/2099 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 p2 p0 (NOT p1)), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 576 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 283 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 08:10:07] [INFO ] Invariant cache hit.
[2023-03-22 08:10:08] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:10:08] [INFO ] [Nat]Absence check using 1098 positive place invariants in 204 ms returned sat
[2023-03-22 08:10:09] [INFO ] After 1214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:10:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 08:10:09] [INFO ] After 95ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:10:10] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-22 08:10:10] [INFO ] After 2225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 2498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2498 transition count 2098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2497 transition count 2098
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 2497 transition count 2096
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 2495 transition count 2096
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 2 with 2 rules applied. Total rules applied 8 place count 2494 transition count 2095
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 2494 transition count 2095
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 2493 transition count 2094
Applied a total of 12 rules in 440 ms. Remains 2493 /2498 variables (removed 5) and now considering 2094/2099 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 2493/2498 places, 2094/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 98435 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98435 steps, saw 70570 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-22 08:10:14] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-22 08:10:14] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:10:15] [INFO ] [Nat]Absence check using 1098 positive place invariants in 272 ms returned sat
[2023-03-22 08:10:16] [INFO ] After 1469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:10:16] [INFO ] After 1632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-22 08:10:16] [INFO ] After 2471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 2493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 106 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2493/2493 places, 2094/2094 transitions.
Applied a total of 0 rules in 91 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
[2023-03-22 08:10:17] [INFO ] Invariant cache hit.
[2023-03-22 08:10:19] [INFO ] Implicit Places using invariants in 2597 ms returned []
[2023-03-22 08:10:19] [INFO ] Invariant cache hit.
[2023-03-22 08:10:24] [INFO ] Implicit Places using invariants and state equation in 5000 ms returned []
Implicit Place search using SMT with State Equation took 7603 ms to find 0 implicit places.
[2023-03-22 08:10:24] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-22 08:10:24] [INFO ] Invariant cache hit.
[2023-03-22 08:10:27] [INFO ] Dead Transitions using invariants and state equation in 2222 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10031 ms. Remains : 2493/2493 places, 2094/2094 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2493 transition count 2094
Applied a total of 596 rules in 308 ms. Remains 2493 /2493 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2094 rows 2493 cols
[2023-03-22 08:10:27] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-22 08:10:27] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 08:10:28] [INFO ] [Nat]Absence check using 1098 positive place invariants in 264 ms returned sat
[2023-03-22 08:10:29] [INFO ] After 1386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 08:10:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-22 08:10:30] [INFO ] After 103ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 08:10:30] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-22 08:10:30] [INFO ] After 2655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p1), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 630 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 291 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
// Phase 1: matrix 2099 rows 2498 cols
[2023-03-22 08:10:31] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 08:10:36] [INFO ] [Real]Absence check using 1098 positive place invariants in 1286 ms returned sat
[2023-03-22 08:10:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 08:10:46] [INFO ] [Real]Absence check using state equation in 10570 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4 reset in 1377 ms.
Product exploration explored 100000 steps with 0 reset in 1837 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (NOT p1)]
Support contains 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Applied a total of 0 rules in 132 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2023-03-22 08:10:50] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-22 08:10:50] [INFO ] Invariant cache hit.
[2023-03-22 08:10:53] [INFO ] Dead Transitions using invariants and state equation in 2179 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2435 ms. Remains : 2498/2498 places, 2099/2099 transitions.
Support contains 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 2099/2099 transitions.
Applied a total of 0 rules in 80 ms. Remains 2498 /2498 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2023-03-22 08:10:53] [INFO ] Invariant cache hit.
[2023-03-22 08:10:55] [INFO ] Implicit Places using invariants in 2207 ms returned []
[2023-03-22 08:10:55] [INFO ] Invariant cache hit.
[2023-03-22 08:10:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 08:11:00] [INFO ] Implicit Places using invariants and state equation in 5436 ms returned []
Implicit Place search using SMT with State Equation took 7659 ms to find 0 implicit places.
[2023-03-22 08:11:00] [INFO ] Invariant cache hit.
[2023-03-22 08:11:02] [INFO ] Dead Transitions using invariants and state equation in 1850 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9590 ms. Remains : 2498/2498 places, 2099/2099 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-11 finished in 121913 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)))'
[2023-03-22 08:11:03] [INFO ] Flatten gal took : 194 ms
[2023-03-22 08:11:03] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-22 08:11:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6706 places, 6006 transitions and 15612 arcs took 27 ms.
Total runtime 848916 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2516/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2516/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2516/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2516/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPt-PT-100B-LTLCardinality-00
Could not compute solution for formula : ShieldPPPt-PT-100B-LTLCardinality-09
Could not compute solution for formula : ShieldPPPt-PT-100B-LTLCardinality-11
Could not compute solution for formula : ShieldPPPt-PT-100B-LTLCardinality-12

BK_STOP 1679472684457

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPt-PT-100B-LTLCardinality-00
ltl formula formula --ltl=/tmp/2516/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 6706 places, 6006 transitions and 15612 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 1.030 real 0.270 user 0.560 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2516/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2516/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2516/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2516/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPt-PT-100B-LTLCardinality-09
ltl formula formula --ltl=/tmp/2516/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 6706 places, 6006 transitions and 15612 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 1.110 real 0.350 user 0.410 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2516/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2516/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2516/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2516/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 ShieldPPPt-PT-100B-LTLCardinality-11
ltl formula formula --ltl=/tmp/2516/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 6706 places, 6006 transitions and 15612 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 1.060 real 0.340 user 0.490 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2516/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2516/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2516/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2516/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name ShieldPPPt-PT-100B-LTLCardinality-12
ltl formula formula --ltl=/tmp/2516/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 6706 places, 6006 transitions and 15612 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 1.170 real 0.370 user 0.420 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2516/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2516/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2516/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2516/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
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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