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.r391-oct2-167903715600700.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 lolaxred
Input is ShieldPPPt-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715600700
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679281484544

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 03:04:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 03:04:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 03:04:47] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2023-03-20 03:04:47] [INFO ] Transformed 7803 places.
[2023-03-20 03:04:47] [INFO ] Transformed 7103 transitions.
[2023-03-20 03:04:47] [INFO ] Found NUPN structural information;
[2023-03-20 03:04:47] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 801 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-100B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 7803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Discarding 1092 places :
Symmetric choice reduction at 0 with 1092 rule applications. Total rules 1092 place count 6711 transition count 6011
Iterating global reduction 0 with 1092 rules applied. Total rules applied 2184 place count 6711 transition count 6011
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2185 place count 6710 transition count 6010
Iterating global reduction 0 with 1 rules applied. Total rules applied 2186 place count 6710 transition count 6010
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2187 place count 6709 transition count 6009
Iterating global reduction 0 with 1 rules applied. Total rules applied 2188 place count 6709 transition count 6009
Applied a total of 2188 rules in 5917 ms. Remains 6709 /7803 variables (removed 1094) and now considering 6009/7103 (removed 1094) transitions.
// Phase 1: matrix 6009 rows 6709 cols
[2023-03-20 03:04:54] [INFO ] Computed 1101 place invariants in 126 ms
[2023-03-20 03:04:59] [INFO ] Implicit Places using invariants in 4901 ms returned []
[2023-03-20 03:04:59] [INFO ] Invariant cache hit.
[2023-03-20 03:05:02] [INFO ] Implicit Places using invariants and state equation in 3420 ms returned []
Implicit Place search using SMT with State Equation took 8389 ms to find 0 implicit places.
[2023-03-20 03:05:02] [INFO ] Invariant cache hit.
[2023-03-20 03:05:12] [INFO ] Dead Transitions using invariants and state equation in 9465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6709/7803 places, 6009/7103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23798 ms. Remains : 6709/7803 places, 6009/7103 transitions.
Support contains 32 out of 6709 places after structural reductions.
[2023-03-20 03:05:13] [INFO ] Flatten gal took : 388 ms
[2023-03-20 03:05:13] [INFO ] Flatten gal took : 266 ms
[2023-03-20 03:05:13] [INFO ] Input system was already deterministic with 6009 transitions.
Support contains 30 out of 6709 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 692 ms. (steps per millisecond=14 ) properties (out of 24) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-20 03:05:14] [INFO ] Invariant cache hit.
[2023-03-20 03:05:19] [INFO ] [Real]Absence check using 1101 positive place invariants in 1259 ms returned sat
[2023-03-20 03:05:19] [INFO ] After 4352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-20 03:05:23] [INFO ] [Nat]Absence check using 1101 positive place invariants in 857 ms returned sat
[2023-03-20 03:05:36] [INFO ] After 10802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-20 03:05:40] [INFO ] Deduced a trap composed of 20 places in 4097 ms of which 25 ms to minimize.
[2023-03-20 03:05:44] [INFO ] Deduced a trap composed of 30 places in 3469 ms of which 3 ms to minimize.
[2023-03-20 03:05:47] [INFO ] Deduced a trap composed of 27 places in 3263 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 03:05:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 03:05:47] [INFO ] After 28325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 7729 ms.
Support contains 20 out of 6709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Drop transitions removed 1386 transitions
Trivial Post-agglo rules discarded 1386 transitions
Performed 1386 trivial Post agglomeration. Transition count delta: 1386
Iterating post reduction 0 with 1386 rules applied. Total rules applied 1386 place count 6709 transition count 4623
Reduce places removed 1386 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1387 rules applied. Total rules applied 2773 place count 5323 transition count 4622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2774 place count 5322 transition count 4622
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 795 Pre rules applied. Total rules applied 2774 place count 5322 transition count 3827
Deduced a syphon composed of 795 places in 15 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 3 with 1590 rules applied. Total rules applied 4364 place count 4527 transition count 3827
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 4365 place count 4526 transition count 3826
Iterating global reduction 3 with 1 rules applied. Total rules applied 4366 place count 4526 transition count 3826
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4366 place count 4526 transition count 3825
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4368 place count 4525 transition count 3825
Performed 1703 Post agglomeration using F-continuation condition.Transition count delta: 1703
Deduced a syphon composed of 1703 places in 14 ms
Reduce places removed 1703 places and 0 transitions.
Iterating global reduction 3 with 3406 rules applied. Total rules applied 7774 place count 2822 transition count 2122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7775 place count 2822 transition count 2121
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 7777 place count 2821 transition count 2120
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 7979 place count 2720 transition count 2120
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 8181 place count 2619 transition count 2120
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 13 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 180 rules applied. Total rules applied 8361 place count 2529 transition count 2120
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8363 place count 2529 transition count 2118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8365 place count 2527 transition count 2118
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 5 with 296 rules applied. Total rules applied 8661 place count 2527 transition count 2118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8662 place count 2526 transition count 2117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8663 place count 2525 transition count 2117
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 8663 place count 2525 transition count 2115
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 8667 place count 2523 transition count 2115
Applied a total of 8667 rules in 3080 ms. Remains 2523 /6709 variables (removed 4186) and now considering 2115/6009 (removed 3894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3081 ms. Remains : 2523/6709 places, 2115/6009 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 2115 rows 2523 cols
[2023-03-20 03:06:01] [INFO ] Computed 1100 place invariants in 6 ms
[2023-03-20 03:06:03] [INFO ] [Real]Absence check using 1100 positive place invariants in 531 ms returned sat
[2023-03-20 03:06:03] [INFO ] After 2048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 03:06:04] [INFO ] [Nat]Absence check using 1100 positive place invariants in 342 ms returned sat
[2023-03-20 03:06:08] [INFO ] After 3161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 03:06:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 03:06:10] [INFO ] After 1503ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-20 03:06:10] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
[2023-03-20 03:06:11] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 1 ms to minimize.
[2023-03-20 03:06:11] [INFO ] Deduced a trap composed of 5 places in 403 ms of which 0 ms to minimize.
[2023-03-20 03:06:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1337 ms
[2023-03-20 03:06:13] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 1 ms to minimize.
[2023-03-20 03:06:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 455 ms
[2023-03-20 03:06:14] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 0 ms to minimize.
[2023-03-20 03:06:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 518 ms
[2023-03-20 03:06:15] [INFO ] After 6219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1481 ms.
[2023-03-20 03:06:16] [INFO ] After 13037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 534 ms.
Support contains 18 out of 2523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2523/2523 places, 2115/2115 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 23 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2521 transition count 2113
Applied a total of 4 rules in 279 ms. Remains 2521 /2523 variables (removed 2) and now considering 2113/2115 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 2521/2523 places, 2113/2115 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 82369 steps, run timeout after 6001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 82369 steps, saw 67170 distinct states, run finished after 6006 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 2113 rows 2521 cols
[2023-03-20 03:06:26] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-20 03:06:27] [INFO ] [Real]Absence check using 1100 positive place invariants in 300 ms returned sat
[2023-03-20 03:06:28] [INFO ] After 1995ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 03:06:29] [INFO ] [Nat]Absence check using 1100 positive place invariants in 352 ms returned sat
[2023-03-20 03:06:34] [INFO ] After 4176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 03:06:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 03:06:36] [INFO ] After 1592ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-20 03:06:36] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 0 ms to minimize.
[2023-03-20 03:06:37] [INFO ] Deduced a trap composed of 6 places in 367 ms of which 1 ms to minimize.
[2023-03-20 03:06:37] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 1 ms to minimize.
[2023-03-20 03:06:38] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 1 ms to minimize.
[2023-03-20 03:06:38] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 0 ms to minimize.
[2023-03-20 03:06:38] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 1 ms to minimize.
[2023-03-20 03:06:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2417 ms
[2023-03-20 03:06:40] [INFO ] Deduced a trap composed of 5 places in 468 ms of which 1 ms to minimize.
[2023-03-20 03:06:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 647 ms
[2023-03-20 03:06:41] [INFO ] After 6960ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1585 ms.
[2023-03-20 03:06:43] [INFO ] After 15262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 339 ms.
Support contains 18 out of 2521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2521/2521 places, 2113/2113 transitions.
Applied a total of 0 rules in 109 ms. Remains 2521 /2521 variables (removed 0) and now considering 2113/2113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 2521/2521 places, 2113/2113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2521/2521 places, 2113/2113 transitions.
Applied a total of 0 rules in 116 ms. Remains 2521 /2521 variables (removed 0) and now considering 2113/2113 (removed 0) transitions.
[2023-03-20 03:06:44] [INFO ] Invariant cache hit.
[2023-03-20 03:06:46] [INFO ] Implicit Places using invariants in 2281 ms returned [2504, 2508]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2285 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2519/2521 places, 2113/2113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2517 transition count 2111
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2517 transition count 2111
Applied a total of 4 rules in 184 ms. Remains 2517 /2519 variables (removed 2) and now considering 2111/2113 (removed 2) transitions.
// Phase 1: matrix 2111 rows 2517 cols
[2023-03-20 03:06:46] [INFO ] Computed 1098 place invariants in 16 ms
[2023-03-20 03:06:49] [INFO ] Implicit Places using invariants in 3269 ms returned []
[2023-03-20 03:06:49] [INFO ] Invariant cache hit.
[2023-03-20 03:06:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 03:06:55] [INFO ] Implicit Places using invariants and state equation in 5253 ms returned []
Implicit Place search using SMT with State Equation took 8562 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2517/2521 places, 2111/2113 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11147 ms. Remains : 2517/2521 places, 2111/2113 transitions.
FORMULA ShieldPPPt-PT-100B-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1600 stabilizing places and 1600 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' '!(G(p0))'
Support contains 1 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1401 transitions
Trivial Post-agglo rules discarded 1401 transitions
Performed 1401 trivial Post agglomeration. Transition count delta: 1401
Iterating post reduction 0 with 1401 rules applied. Total rules applied 1401 place count 6708 transition count 4607
Reduce places removed 1401 places and 0 transitions.
Iterating post reduction 1 with 1401 rules applied. Total rules applied 2802 place count 5307 transition count 4607
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2802 place count 5307 transition count 3811
Deduced a syphon composed of 796 places in 13 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 4394 place count 4511 transition count 3811
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 4399 place count 4506 transition count 3806
Iterating global reduction 2 with 5 rules applied. Total rules applied 4404 place count 4506 transition count 3806
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4404 place count 4506 transition count 3802
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 4412 place count 4502 transition count 3802
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 6 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7810 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7811 place count 2803 transition count 2102
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 7813 place count 2802 transition count 2101
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 8015 place count 2701 transition count 2101
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 8217 place count 2600 transition count 2101
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 8411 place count 2503 transition count 2101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8413 place count 2501 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8414 place count 2500 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8414 place count 2500 transition count 2097
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 8418 place count 2498 transition count 2097
Applied a total of 8418 rules in 2528 ms. Remains 2498 /6709 variables (removed 4211) and now considering 2097/6009 (removed 3912) transitions.
// Phase 1: matrix 2097 rows 2498 cols
[2023-03-20 03:06:58] [INFO ] Computed 1100 place invariants in 10 ms
[2023-03-20 03:07:00] [INFO ] Implicit Places using invariants in 1988 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1989 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2496/6709 places, 2097/6009 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 2494 transition count 2095
Applied a total of 4 rules in 233 ms. Remains 2494 /2496 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2494 cols
[2023-03-20 03:07:00] [INFO ] Computed 1098 place invariants in 19 ms
[2023-03-20 03:07:02] [INFO ] Implicit Places using invariants in 2403 ms returned []
[2023-03-20 03:07:02] [INFO ] Invariant cache hit.
[2023-03-20 03:07:08] [INFO ] Implicit Places using invariants and state equation in 5223 ms returned []
Implicit Place search using SMT with State Equation took 7630 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2494/6709 places, 2095/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12381 ms. Remains : 2494/6709 places, 2095/6009 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-00 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}]], initial=1, aps=[p0:(NEQ s1996 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1633 ms.
Product exploration explored 100000 steps with 0 reset in 2071 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 231 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 87 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 93989 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93989 steps, saw 71443 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:07:15] [INFO ] Invariant cache hit.
[2023-03-20 03:07:16] [INFO ] [Real]Absence check using 1098 positive place invariants in 272 ms returned sat
[2023-03-20 03:07:17] [INFO ] After 2100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:07:18] [INFO ] [Nat]Absence check using 1098 positive place invariants in 436 ms returned sat
[2023-03-20 03:07:20] [INFO ] After 1433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:07:20] [INFO ] After 1670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-20 03:07:20] [INFO ] After 2686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 238 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100B-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100B-LTLFireability-00 finished in 25199 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(F((p1 U (p2||G(p1)))))))))'
Support contains 3 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 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 6708 transition count 4609
Reduce places removed 1399 places and 0 transitions.
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2798 place count 5309 transition count 4609
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 796 Pre rules applied. Total rules applied 2798 place count 5309 transition count 3813
Deduced a syphon composed of 796 places in 13 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 2 with 1592 rules applied. Total rules applied 4390 place count 4513 transition count 3813
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 4395 place count 4508 transition count 3808
Iterating global reduction 2 with 5 rules applied. Total rules applied 4400 place count 4508 transition count 3808
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 4508 transition count 3804
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4408 place count 4504 transition count 3804
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 7 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7806 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7807 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 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7809 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 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8011 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 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8213 place count 2602 transition count 2103
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8405 place count 2506 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8407 place count 2504 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8408 place count 2503 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8408 place count 2503 transition count 2099
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 8412 place count 2501 transition count 2099
Applied a total of 8412 rules in 2849 ms. Remains 2501 /6709 variables (removed 4208) and now considering 2099/6009 (removed 3910) transitions.
// Phase 1: matrix 2099 rows 2501 cols
[2023-03-20 03:07:23] [INFO ] Computed 1100 place invariants in 9 ms
[2023-03-20 03:07:26] [INFO ] Implicit Places using invariants in 3055 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3072 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6709 places, 2099/6009 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 2097
Applied a total of 4 rules in 190 ms. Remains 2497 /2499 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2023-03-20 03:07:26] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-20 03:07:30] [INFO ] Implicit Places using invariants in 3128 ms returned []
[2023-03-20 03:07:30] [INFO ] Invariant cache hit.
[2023-03-20 03:07:34] [INFO ] Implicit Places using invariants and state equation in 4553 ms returned []
Implicit Place search using SMT with State Equation took 7684 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6709 places, 2097/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13796 ms. Remains : 2497/6709 places, 2097/6009 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NEQ s1677 1) (NEQ s810 1)), p0:(EQ s2155 0), p1:(NEQ s810 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 0 reset in 1610 ms.
Product exploration explored 100000 steps with 0 reset in 1983 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 355 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 73580 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73580 steps, saw 55713 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 03:07:42] [INFO ] Invariant cache hit.
[2023-03-20 03:07:43] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:07:43] [INFO ] [Nat]Absence check using 1098 positive place invariants in 272 ms returned sat
[2023-03-20 03:07:45] [INFO ] After 1443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:07:45] [INFO ] After 1919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 224 ms.
[2023-03-20 03:07:46] [INFO ] After 2904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 143 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 130 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 73961 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73961 steps, saw 56018 distinct states, run finished after 3016 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 03:07:49] [INFO ] Invariant cache hit.
[2023-03-20 03:07:50] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:07:50] [INFO ] [Nat]Absence check using 1098 positive place invariants in 233 ms returned sat
[2023-03-20 03:07:52] [INFO ] After 1325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:07:52] [INFO ] After 1728ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-03-20 03:07:52] [INFO ] After 2655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 113 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 101 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 126 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-20 03:07:53] [INFO ] Invariant cache hit.
[2023-03-20 03:07:55] [INFO ] Implicit Places using invariants in 2571 ms returned []
[2023-03-20 03:07:55] [INFO ] Invariant cache hit.
[2023-03-20 03:08:00] [INFO ] Implicit Places using invariants and state equation in 4310 ms returned []
Implicit Place search using SMT with State Equation took 6883 ms to find 0 implicit places.
[2023-03-20 03:08:00] [INFO ] Redundant transitions in 194 ms returned []
[2023-03-20 03:08:00] [INFO ] Invariant cache hit.
[2023-03-20 03:08:02] [INFO ] Dead Transitions using invariants and state equation in 2427 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9655 ms. Remains : 2497/2497 places, 2097/2097 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 2497 transition count 2097
Applied a total of 593 rules in 251 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2497 cols
[2023-03-20 03:08:03] [INFO ] Computed 1098 place invariants in 10 ms
[2023-03-20 03:08:03] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:08:04] [INFO ] [Nat]Absence check using 1098 positive place invariants in 265 ms returned sat
[2023-03-20 03:08:05] [INFO ] After 1481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:08:06] [INFO ] After 1870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 241 ms.
[2023-03-20 03:08:06] [INFO ] After 2903ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 455 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 134 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2023-03-20 03:08:07] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:08:10] [INFO ] Implicit Places using invariants in 3196 ms returned []
[2023-03-20 03:08:10] [INFO ] Invariant cache hit.
[2023-03-20 03:08:15] [INFO ] Implicit Places using invariants and state equation in 5060 ms returned []
Implicit Place search using SMT with State Equation took 8269 ms to find 0 implicit places.
[2023-03-20 03:08:15] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-20 03:08:15] [INFO ] Invariant cache hit.
[2023-03-20 03:08:17] [INFO ] Dead Transitions using invariants and state equation in 2064 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10571 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 346 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 85568 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85568 steps, saw 64780 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 03:08:21] [INFO ] Invariant cache hit.
[2023-03-20 03:08:22] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:08:22] [INFO ] [Nat]Absence check using 1098 positive place invariants in 241 ms returned sat
[2023-03-20 03:08:24] [INFO ] After 1442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:08:24] [INFO ] After 1865ms 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-20 03:08:25] [INFO ] After 2899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 129 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 96 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 84823 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84823 steps, saw 64200 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 03:08:28] [INFO ] Invariant cache hit.
[2023-03-20 03:08:29] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:08:29] [INFO ] [Nat]Absence check using 1098 positive place invariants in 234 ms returned sat
[2023-03-20 03:08:31] [INFO ] After 1437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:08:31] [INFO ] After 1860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 261 ms.
[2023-03-20 03:08:32] [INFO ] After 2830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 102 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 94 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 88 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-20 03:08:32] [INFO ] Invariant cache hit.
[2023-03-20 03:08:34] [INFO ] Implicit Places using invariants in 2506 ms returned []
[2023-03-20 03:08:34] [INFO ] Invariant cache hit.
[2023-03-20 03:08:39] [INFO ] Implicit Places using invariants and state equation in 4707 ms returned []
Implicit Place search using SMT with State Equation took 7233 ms to find 0 implicit places.
[2023-03-20 03:08:39] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-20 03:08:39] [INFO ] Invariant cache hit.
[2023-03-20 03:08:42] [INFO ] Dead Transitions using invariants and state equation in 2580 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9975 ms. Remains : 2497/2497 places, 2097/2097 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 2497 transition count 2097
Applied a total of 593 rules in 244 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2497 cols
[2023-03-20 03:08:42] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-20 03:08:43] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:08:43] [INFO ] [Nat]Absence check using 1098 positive place invariants in 259 ms returned sat
[2023-03-20 03:08:45] [INFO ] After 1546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:08:45] [INFO ] After 1982ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 260 ms.
[2023-03-20 03:08:46] [INFO ] After 3029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 409 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1589 ms.
Product exploration explored 100000 steps with 0 reset in 1922 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 2097/2097 transitions.
Applied a total of 0 rules in 93 ms. Remains 2497 /2497 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2023-03-20 03:08:50] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:08:52] [INFO ] Implicit Places using invariants in 1694 ms returned []
[2023-03-20 03:08:52] [INFO ] Invariant cache hit.
[2023-03-20 03:08:57] [INFO ] Implicit Places using invariants and state equation in 4862 ms returned []
Implicit Place search using SMT with State Equation took 6589 ms to find 0 implicit places.
[2023-03-20 03:08:57] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-20 03:08:57] [INFO ] Invariant cache hit.
[2023-03-20 03:08:59] [INFO ] Dead Transitions using invariants and state equation in 2078 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8805 ms. Remains : 2497/2497 places, 2097/2097 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLFireability-01 finished in 99067 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)||(p1&&X(p2))) U X(p1)))'
Support contains 3 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 6701 transition count 6001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 6701 transition count 6001
Applied a total of 16 rules in 2350 ms. Remains 6701 /6709 variables (removed 8) and now considering 6001/6009 (removed 8) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-20 03:09:02] [INFO ] Computed 1101 place invariants in 57 ms
[2023-03-20 03:09:03] [INFO ] Implicit Places using invariants in 912 ms returned []
[2023-03-20 03:09:03] [INFO ] Invariant cache hit.
[2023-03-20 03:09:06] [INFO ] Implicit Places using invariants and state equation in 3138 ms returned []
Implicit Place search using SMT with State Equation took 4069 ms to find 0 implicit places.
[2023-03-20 03:09:06] [INFO ] Invariant cache hit.
[2023-03-20 03:09:12] [INFO ] Dead Transitions using invariants and state equation in 6330 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6701/6709 places, 6001/6009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12767 ms. Remains : 6701/6709 places, 6001/6009 transitions.
Stuttering acceptance computed with spot in 373 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s4433 1), p1:(EQ s3166 1), p2:(EQ s3984 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 114 reset in 1016 ms.
Product exploration explored 100000 steps with 116 reset in 949 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/6701 stabilizing places and 1598/6001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 511 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:09:16] [INFO ] Invariant cache hit.
[2023-03-20 03:09:18] [INFO ] [Real]Absence check using 1101 positive place invariants in 748 ms returned sat
[2023-03-20 03:09:23] [INFO ] After 7379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:09:25] [INFO ] [Nat]Absence check using 1101 positive place invariants in 946 ms returned sat
[2023-03-20 03:09:32] [INFO ] After 7094ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:09:35] [INFO ] Deduced a trap composed of 18 places in 2716 ms of which 4 ms to minimize.
[2023-03-20 03:09:38] [INFO ] Deduced a trap composed of 19 places in 2819 ms of which 3 ms to minimize.
[2023-03-20 03:09:42] [INFO ] Deduced a trap composed of 22 places in 3078 ms of which 3 ms to minimize.
[2023-03-20 03:09:45] [INFO ] Deduced a trap composed of 17 places in 2625 ms of which 4 ms to minimize.
[2023-03-20 03:09:48] [INFO ] Deduced a trap composed of 23 places in 3562 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 03:09:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 03:09:48] [INFO ] After 25155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 123 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 15 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 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 6 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7798 place count 2802 transition count 2102
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 2802 transition count 2101
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 2801 transition count 2100
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 8003 place count 2700 transition count 2100
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 8205 place count 2599 transition count 2100
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 8399 place count 2502 transition count 2100
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8698 place count 2502 transition count 2100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8699 place count 2501 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8700 place count 2500 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8700 place count 2500 transition count 2097
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 8704 place count 2498 transition count 2097
Applied a total of 8704 rules in 2203 ms. Remains 2498 /6701 variables (removed 4203) and now considering 2097/6001 (removed 3904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2204 ms. Remains : 2498/6701 places, 2097/6001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 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 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Finished probabilistic random walk after 53888 steps, run visited all 1 properties in 2135 ms. (steps per millisecond=25 )
Probabilistic random walk after 53888 steps, saw 36494 distinct states, run finished after 2137 ms. (steps per millisecond=25 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1)]
Knowledge based reduction with 8 factoid took 745 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2023-03-20 03:09:55] [INFO ] Invariant cache hit.
[2023-03-20 03:10:10] [INFO ] [Real]Absence check using 1101 positive place invariants in 6330 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 6701 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 6701/6701 places, 6001/6001 transitions.
Applied a total of 0 rules in 1256 ms. Remains 6701 /6701 variables (removed 0) and now considering 6001/6001 (removed 0) transitions.
[2023-03-20 03:10:11] [INFO ] Invariant cache hit.
[2023-03-20 03:10:14] [INFO ] Implicit Places using invariants in 3586 ms returned []
[2023-03-20 03:10:14] [INFO ] Invariant cache hit.
[2023-03-20 03:10:18] [INFO ] Implicit Places using invariants and state equation in 3628 ms returned []
Implicit Place search using SMT with State Equation took 7231 ms to find 0 implicit places.
[2023-03-20 03:10:18] [INFO ] Invariant cache hit.
[2023-03-20 03:10:26] [INFO ] Dead Transitions using invariants and state equation in 7748 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16247 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
Detected a total of 1598/6701 stabilizing places and 1598/6001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 515 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :2
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-20 03:10:27] [INFO ] Invariant cache hit.
[2023-03-20 03:10:30] [INFO ] [Real]Absence check using 1101 positive place invariants in 1161 ms returned sat
[2023-03-20 03:10:36] [INFO ] After 8609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:10:38] [INFO ] [Nat]Absence check using 1101 positive place invariants in 730 ms returned sat
[2023-03-20 03:10:44] [INFO ] After 6389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:10:47] [INFO ] Deduced a trap composed of 18 places in 2906 ms of which 3 ms to minimize.
[2023-03-20 03:10:51] [INFO ] Deduced a trap composed of 19 places in 3307 ms of which 4 ms to minimize.
[2023-03-20 03:10:54] [INFO ] Deduced a trap composed of 22 places in 3158 ms of which 6 ms to minimize.
[2023-03-20 03:10:57] [INFO ] Deduced a trap composed of 17 places in 2961 ms of which 6 ms to minimize.
[2023-03-20 03:11:00] [INFO ] Deduced a trap composed of 23 places in 2692 ms of which 4 ms to minimize.
[2023-03-20 03:11:04] [INFO ] Deduced a trap composed of 21 places in 3084 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-20 03:11:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 03:11:04] [INFO ] After 27970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 122 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 14 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 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 6 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7798 place count 2802 transition count 2102
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 2802 transition count 2101
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 7801 place count 2801 transition count 2100
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8003 place count 2700 transition count 2100
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 8205 place count 2599 transition count 2100
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 8399 place count 2502 transition count 2100
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 3 with 299 rules applied. Total rules applied 8698 place count 2502 transition count 2100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8699 place count 2501 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8700 place count 2500 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8700 place count 2500 transition count 2097
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 8704 place count 2498 transition count 2097
Applied a total of 8704 rules in 2210 ms. Remains 2498 /6701 variables (removed 4203) and now considering 2097/6001 (removed 3904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2211 ms. Remains : 2498/6701 places, 2097/6001 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 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Finished probabilistic random walk after 53888 steps, run visited all 1 properties in 2107 ms. (steps per millisecond=25 )
Probabilistic random walk after 53888 steps, saw 36494 distinct states, run finished after 2110 ms. (steps per millisecond=25 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1)]
Knowledge based reduction with 7 factoid took 571 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2023-03-20 03:11:10] [INFO ] Invariant cache hit.
[2023-03-20 03:11:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 6609 ms returned sat
[2023-03-20 03:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:11:25] [INFO ] [Real]Absence check using state equation in 1337 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 115 reset in 870 ms.
Product exploration explored 100000 steps with 116 reset in 965 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 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 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 500 Pre rules applied. Total rules applied 1399 place count 6701 transition count 6401
Deduced a syphon composed of 1899 places in 22 ms
Iterating global reduction 1 with 500 rules applied. Total rules applied 1899 place count 6701 transition count 6401
Performed 1898 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3797 places in 26 ms
Iterating global reduction 1 with 1898 rules applied. Total rules applied 3797 place count 6701 transition count 6401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3798 place count 6701 transition count 6400
Renaming transitions due to excessive name length > 1024 char.
Discarding 701 places :
Symmetric choice reduction at 2 with 701 rule applications. Total rules 4499 place count 6000 transition count 5699
Deduced a syphon composed of 3096 places in 57 ms
Iterating global reduction 2 with 701 rules applied. Total rules applied 5200 place count 6000 transition count 5699
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3097 places in 23 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5201 place count 6000 transition count 5699
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5203 place count 5998 transition count 5697
Deduced a syphon composed of 3095 places in 61 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5205 place count 5998 transition count 5697
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3196 places in 29 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5306 place count 5998 transition count 6127
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5407 place count 5897 transition count 5925
Deduced a syphon composed of 3095 places in 28 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5508 place count 5897 transition count 5925
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -427
Deduced a syphon composed of 3196 places in 27 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5609 place count 5897 transition count 6352
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5710 place count 5796 transition count 6150
Deduced a syphon composed of 3095 places in 25 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5811 place count 5796 transition count 6150
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 3196 places in 22 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5912 place count 5796 transition count 6580
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6013 place count 5695 transition count 6378
Deduced a syphon composed of 3095 places in 22 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6114 place count 5695 transition count 6378
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -408
Deduced a syphon composed of 3191 places in 20 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6210 place count 5695 transition count 6786
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 6306 place count 5599 transition count 6594
Deduced a syphon composed of 3095 places in 18 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6402 place count 5599 transition count 6594
Deduced a syphon composed of 3095 places in 17 ms
Applied a total of 6402 rules in 10744 ms. Remains 5599 /6701 variables (removed 1102) and now considering 6594/6001 (removed -593) transitions.
[2023-03-20 03:11:39] [INFO ] Redundant transitions in 366 ms returned []
// Phase 1: matrix 6594 rows 5599 cols
[2023-03-20 03:11:39] [INFO ] Computed 1101 place invariants in 166 ms
[2023-03-20 03:11:46] [INFO ] Dead Transitions using invariants and state equation in 7243 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5599/6701 places, 6594/6001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18384 ms. Remains : 5599/6701 places, 6594/6001 transitions.
Support contains 2 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 1120 ms. Remains 6701 /6701 variables (removed 0) and now considering 6001/6001 (removed 0) transitions.
// Phase 1: matrix 6001 rows 6701 cols
[2023-03-20 03:11:47] [INFO ] Computed 1101 place invariants in 49 ms
[2023-03-20 03:11:48] [INFO ] Implicit Places using invariants in 1295 ms returned []
[2023-03-20 03:11:48] [INFO ] Invariant cache hit.
[2023-03-20 03:11:52] [INFO ] Implicit Places using invariants and state equation in 3774 ms returned []
Implicit Place search using SMT with State Equation took 5073 ms to find 0 implicit places.
[2023-03-20 03:11:52] [INFO ] Invariant cache hit.
[2023-03-20 03:11:59] [INFO ] Dead Transitions using invariants and state equation in 6739 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12947 ms. Remains : 6701/6701 places, 6001/6001 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLFireability-03 finished in 179776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p1)&&X(F((p2&&F(!p2))))))'
Support contains 6 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6702 transition count 6002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6702 transition count 6002
Applied a total of 14 rules in 2348 ms. Remains 6702 /6709 variables (removed 7) and now considering 6002/6009 (removed 7) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2023-03-20 03:12:02] [INFO ] Computed 1101 place invariants in 50 ms
[2023-03-20 03:12:02] [INFO ] Implicit Places using invariants in 927 ms returned []
[2023-03-20 03:12:02] [INFO ] Invariant cache hit.
[2023-03-20 03:12:06] [INFO ] Implicit Places using invariants and state equation in 3171 ms returned []
Implicit Place search using SMT with State Equation took 4116 ms to find 0 implicit places.
[2023-03-20 03:12:06] [INFO ] Invariant cache hit.
[2023-03-20 03:12:12] [INFO ] Dead Transitions using invariants and state equation in 6107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6709 places, 6002/6009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12572 ms. Remains : 6702/6709 places, 6002/6009 transitions.
Stuttering acceptance computed with spot in 306 ms :[true, true, p1, true, p2]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s1843 1) (EQ s1885 1)) (EQ s374 1)), p0:(AND (EQ s662 1) (EQ s688 1)), p2:(EQ s229 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1716 ms.
Stack based approach found an accepted trace after 3728 steps with 0 reset with depth 3729 and stack size 3729 in 64 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-04 finished in 14778 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 1 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 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 6708 transition count 4609
Reduce places removed 1399 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2799 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 2800 place count 5308 transition count 4608
Performed 796 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 796 Pre rules applied. Total rules applied 2800 place count 5308 transition count 3812
Deduced a syphon composed of 796 places in 12 ms
Reduce places removed 796 places and 0 transitions.
Iterating global reduction 3 with 1592 rules applied. Total rules applied 4392 place count 4512 transition count 3812
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 4398 place count 4506 transition count 3806
Iterating global reduction 3 with 6 rules applied. Total rules applied 4404 place count 4506 transition count 3806
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 4404 place count 4506 transition count 3801
Deduced a syphon composed of 5 places in 12 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 4414 place count 4501 transition count 3801
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 5 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 3 with 3396 rules applied. Total rules applied 7810 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7811 place count 2803 transition count 2102
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 7813 place count 2802 transition count 2101
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 8015 place count 2701 transition count 2101
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 8217 place count 2600 transition count 2101
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8409 place count 2504 transition count 2101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8411 place count 2502 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8412 place count 2501 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8412 place count 2501 transition count 2097
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 8416 place count 2499 transition count 2097
Applied a total of 8416 rules in 2488 ms. Remains 2499 /6709 variables (removed 4210) and now considering 2097/6009 (removed 3912) transitions.
// Phase 1: matrix 2097 rows 2499 cols
[2023-03-20 03:12:16] [INFO ] Computed 1100 place invariants in 6 ms
[2023-03-20 03:12:18] [INFO ] Implicit Places using invariants in 1579 ms returned []
[2023-03-20 03:12:18] [INFO ] Invariant cache hit.
[2023-03-20 03:12:23] [INFO ] Implicit Places using invariants and state equation in 5408 ms returned [2480, 2484]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7017 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/6709 places, 2097/6009 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 2495 transition count 2095
Applied a total of 4 rules in 234 ms. Remains 2495 /2497 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-20 03:12:24] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-20 03:12:27] [INFO ] Implicit Places using invariants in 3320 ms returned []
[2023-03-20 03:12:27] [INFO ] Invariant cache hit.
[2023-03-20 03:12:32] [INFO ] Implicit Places using invariants and state equation in 5311 ms returned []
Implicit Place search using SMT with State Equation took 8648 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2495/6709 places, 2095/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18387 ms. Remains : 2495/6709 places, 2095/6009 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2492 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 1459 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-06 finished in 19983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1&&X(F(p0))))))'
Support contains 2 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6702 transition count 6002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6702 transition count 6002
Applied a total of 14 rules in 2264 ms. Remains 6702 /6709 variables (removed 7) and now considering 6002/6009 (removed 7) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2023-03-20 03:12:36] [INFO ] Computed 1101 place invariants in 55 ms
[2023-03-20 03:12:40] [INFO ] Implicit Places using invariants in 3315 ms returned []
[2023-03-20 03:12:40] [INFO ] Invariant cache hit.
[2023-03-20 03:12:43] [INFO ] Implicit Places using invariants and state equation in 3189 ms returned []
Implicit Place search using SMT with State Equation took 6507 ms to find 0 implicit places.
[2023-03-20 03:12:43] [INFO ] Invariant cache hit.
[2023-03-20 03:12:49] [INFO ] Dead Transitions using invariants and state equation in 6299 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6709 places, 6002/6009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15074 ms. Remains : 6702/6709 places, 6002/6009 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s4111 0), p1:(EQ s5112 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3522 ms.
Product exploration explored 100000 steps with 50000 reset in 3473 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/6702 stabilizing places and 1598/6002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 6 factoid took 275 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100B-LTLFireability-08 finished in 22799 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 1 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 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 6708 transition count 4608
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5308 transition count 4608
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 795 Pre rules applied. Total rules applied 2800 place count 5308 transition count 3813
Deduced a syphon composed of 795 places in 31 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 2 with 1590 rules applied. Total rules applied 4390 place count 4513 transition count 3813
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 4396 place count 4507 transition count 3807
Iterating global reduction 2 with 6 rules applied. Total rules applied 4402 place count 4507 transition count 3807
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4402 place count 4507 transition count 3802
Deduced a syphon composed of 5 places in 26 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 4412 place count 4502 transition count 3802
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 6 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7810 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7811 place count 2803 transition count 2102
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 7813 place count 2802 transition count 2101
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 3 with 202 rules applied. Total rules applied 8015 place count 2701 transition count 2101
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 8217 place count 2600 transition count 2101
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8409 place count 2504 transition count 2101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8411 place count 2502 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8412 place count 2501 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8412 place count 2501 transition count 2097
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 8416 place count 2499 transition count 2097
Applied a total of 8416 rules in 2767 ms. Remains 2499 /6709 variables (removed 4210) and now considering 2097/6009 (removed 3912) transitions.
// Phase 1: matrix 2097 rows 2499 cols
[2023-03-20 03:13:00] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-20 03:13:02] [INFO ] Implicit Places using invariants in 2431 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2435 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/6709 places, 2097/6009 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 2495 transition count 2095
Applied a total of 4 rules in 209 ms. Remains 2495 /2497 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-20 03:13:02] [INFO ] Computed 1098 place invariants in 6 ms
[2023-03-20 03:13:05] [INFO ] Implicit Places using invariants in 2742 ms returned []
[2023-03-20 03:13:05] [INFO ] Invariant cache hit.
[2023-03-20 03:13:10] [INFO ] Implicit Places using invariants and state equation in 5310 ms returned []
Implicit Place search using SMT with State Equation took 8056 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2495/6709 places, 2095/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13468 ms. Remains : 2495/6709 places, 2095/6009 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-09 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:(NEQ s1947 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 1557 ms.
Product exploration explored 100000 steps with 0 reset in 2068 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 230 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 116 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 105131 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105131 steps, saw 79488 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:13:18] [INFO ] Invariant cache hit.
[2023-03-20 03:13:18] [INFO ] [Real]Absence check using 1098 positive place invariants in 290 ms returned sat
[2023-03-20 03:13:20] [INFO ] After 1382ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 03:13:20] [INFO ] After 1570ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-20 03:13:20] [INFO ] After 2555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 166 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) 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 105649 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105649 steps, saw 79890 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:13:24] [INFO ] Invariant cache hit.
[2023-03-20 03:13:25] [INFO ] [Real]Absence check using 1098 positive place invariants in 391 ms returned sat
[2023-03-20 03:13:26] [INFO ] After 1318ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 03:13:26] [INFO ] After 1519ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-20 03:13:26] [INFO ] After 2549ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 127 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 95 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2023-03-20 03:13:27] [INFO ] Invariant cache hit.
[2023-03-20 03:13:30] [INFO ] Implicit Places using invariants in 3295 ms returned []
[2023-03-20 03:13:30] [INFO ] Invariant cache hit.
[2023-03-20 03:13:35] [INFO ] Implicit Places using invariants and state equation in 5073 ms returned []
Implicit Place search using SMT with State Equation took 8389 ms to find 0 implicit places.
[2023-03-20 03:13:35] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-20 03:13:35] [INFO ] Invariant cache hit.
[2023-03-20 03:13:37] [INFO ] Dead Transitions using invariants and state equation in 1837 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10409 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2495 transition count 2095
Applied a total of 594 rules in 214 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-20 03:13:37] [INFO ] Computed 1098 place invariants in 3 ms
[2023-03-20 03:13:38] [INFO ] [Real]Absence check using 1098 positive place invariants in 249 ms returned sat
[2023-03-20 03:13:39] [INFO ] After 1299ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 03:13:39] [INFO ] After 1467ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-20 03:13:39] [INFO ] After 2352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 207 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 142 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 142 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-20 03:13:40] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:13:43] [INFO ] Implicit Places using invariants in 3204 ms returned []
[2023-03-20 03:13:43] [INFO ] Invariant cache hit.
[2023-03-20 03:13:48] [INFO ] Implicit Places using invariants and state equation in 4298 ms returned []
Implicit Place search using SMT with State Equation took 7506 ms to find 0 implicit places.
[2023-03-20 03:13:48] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-20 03:13:48] [INFO ] Invariant cache hit.
[2023-03-20 03:13:50] [INFO ] Dead Transitions using invariants and state equation in 2088 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9835 ms. Remains : 2495/2495 places, 2095/2095 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 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 104956 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104956 steps, saw 79351 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:13:53] [INFO ] Invariant cache hit.
[2023-03-20 03:13:54] [INFO ] [Real]Absence check using 1098 positive place invariants in 230 ms returned sat
[2023-03-20 03:13:55] [INFO ] After 1488ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 03:13:56] [INFO ] After 1666ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-20 03:13:56] [INFO ] After 2451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 94 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) 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 105257 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105257 steps, saw 79585 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:13:59] [INFO ] Invariant cache hit.
[2023-03-20 03:14:00] [INFO ] [Real]Absence check using 1098 positive place invariants in 263 ms returned sat
[2023-03-20 03:14:01] [INFO ] After 1529ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 03:14:02] [INFO ] After 1711ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-20 03:14:02] [INFO ] After 2514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 106 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 119 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2023-03-20 03:14:02] [INFO ] Invariant cache hit.
[2023-03-20 03:14:04] [INFO ] Implicit Places using invariants in 2441 ms returned []
[2023-03-20 03:14:04] [INFO ] Invariant cache hit.
[2023-03-20 03:14:10] [INFO ] Implicit Places using invariants and state equation in 5104 ms returned []
Implicit Place search using SMT with State Equation took 7558 ms to find 0 implicit places.
[2023-03-20 03:14:10] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-20 03:14:10] [INFO ] Invariant cache hit.
[2023-03-20 03:14:12] [INFO ] Dead Transitions using invariants and state equation in 1845 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9596 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2495 transition count 2095
Applied a total of 594 rules in 226 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-20 03:14:12] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-20 03:14:12] [INFO ] [Real]Absence check using 1098 positive place invariants in 238 ms returned sat
[2023-03-20 03:14:14] [INFO ] After 1347ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 03:14:14] [INFO ] After 1517ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 134 ms.
[2023-03-20 03:14:14] [INFO ] After 2406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 172 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 108 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1568 ms.
Product exploration explored 100000 steps with 0 reset in 1893 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 100 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-20 03:14:18] [INFO ] Computed 1098 place invariants in 11 ms
[2023-03-20 03:14:21] [INFO ] Implicit Places using invariants in 2520 ms returned []
[2023-03-20 03:14:21] [INFO ] Invariant cache hit.
[2023-03-20 03:14:26] [INFO ] Implicit Places using invariants and state equation in 4894 ms returned []
Implicit Place search using SMT with State Equation took 7421 ms to find 0 implicit places.
[2023-03-20 03:14:26] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-20 03:14:26] [INFO ] Invariant cache hit.
[2023-03-20 03:14:28] [INFO ] Dead Transitions using invariants and state equation in 2078 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9673 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLFireability-09 finished in 91401 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 3 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 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 6708 transition count 4611
Reduce places removed 1397 places and 0 transitions.
Iterating post reduction 1 with 1397 rules applied. Total rules applied 2794 place count 5311 transition count 4611
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 5311 transition count 3814
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 4388 place count 4514 transition count 3814
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 4393 place count 4509 transition count 3809
Iterating global reduction 2 with 5 rules applied. Total rules applied 4398 place count 4509 transition count 3809
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4398 place count 4509 transition count 3804
Deduced a syphon composed of 5 places in 11 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 4408 place count 4504 transition count 3804
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 5 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7804 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 7805 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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7807 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 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8009 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 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8211 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 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8405 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 8407 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 8408 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 8408 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 8412 place count 2501 transition count 2100
Applied a total of 8412 rules in 2545 ms. Remains 2501 /6709 variables (removed 4208) and now considering 2100/6009 (removed 3909) transitions.
// Phase 1: matrix 2100 rows 2501 cols
[2023-03-20 03:14:31] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-20 03:14:33] [INFO ] Implicit Places using invariants in 2724 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2739 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6709 places, 2100/6009 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 180 ms. Remains 2497 /2499 variables (removed 2) and now considering 2098/2100 (removed 2) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-20 03:14:34] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-20 03:14:35] [INFO ] Implicit Places using invariants in 1500 ms returned []
[2023-03-20 03:14:35] [INFO ] Invariant cache hit.
[2023-03-20 03:14:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 03:14:40] [INFO ] Implicit Places using invariants and state equation in 5334 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 : 2497/6709 places, 2098/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12303 ms. Remains : 2497/6709 places, 2098/6009 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-10 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 s115 1) (EQ s150 1) (EQ s751 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 1540 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-10 finished in 13973 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 1 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Reduce places removed 1 places and 1 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 6708 transition count 4608
Reduce places removed 1400 places and 0 transitions.
Iterating post reduction 1 with 1400 rules applied. Total rules applied 2800 place count 5308 transition count 4608
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 795 Pre rules applied. Total rules applied 2800 place count 5308 transition count 3813
Deduced a syphon composed of 795 places in 12 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 2 with 1590 rules applied. Total rules applied 4390 place count 4513 transition count 3813
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 4396 place count 4507 transition count 3807
Iterating global reduction 2 with 6 rules applied. Total rules applied 4402 place count 4507 transition count 3807
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4402 place count 4507 transition count 3802
Deduced a syphon composed of 5 places in 12 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 4412 place count 4502 transition count 3802
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 6 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7810 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7811 place count 2803 transition count 2102
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 7813 place count 2802 transition count 2101
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 8015 place count 2701 transition count 2101
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 3 with 202 rules applied. Total rules applied 8217 place count 2600 transition count 2101
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8409 place count 2504 transition count 2101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8411 place count 2502 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8412 place count 2501 transition count 2099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8412 place count 2501 transition count 2097
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 8416 place count 2499 transition count 2097
Applied a total of 8416 rules in 2446 ms. Remains 2499 /6709 variables (removed 4210) and now considering 2097/6009 (removed 3912) transitions.
// Phase 1: matrix 2097 rows 2499 cols
[2023-03-20 03:14:45] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-20 03:14:47] [INFO ] Implicit Places using invariants in 2619 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2624 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/6709 places, 2097/6009 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 2095
Applied a total of 4 rules in 209 ms. Remains 2495 /2497 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-20 03:14:47] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-20 03:14:50] [INFO ] Implicit Places using invariants in 2503 ms returned []
[2023-03-20 03:14:50] [INFO ] Invariant cache hit.
[2023-03-20 03:14:54] [INFO ] Implicit Places using invariants and state equation in 4308 ms returned []
Implicit Place search using SMT with State Equation took 6817 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2495/6709 places, 2095/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12096 ms. Remains : 2495/6709 places, 2095/6009 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s203 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 1455 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-11 finished in 13734 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&&X(F((p1 U (p2||G(p1))))))||G(F((p1 U (p2||G(p1))))))))'
Support contains 3 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 6703 transition count 6003
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 6703 transition count 6003
Applied a total of 12 rules in 2402 ms. Remains 6703 /6709 variables (removed 6) and now considering 6003/6009 (removed 6) transitions.
// Phase 1: matrix 6003 rows 6703 cols
[2023-03-20 03:14:58] [INFO ] Computed 1101 place invariants in 20 ms
[2023-03-20 03:15:01] [INFO ] Implicit Places using invariants in 3071 ms returned []
[2023-03-20 03:15:01] [INFO ] Invariant cache hit.
[2023-03-20 03:15:05] [INFO ] Implicit Places using invariants and state equation in 3523 ms returned []
Implicit Place search using SMT with State Equation took 6609 ms to find 0 implicit places.
[2023-03-20 03:15:05] [INFO ] Invariant cache hit.
[2023-03-20 03:15:11] [INFO ] Dead Transitions using invariants and state equation in 5920 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6703/6709 places, 6003/6009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14938 ms. Remains : 6703/6709 places, 6003/6009 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s2069 1), p2:(AND (NEQ s1239 1) (NEQ s1027 1)), p1:(NEQ s1027 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3644 ms.
Product exploration explored 100000 steps with 50000 reset in 3608 ms.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Detected a total of 1599/6703 stabilizing places and 1599/6003 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (OR (AND (NOT p2) (NOT p1)) p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p0)), (X (X (OR (AND (NOT p2) (NOT p1)) p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p2 p1)
Knowledge based reduction with 10 factoid took 454 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100B-LTLFireability-12 finished in 23028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F(p1)))))'
Support contains 2 out of 6709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6709/6709 places, 6009/6009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 6702 transition count 6002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 6702 transition count 6002
Applied a total of 14 rules in 2522 ms. Remains 6702 /6709 variables (removed 7) and now considering 6002/6009 (removed 7) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2023-03-20 03:15:21] [INFO ] Computed 1101 place invariants in 60 ms
[2023-03-20 03:15:25] [INFO ] Implicit Places using invariants in 3810 ms returned []
[2023-03-20 03:15:25] [INFO ] Invariant cache hit.
[2023-03-20 03:15:28] [INFO ] Implicit Places using invariants and state equation in 2852 ms returned []
Implicit Place search using SMT with State Equation took 6675 ms to find 0 implicit places.
[2023-03-20 03:15:28] [INFO ] Invariant cache hit.
[2023-03-20 03:15:36] [INFO ] Dead Transitions using invariants and state equation in 8289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6702/6709 places, 6002/6009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17489 ms. Remains : 6702/6709 places, 6002/6009 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s404 1), p0:(EQ s5501 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1731 ms.
Product exploration explored 100000 steps with 0 reset in 2172 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 (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 139924 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139924 steps, saw 137946 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 03:15:45] [INFO ] Invariant cache hit.
[2023-03-20 03:15:47] [INFO ] [Real]Absence check using 1101 positive place invariants in 1434 ms returned sat
[2023-03-20 03:15:47] [INFO ] After 2691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 03:15:49] [INFO ] [Nat]Absence check using 1101 positive place invariants in 841 ms returned sat
[2023-03-20 03:15:58] [INFO ] After 8759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 03:16:02] [INFO ] Deduced a trap composed of 24 places in 2840 ms of which 6 ms to minimize.
[2023-03-20 03:16:05] [INFO ] Deduced a trap composed of 22 places in 2832 ms of which 4 ms to minimize.
[2023-03-20 03:16:08] [INFO ] Deduced a trap composed of 25 places in 2929 ms of which 3 ms to minimize.
[2023-03-20 03:16:11] [INFO ] Deduced a trap composed of 21 places in 3140 ms of which 3 ms to minimize.
[2023-03-20 03:16:14] [INFO ] Deduced a trap composed of 24 places in 2586 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 03:16:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 03:16:14] [INFO ] After 26690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 756 ms.
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6702/6702 places, 6002/6002 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 6702 transition count 4604
Reduce places removed 1398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2797 place count 5304 transition count 4603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2798 place count 5303 transition count 4603
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2798 place count 5303 transition count 3804
Deduced a syphon composed of 799 places in 14 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 4396 place count 4504 transition count 3804
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 5 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 3 with 3402 rules applied. Total rules applied 7798 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7799 place count 2803 transition count 2102
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 7801 place count 2802 transition count 2101
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 8003 place count 2701 transition count 2101
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 8205 place count 2600 transition count 2101
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8397 place count 2504 transition count 2101
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 4 with 299 rules applied. Total rules applied 8696 place count 2504 transition count 2101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8697 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 8698 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 8698 place count 2502 transition count 2098
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8702 place count 2500 transition count 2098
Applied a total of 8702 rules in 2068 ms. Remains 2500 /6702 variables (removed 4202) and now considering 2098/6002 (removed 3904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2068 ms. Remains : 2500/6702 places, 2098/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 90397 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 90397 steps, saw 71352 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 2098 rows 2500 cols
[2023-03-20 03:16:20] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-20 03:16:21] [INFO ] [Real]Absence check using 1100 positive place invariants in 237 ms returned sat
[2023-03-20 03:16:22] [INFO ] After 1983ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:16:23] [INFO ] [Nat]Absence check using 1100 positive place invariants in 228 ms returned sat
[2023-03-20 03:16:24] [INFO ] After 1224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:16:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 03:16:24] [INFO ] After 93ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:16:25] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2023-03-20 03:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2023-03-20 03:16:25] [INFO ] After 644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-20 03:16:25] [INFO ] After 2653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 63 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2098/2098 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2499 transition count 2097
Applied a total of 2 rules in 182 ms. Remains 2499 /2500 variables (removed 1) and now considering 2097/2098 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 2499/2500 places, 2097/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 82727 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82727 steps, saw 55555 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2499 cols
[2023-03-20 03:16:29] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-20 03:16:29] [INFO ] [Real]Absence check using 1100 positive place invariants in 261 ms returned sat
[2023-03-20 03:16:31] [INFO ] After 2517ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:16:32] [INFO ] [Nat]Absence check using 1100 positive place invariants in 250 ms returned sat
[2023-03-20 03:16:34] [INFO ] After 1876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:16:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 03:16:34] [INFO ] After 97ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:16:34] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-20 03:16:34] [INFO ] After 2956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2097/2097 transitions.
Applied a total of 0 rules in 96 ms. Remains 2499 /2499 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 2499/2499 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2097/2097 transitions.
Applied a total of 0 rules in 86 ms. Remains 2499 /2499 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-20 03:16:34] [INFO ] Invariant cache hit.
[2023-03-20 03:16:37] [INFO ] Implicit Places using invariants in 2262 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2275 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2497/2499 places, 2097/2097 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2495 transition count 2095
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2495 transition count 2095
Applied a total of 4 rules in 181 ms. Remains 2495 /2497 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-20 03:16:37] [INFO ] Computed 1098 place invariants in 21 ms
[2023-03-20 03:16:40] [INFO ] Implicit Places using invariants in 2768 ms returned []
[2023-03-20 03:16:40] [INFO ] Invariant cache hit.
[2023-03-20 03:16:44] [INFO ] Implicit Places using invariants and state equation in 4544 ms returned []
Implicit Place search using SMT with State Equation took 7315 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2495/2499 places, 2095/2097 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9857 ms. Remains : 2495/2499 places, 2095/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 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 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81804 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81804 steps, saw 56069 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:16:47] [INFO ] Invariant cache hit.
[2023-03-20 03:16:48] [INFO ] [Real]Absence check using 1098 positive place invariants in 406 ms returned sat
[2023-03-20 03:16:50] [INFO ] After 2591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:16:51] [INFO ] [Nat]Absence check using 1098 positive place invariants in 408 ms returned sat
[2023-03-20 03:16:52] [INFO ] After 1681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:16:53] [INFO ] After 1818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-20 03:16:53] [INFO ] After 2689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 96 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 91 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2023-03-20 03:16:53] [INFO ] Invariant cache hit.
[2023-03-20 03:16:56] [INFO ] Implicit Places using invariants in 3100 ms returned []
[2023-03-20 03:16:56] [INFO ] Invariant cache hit.
[2023-03-20 03:17:01] [INFO ] Implicit Places using invariants and state equation in 5358 ms returned []
Implicit Place search using SMT with State Equation took 8475 ms to find 0 implicit places.
[2023-03-20 03:17:01] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-20 03:17:01] [INFO ] Invariant cache hit.
[2023-03-20 03:17:04] [INFO ] Dead Transitions using invariants and state equation in 2746 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11365 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2495 transition count 2095
Applied a total of 594 rules in 305 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-20 03:17:04] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-20 03:17:06] [INFO ] [Real]Absence check using 1098 positive place invariants in 639 ms returned sat
[2023-03-20 03:17:07] [INFO ] After 2884ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:17:08] [INFO ] [Nat]Absence check using 1098 positive place invariants in 468 ms returned sat
[2023-03-20 03:17:11] [INFO ] After 2477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:17:11] [INFO ] State equation strengthened by 592 read => feed constraints.
[2023-03-20 03:17:11] [INFO ] After 350ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:17:11] [INFO ] After 574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-20 03:17:12] [INFO ] After 4191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 371 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6702/6702 places, 6002/6002 transitions.
Applied a total of 0 rules in 1109 ms. Remains 6702 /6702 variables (removed 0) and now considering 6002/6002 (removed 0) transitions.
// Phase 1: matrix 6002 rows 6702 cols
[2023-03-20 03:17:14] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-20 03:17:16] [INFO ] Implicit Places using invariants in 2650 ms returned []
[2023-03-20 03:17:16] [INFO ] Invariant cache hit.
[2023-03-20 03:17:23] [INFO ] Implicit Places using invariants and state equation in 6275 ms returned []
Implicit Place search using SMT with State Equation took 8932 ms to find 0 implicit places.
[2023-03-20 03:17:23] [INFO ] Invariant cache hit.
[2023-03-20 03:17:32] [INFO ] Dead Transitions using invariants and state equation in 9585 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19639 ms. Remains : 6702/6702 places, 6002/6002 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 (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 109594 steps, run timeout after 3003 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109594 steps, saw 107955 distinct states, run finished after 3004 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 03:17:36] [INFO ] Invariant cache hit.
[2023-03-20 03:17:38] [INFO ] [Real]Absence check using 1101 positive place invariants in 681 ms returned sat
[2023-03-20 03:17:38] [INFO ] After 1917ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 03:17:41] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1402 ms returned sat
[2023-03-20 03:17:50] [INFO ] After 9293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 03:17:53] [INFO ] Deduced a trap composed of 24 places in 2710 ms of which 3 ms to minimize.
[2023-03-20 03:17:57] [INFO ] Deduced a trap composed of 22 places in 3574 ms of which 4 ms to minimize.
[2023-03-20 03:18:00] [INFO ] Deduced a trap composed of 25 places in 2592 ms of which 6 ms to minimize.
[2023-03-20 03:18:03] [INFO ] Deduced a trap composed of 21 places in 2561 ms of which 4 ms to minimize.
[2023-03-20 03:18:06] [INFO ] Deduced a trap composed of 24 places in 2677 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 03:18:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 03:18:06] [INFO ] After 27590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 673 ms.
Support contains 2 out of 6702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6702/6702 places, 6002/6002 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 6702 transition count 4604
Reduce places removed 1398 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2797 place count 5304 transition count 4603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2798 place count 5303 transition count 4603
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2798 place count 5303 transition count 3804
Deduced a syphon composed of 799 places in 13 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 4396 place count 4504 transition count 3804
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 6 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 3 with 3402 rules applied. Total rules applied 7798 place count 2803 transition count 2103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7799 place count 2803 transition count 2102
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 7801 place count 2802 transition count 2101
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 8003 place count 2701 transition count 2101
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 8205 place count 2600 transition count 2101
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8397 place count 2504 transition count 2101
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 4 with 299 rules applied. Total rules applied 8696 place count 2504 transition count 2101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8697 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 8698 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 8698 place count 2502 transition count 2098
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8702 place count 2500 transition count 2098
Applied a total of 8702 rules in 1982 ms. Remains 2500 /6702 variables (removed 4202) and now considering 2098/6002 (removed 3904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1982 ms. Remains : 2500/6702 places, 2098/6002 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 87103 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 87103 steps, saw 68264 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 2098 rows 2500 cols
[2023-03-20 03:18:12] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-20 03:18:13] [INFO ] [Real]Absence check using 1100 positive place invariants in 284 ms returned sat
[2023-03-20 03:18:14] [INFO ] After 1934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:18:15] [INFO ] [Nat]Absence check using 1100 positive place invariants in 226 ms returned sat
[2023-03-20 03:18:16] [INFO ] After 1303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:18:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 03:18:16] [INFO ] After 101ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:18:16] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2023-03-20 03:18:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 439 ms
[2023-03-20 03:18:17] [INFO ] After 621ms 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-20 03:18:17] [INFO ] After 2690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 64 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2098/2098 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2499 transition count 2097
Applied a total of 2 rules in 191 ms. Remains 2499 /2500 variables (removed 1) and now considering 2097/2098 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 2499/2500 places, 2097/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 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 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 81174 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81174 steps, saw 54437 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2499 cols
[2023-03-20 03:18:20] [INFO ] Computed 1100 place invariants in 8 ms
[2023-03-20 03:18:21] [INFO ] [Real]Absence check using 1100 positive place invariants in 242 ms returned sat
[2023-03-20 03:18:22] [INFO ] After 1975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:18:23] [INFO ] [Nat]Absence check using 1100 positive place invariants in 233 ms returned sat
[2023-03-20 03:18:24] [INFO ] After 1299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:18:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 03:18:24] [INFO ] After 98ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:18:24] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-20 03:18:25] [INFO ] After 2361ms 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 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2097/2097 transitions.
Applied a total of 0 rules in 105 ms. Remains 2499 /2499 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 2499/2499 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2097/2097 transitions.
Applied a total of 0 rules in 93 ms. Remains 2499 /2499 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2023-03-20 03:18:25] [INFO ] Invariant cache hit.
[2023-03-20 03:18:27] [INFO ] Implicit Places using invariants in 2571 ms returned [2482, 2486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2576 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2497/2499 places, 2097/2097 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2495 transition count 2095
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2495 transition count 2095
Applied a total of 4 rules in 224 ms. Remains 2495 /2497 variables (removed 2) and now considering 2095/2097 (removed 2) transitions.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-20 03:18:28] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-20 03:18:30] [INFO ] Implicit Places using invariants in 2578 ms returned []
[2023-03-20 03:18:30] [INFO ] Invariant cache hit.
[2023-03-20 03:18:35] [INFO ] Implicit Places using invariants and state equation in 4445 ms returned []
Implicit Place search using SMT with State Equation took 7026 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2495/2499 places, 2095/2097 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9919 ms. Remains : 2495/2499 places, 2095/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 82238 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82238 steps, saw 56408 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 03:18:38] [INFO ] Invariant cache hit.
[2023-03-20 03:18:39] [INFO ] [Real]Absence check using 1098 positive place invariants in 226 ms returned sat
[2023-03-20 03:18:40] [INFO ] After 1889ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:18:40] [INFO ] [Nat]Absence check using 1098 positive place invariants in 229 ms returned sat
[2023-03-20 03:18:42] [INFO ] After 1247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:18:42] [INFO ] After 1455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-20 03:18:42] [INFO ] After 2229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 97 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 2095/2095 transitions.
Applied a total of 0 rules in 92 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
[2023-03-20 03:18:42] [INFO ] Invariant cache hit.
[2023-03-20 03:18:45] [INFO ] Implicit Places using invariants in 2552 ms returned []
[2023-03-20 03:18:45] [INFO ] Invariant cache hit.
[2023-03-20 03:18:49] [INFO ] Implicit Places using invariants and state equation in 4348 ms returned []
Implicit Place search using SMT with State Equation took 6902 ms to find 0 implicit places.
[2023-03-20 03:18:49] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-20 03:18:49] [INFO ] Invariant cache hit.
[2023-03-20 03:18:51] [INFO ] Dead Transitions using invariants and state equation in 2144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9207 ms. Remains : 2495/2495 places, 2095/2095 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2495 transition count 2095
Applied a total of 594 rules in 226 ms. Remains 2495 /2495 variables (removed 0) and now considering 2095/2095 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2495 cols
[2023-03-20 03:18:52] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:18:52] [INFO ] [Real]Absence check using 1098 positive place invariants in 228 ms returned sat
[2023-03-20 03:18:54] [INFO ] After 1928ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 03:18:54] [INFO ] [Nat]Absence check using 1098 positive place invariants in 279 ms returned sat
[2023-03-20 03:18:56] [INFO ] After 1294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 03:18:56] [INFO ] State equation strengthened by 592 read => feed constraints.
[2023-03-20 03:18:56] [INFO ] After 279ms SMT Verify possible using 592 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 03:18:56] [INFO ] After 474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-20 03:18:56] [INFO ] After 2701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1747 ms.
Stack based approach found an accepted trace after 36333 steps with 0 reset with depth 36334 and stack size 36108 in 676 ms.
FORMULA ShieldPPPt-PT-100B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLFireability-13 finished in 220889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 6709 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6709/6709 places, 6009/6009 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 6708 transition count 4609
Reduce places removed 1399 places and 0 transitions.
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2798 place count 5309 transition count 4609
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 5309 transition count 3812
Deduced a syphon composed of 797 places in 12 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 2 with 1594 rules applied. Total rules applied 4392 place count 4512 transition count 3812
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 4398 place count 4506 transition count 3806
Iterating global reduction 2 with 6 rules applied. Total rules applied 4404 place count 4506 transition count 3806
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4404 place count 4506 transition count 3801
Deduced a syphon composed of 5 places in 13 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 4414 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 5 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 2 with 3390 rules applied. Total rules applied 7804 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 7805 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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7807 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 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8009 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 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8211 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 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8405 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 8407 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 8408 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 8408 place count 2503 transition count 2100
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 8412 place count 2501 transition count 2100
Applied a total of 8412 rules in 2562 ms. Remains 2501 /6709 variables (removed 4208) and now considering 2100/6009 (removed 3909) transitions.
// Phase 1: matrix 2100 rows 2501 cols
[2023-03-20 03:19:02] [INFO ] Computed 1100 place invariants in 7 ms
[2023-03-20 03:19:05] [INFO ] Implicit Places using invariants in 3095 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3101 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6709 places, 2100/6009 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 198 ms. Remains 2497 /2499 variables (removed 2) and now considering 2098/2100 (removed 2) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-20 03:19:06] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-20 03:19:08] [INFO ] Implicit Places using invariants in 2555 ms returned []
[2023-03-20 03:19:08] [INFO ] Invariant cache hit.
[2023-03-20 03:19:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 03:19:13] [INFO ] Implicit Places using invariants and state equation in 4493 ms returned []
Implicit Place search using SMT with State Equation took 7075 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6709 places, 2098/6009 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12936 ms. Remains : 2497/6709 places, 2098/6009 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s728 1), p1:(AND (EQ s1067 1) (EQ s1102 1))], nbAcceptance=2, 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 1475 ms.
Product exploration explored 100000 steps with 0 reset in 1942 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/2497 stabilizing places and 3/2098 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 492 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 03:19:17] [INFO ] Invariant cache hit.
[2023-03-20 03:19:18] [INFO ] [Real]Absence check using 1098 positive place invariants in 374 ms returned sat
[2023-03-20 03:19:22] [INFO ] After 4314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:19:23] [INFO ] [Nat]Absence check using 1098 positive place invariants in 498 ms returned sat
[2023-03-20 03:19:26] [INFO ] After 3245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:19:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 03:19:26] [INFO ] After 125ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 03:19:27] [INFO ] After 445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-20 03:19:27] [INFO ] After 4992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 104 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 2497 transition count 2098
Applied a total of 5 rules in 221 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 84648 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84648 steps, saw 61541 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-20 03:19:31] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:19:31] [INFO ] [Real]Absence check using 1098 positive place invariants in 240 ms returned sat
[2023-03-20 03:19:33] [INFO ] After 2023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:19:34] [INFO ] [Nat]Absence check using 1098 positive place invariants in 266 ms returned sat
[2023-03-20 03:19:35] [INFO ] After 1269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:19:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 03:19:35] [INFO ] After 221ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 03:19:35] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2023-03-20 03:19:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2023-03-20 03:19:36] [INFO ] After 820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-20 03:19:36] [INFO ] After 3206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 123 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 94 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 95 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
[2023-03-20 03:19:36] [INFO ] Invariant cache hit.
[2023-03-20 03:19:39] [INFO ] Implicit Places using invariants in 2850 ms returned []
[2023-03-20 03:19:39] [INFO ] Invariant cache hit.
[2023-03-20 03:19:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 03:19:46] [INFO ] Implicit Places using invariants and state equation in 6513 ms returned []
Implicit Place search using SMT with State Equation took 9366 ms to find 0 implicit places.
[2023-03-20 03:19:46] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-20 03:19:46] [INFO ] Invariant cache hit.
[2023-03-20 03:19:49] [INFO ] Dead Transitions using invariants and state equation in 2936 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12463 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 2497 transition count 2098
Applied a total of 598 rules in 223 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-20 03:19:49] [INFO ] Computed 1098 place invariants in 3 ms
[2023-03-20 03:19:50] [INFO ] [Real]Absence check using 1098 positive place invariants in 451 ms returned sat
[2023-03-20 03:19:52] [INFO ] After 3284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:19:53] [INFO ] [Nat]Absence check using 1098 positive place invariants in 682 ms returned sat
[2023-03-20 03:19:55] [INFO ] After 1748ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:19:55] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-20 03:19:56] [INFO ] After 247ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 03:19:56] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2023-03-20 03:19:56] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2023-03-20 03:19:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 455 ms
[2023-03-20 03:19:56] [INFO ] After 967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 311 ms.
[2023-03-20 03:19:57] [INFO ] After 4334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 684 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 46 ms :[(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 88 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-20 03:19:58] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-20 03:20:00] [INFO ] Implicit Places using invariants in 2310 ms returned []
[2023-03-20 03:20:00] [INFO ] Invariant cache hit.
[2023-03-20 03:20:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 03:20:06] [INFO ] Implicit Places using invariants and state equation in 6576 ms returned []
Implicit Place search using SMT with State Equation took 8888 ms to find 0 implicit places.
[2023-03-20 03:20:06] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-20 03:20:06] [INFO ] Invariant cache hit.
[2023-03-20 03:20:09] [INFO ] Dead Transitions using invariants and state equation in 2305 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11355 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/2497 stabilizing places and 3/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 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 529 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 03:20:10] [INFO ] Invariant cache hit.
[2023-03-20 03:20:11] [INFO ] [Real]Absence check using 1098 positive place invariants in 489 ms returned sat
[2023-03-20 03:20:13] [INFO ] After 3230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:20:14] [INFO ] [Nat]Absence check using 1098 positive place invariants in 380 ms returned sat
[2023-03-20 03:20:17] [INFO ] After 2211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:20:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 03:20:17] [INFO ] After 211ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 03:20:17] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 276 ms.
[2023-03-20 03:20:18] [INFO ] After 4319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 175 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 2497 transition count 2098
Applied a total of 5 rules in 168 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 78178 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78178 steps, saw 56990 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-20 03:20:21] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:20:22] [INFO ] [Real]Absence check using 1098 positive place invariants in 451 ms returned sat
[2023-03-20 03:20:24] [INFO ] After 2365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:20:24] [INFO ] [Nat]Absence check using 1098 positive place invariants in 286 ms returned sat
[2023-03-20 03:20:26] [INFO ] After 1521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:20:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 03:20:26] [INFO ] After 225ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 03:20:27] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2023-03-20 03:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-20 03:20:27] [INFO ] After 872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 253 ms.
[2023-03-20 03:20:27] [INFO ] After 3420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 151 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 96 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2497/2497 places, 2098/2098 transitions.
Applied a total of 0 rules in 98 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
[2023-03-20 03:20:28] [INFO ] Invariant cache hit.
[2023-03-20 03:20:30] [INFO ] Implicit Places using invariants in 2518 ms returned []
[2023-03-20 03:20:30] [INFO ] Invariant cache hit.
[2023-03-20 03:20:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 03:20:37] [INFO ] Implicit Places using invariants and state equation in 6880 ms returned []
Implicit Place search using SMT with State Equation took 9415 ms to find 0 implicit places.
[2023-03-20 03:20:37] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-20 03:20:37] [INFO ] Invariant cache hit.
[2023-03-20 03:20:40] [INFO ] Dead Transitions using invariants and state equation in 2643 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12289 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 2497 transition count 2098
Applied a total of 598 rules in 264 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-20 03:20:40] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:20:41] [INFO ] [Real]Absence check using 1098 positive place invariants in 566 ms returned sat
[2023-03-20 03:20:44] [INFO ] After 3866ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 03:20:45] [INFO ] [Nat]Absence check using 1098 positive place invariants in 326 ms returned sat
[2023-03-20 03:20:48] [INFO ] After 2925ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 03:20:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-20 03:20:48] [INFO ] After 239ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 03:20:48] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2023-03-20 03:20:48] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2023-03-20 03:20:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2023-03-20 03:20:49] [INFO ] After 945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-20 03:20:49] [INFO ] After 4991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 711 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1532 ms.
Product exploration explored 100000 steps with 0 reset in 1962 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 102 ms. Remains 2497 /2497 variables (removed 0) and now considering 2098/2098 (removed 0) transitions.
// Phase 1: matrix 2098 rows 2497 cols
[2023-03-20 03:20:53] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-20 03:20:56] [INFO ] Implicit Places using invariants in 2998 ms returned []
[2023-03-20 03:20:56] [INFO ] Invariant cache hit.
[2023-03-20 03:20:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 03:21:02] [INFO ] Implicit Places using invariants and state equation in 5851 ms returned []
Implicit Place search using SMT with State Equation took 8877 ms to find 0 implicit places.
[2023-03-20 03:21:02] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-20 03:21:02] [INFO ] Invariant cache hit.
[2023-03-20 03:21:04] [INFO ] Dead Transitions using invariants and state equation in 1984 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11016 ms. Remains : 2497/2497 places, 2098/2098 transitions.
Treatment of property ShieldPPPt-PT-100B-LTLFireability-14 finished in 124830 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(F((p1 U (p2||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(p0)||(p1&&X(p2))) U X(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' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2023-03-20 03:21:05] [INFO ] Flatten gal took : 210 ms
[2023-03-20 03:21:05] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 03:21:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6709 places, 6009 transitions and 15618 arcs took 59 ms.
Total runtime 978680 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-100B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLFireability

FORMULA ShieldPPPt-PT-100B-LTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679282549325

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldPPPt-PT-100B-LTLFireability-01
lola: time limit : 897 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-03: LTL 0 0 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 3/897 4/32 ShieldPPPt-PT-100B-LTLFireability-01 105746 m, 21149 m/sec, 150817 t fired, .

Time elapsed: 13 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 8/897 15/32 ShieldPPPt-PT-100B-LTLFireability-01 390445 m, 56939 m/sec, 566864 t fired, .

Time elapsed: 18 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 13/897 24/32 ShieldPPPt-PT-100B-LTLFireability-01 646779 m, 51266 m/sec, 938613 t fired, .

Time elapsed: 23 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 18/897 31/32 ShieldPPPt-PT-100B-LTLFireability-01 858913 m, 42426 m/sec, 1246330 t fired, .

Time elapsed: 28 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for ShieldPPPt-PT-100B-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 33 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldPPPt-PT-100B-LTLFireability-03
lola: time limit : 1189 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ShieldPPPt-PT-100B-LTLFireability-03
lola: result : false
lola: markings : 235
lola: fired transitions : 235
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldPPPt-PT-100B-LTLFireability-09
lola: time limit : 1783 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1783 5/32 ShieldPPPt-PT-100B-LTLFireability-09 213225 m, 42645 m/sec, 256404 t fired, .

Time elapsed: 38 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1783 13/32 ShieldPPPt-PT-100B-LTLFireability-09 473295 m, 52014 m/sec, 612832 t fired, .

Time elapsed: 43 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1783 20/32 ShieldPPPt-PT-100B-LTLFireability-09 740703 m, 53481 m/sec, 981045 t fired, .

Time elapsed: 48 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1783 27/32 ShieldPPPt-PT-100B-LTLFireability-09 980420 m, 47943 m/sec, 1334647 t fired, .

Time elapsed: 53 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for ShieldPPPt-PT-100B-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 58 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 10 (type EXCL) for 9 ShieldPPPt-PT-100B-LTLFireability-14
lola: time limit : 3542 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/3542 5/32 ShieldPPPt-PT-100B-LTLFireability-14 216673 m, 43334 m/sec, 253896 t fired, .

Time elapsed: 63 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/3542 12/32 ShieldPPPt-PT-100B-LTLFireability-14 456704 m, 48006 m/sec, 583026 t fired, .

Time elapsed: 68 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/3542 19/32 ShieldPPPt-PT-100B-LTLFireability-14 704333 m, 49525 m/sec, 919529 t fired, .

Time elapsed: 73 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/3542 27/32 ShieldPPPt-PT-100B-LTLFireability-14 961288 m, 51391 m/sec, 1276179 t fired, .

Time elapsed: 78 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for ShieldPPPt-PT-100B-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-100B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
ShieldPPPt-PT-100B-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 83 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-100B-LTLFireability-01: LTL unknown AGGR
ShieldPPPt-PT-100B-LTLFireability-03: LTL false LTL model checker
ShieldPPPt-PT-100B-LTLFireability-09: LTL unknown AGGR
ShieldPPPt-PT-100B-LTLFireability-14: LTL unknown AGGR


Time elapsed: 83 secs. Pages in use: 32

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="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldPPPt-PT-100B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715600700"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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