Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 25 22:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 22:52 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:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 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 614K 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 ShieldRVt-PT-050B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679310315053

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 11:05:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 11:05:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:05:17] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2023-03-20 11:05:17] [INFO ] Transformed 2503 places.
[2023-03-20 11:05:17] [INFO ] Transformed 2503 transitions.
[2023-03-20 11:05:17] [INFO ] Found NUPN structural information;
[2023-03-20 11:05:17] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 455 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVt-PT-050B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Discarding 533 places :
Symmetric choice reduction at 0 with 533 rule applications. Total rules 533 place count 1970 transition count 1970
Iterating global reduction 0 with 533 rules applied. Total rules applied 1066 place count 1970 transition count 1970
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1067 place count 1969 transition count 1969
Iterating global reduction 0 with 1 rules applied. Total rules applied 1068 place count 1969 transition count 1969
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1069 place count 1968 transition count 1968
Iterating global reduction 0 with 1 rules applied. Total rules applied 1070 place count 1968 transition count 1968
Applied a total of 1070 rules in 1661 ms. Remains 1968 /2503 variables (removed 535) and now considering 1968/2503 (removed 535) transitions.
// Phase 1: matrix 1968 rows 1968 cols
[2023-03-20 11:05:20] [INFO ] Computed 201 place invariants in 58 ms
[2023-03-20 11:05:21] [INFO ] Implicit Places using invariants in 1163 ms returned []
[2023-03-20 11:05:21] [INFO ] Invariant cache hit.
[2023-03-20 11:05:24] [INFO ] Implicit Places using invariants and state equation in 3096 ms returned []
Implicit Place search using SMT with State Equation took 4319 ms to find 0 implicit places.
[2023-03-20 11:05:24] [INFO ] Invariant cache hit.
[2023-03-20 11:05:26] [INFO ] Dead Transitions using invariants and state equation in 1890 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1968/2503 places, 1968/2503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7874 ms. Remains : 1968/2503 places, 1968/2503 transitions.
Support contains 36 out of 1968 places after structural reductions.
[2023-03-20 11:05:26] [INFO ] Flatten gal took : 253 ms
[2023-03-20 11:05:26] [INFO ] Flatten gal took : 153 ms
[2023-03-20 11:05:27] [INFO ] Input system was already deterministic with 1968 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 790 ms. (steps per millisecond=12 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-20 11:05:28] [INFO ] Invariant cache hit.
[2023-03-20 11:05:29] [INFO ] After 761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 11:05:30] [INFO ] [Nat]Absence check using 201 positive place invariants in 125 ms returned sat
[2023-03-20 11:05:32] [INFO ] After 2014ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 11:05:33] [INFO ] Deduced a trap composed of 60 places in 535 ms of which 4 ms to minimize.
[2023-03-20 11:05:33] [INFO ] Deduced a trap composed of 44 places in 553 ms of which 2 ms to minimize.
[2023-03-20 11:05:34] [INFO ] Deduced a trap composed of 38 places in 560 ms of which 2 ms to minimize.
[2023-03-20 11:05:35] [INFO ] Deduced a trap composed of 66 places in 388 ms of which 2 ms to minimize.
[2023-03-20 11:05:35] [INFO ] Deduced a trap composed of 33 places in 451 ms of which 2 ms to minimize.
[2023-03-20 11:05:36] [INFO ] Deduced a trap composed of 28 places in 418 ms of which 1 ms to minimize.
[2023-03-20 11:05:36] [INFO ] Deduced a trap composed of 27 places in 429 ms of which 2 ms to minimize.
[2023-03-20 11:05:37] [INFO ] Deduced a trap composed of 59 places in 507 ms of which 1 ms to minimize.
[2023-03-20 11:05:37] [INFO ] Deduced a trap composed of 56 places in 336 ms of which 1 ms to minimize.
[2023-03-20 11:05:38] [INFO ] Deduced a trap composed of 65 places in 368 ms of which 1 ms to minimize.
[2023-03-20 11:05:38] [INFO ] Deduced a trap composed of 62 places in 370 ms of which 1 ms to minimize.
[2023-03-20 11:05:39] [INFO ] Deduced a trap composed of 66 places in 337 ms of which 1 ms to minimize.
[2023-03-20 11:05:39] [INFO ] Deduced a trap composed of 58 places in 373 ms of which 1 ms to minimize.
[2023-03-20 11:05:39] [INFO ] Deduced a trap composed of 67 places in 311 ms of which 0 ms to minimize.
[2023-03-20 11:05:40] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7378 ms
[2023-03-20 11:05:40] [INFO ] Deduced a trap composed of 50 places in 321 ms of which 1 ms to minimize.
[2023-03-20 11:05:40] [INFO ] Deduced a trap composed of 49 places in 328 ms of which 1 ms to minimize.
[2023-03-20 11:05:41] [INFO ] Deduced a trap composed of 56 places in 344 ms of which 2 ms to minimize.
[2023-03-20 11:05:41] [INFO ] Deduced a trap composed of 55 places in 353 ms of which 1 ms to minimize.
[2023-03-20 11:05:42] [INFO ] Deduced a trap composed of 45 places in 279 ms of which 1 ms to minimize.
[2023-03-20 11:05:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2238 ms
[2023-03-20 11:05:42] [INFO ] Deduced a trap composed of 45 places in 424 ms of which 1 ms to minimize.
[2023-03-20 11:05:43] [INFO ] Deduced a trap composed of 41 places in 378 ms of which 1 ms to minimize.
[2023-03-20 11:05:43] [INFO ] Deduced a trap composed of 44 places in 412 ms of which 1 ms to minimize.
[2023-03-20 11:05:44] [INFO ] Deduced a trap composed of 68 places in 434 ms of which 0 ms to minimize.
[2023-03-20 11:05:44] [INFO ] Deduced a trap composed of 40 places in 324 ms of which 1 ms to minimize.
[2023-03-20 11:05:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2487 ms
[2023-03-20 11:05:45] [INFO ] Deduced a trap composed of 54 places in 451 ms of which 1 ms to minimize.
[2023-03-20 11:05:46] [INFO ] Deduced a trap composed of 53 places in 448 ms of which 1 ms to minimize.
[2023-03-20 11:05:46] [INFO ] Deduced a trap composed of 55 places in 336 ms of which 1 ms to minimize.
[2023-03-20 11:05:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1587 ms
[2023-03-20 11:05:47] [INFO ] Deduced a trap composed of 36 places in 331 ms of which 1 ms to minimize.
[2023-03-20 11:05:47] [INFO ] Deduced a trap composed of 36 places in 349 ms of which 1 ms to minimize.
[2023-03-20 11:05:48] [INFO ] Deduced a trap composed of 35 places in 366 ms of which 1 ms to minimize.
[2023-03-20 11:05:48] [INFO ] Deduced a trap composed of 39 places in 318 ms of which 1 ms to minimize.
[2023-03-20 11:05:49] [INFO ] Deduced a trap composed of 44 places in 311 ms of which 1 ms to minimize.
[2023-03-20 11:05:49] [INFO ] Deduced a trap composed of 35 places in 343 ms of which 1 ms to minimize.
[2023-03-20 11:05:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2556 ms
[2023-03-20 11:05:50] [INFO ] Deduced a trap composed of 41 places in 348 ms of which 5 ms to minimize.
[2023-03-20 11:05:50] [INFO ] Deduced a trap composed of 30 places in 341 ms of which 1 ms to minimize.
[2023-03-20 11:05:51] [INFO ] Deduced a trap composed of 34 places in 338 ms of which 0 ms to minimize.
[2023-03-20 11:05:51] [INFO ] Deduced a trap composed of 32 places in 389 ms of which 1 ms to minimize.
[2023-03-20 11:05:52] [INFO ] Deduced a trap composed of 26 places in 322 ms of which 1 ms to minimize.
[2023-03-20 11:05:52] [INFO ] Deduced a trap composed of 25 places in 322 ms of which 1 ms to minimize.
[2023-03-20 11:05:52] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 1 ms to minimize.
[2023-03-20 11:05:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2866 ms
[2023-03-20 11:05:53] [INFO ] Deduced a trap composed of 28 places in 300 ms of which 1 ms to minimize.
[2023-03-20 11:05:53] [INFO ] Deduced a trap composed of 42 places in 312 ms of which 1 ms to minimize.
[2023-03-20 11:05:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 837 ms
[2023-03-20 11:05:54] [INFO ] Deduced a trap composed of 25 places in 376 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 11:05:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 11:05:54] [INFO ] After 25175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 842 ms.
Support contains 22 out of 1968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Drop transitions removed 529 transitions
Trivial Post-agglo rules discarded 529 transitions
Performed 529 trivial Post agglomeration. Transition count delta: 529
Iterating post reduction 0 with 529 rules applied. Total rules applied 529 place count 1968 transition count 1439
Reduce places removed 529 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 532 rules applied. Total rules applied 1061 place count 1439 transition count 1436
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1064 place count 1436 transition count 1436
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 391 Pre rules applied. Total rules applied 1064 place count 1436 transition count 1045
Deduced a syphon composed of 391 places in 1 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 3 with 782 rules applied. Total rules applied 1846 place count 1045 transition count 1045
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1852 place count 1039 transition count 1039
Iterating global reduction 3 with 6 rules applied. Total rules applied 1858 place count 1039 transition count 1039
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1858 place count 1039 transition count 1034
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1868 place count 1034 transition count 1034
Performed 458 Post agglomeration using F-continuation condition.Transition count delta: 458
Deduced a syphon composed of 458 places in 1 ms
Reduce places removed 458 places and 0 transitions.
Iterating global reduction 3 with 916 rules applied. Total rules applied 2784 place count 576 transition count 576
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2785 place count 576 transition count 575
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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2787 place count 575 transition count 574
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2989 place count 474 transition count 667
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 3073 place count 432 transition count 706
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3074 place count 432 transition count 705
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3075 place count 432 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3076 place count 431 transition count 704
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3077 place count 431 transition count 703
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3078 place count 430 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3079 place count 429 transition count 702
Applied a total of 3079 rules in 723 ms. Remains 429 /1968 variables (removed 1539) and now considering 702/1968 (removed 1266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 724 ms. Remains : 429/1968 places, 702/1968 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 116727 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{2=1, 7=1}
Probabilistic random walk after 116727 steps, saw 71175 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :2
Running SMT prover for 8 properties.
// Phase 1: matrix 702 rows 429 cols
[2023-03-20 11:06:00] [INFO ] Computed 200 place invariants in 7 ms
[2023-03-20 11:06:00] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 11:06:00] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2023-03-20 11:06:00] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 11:06:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 11:06:00] [INFO ] After 176ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 11:06:01] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-20 11:06:01] [INFO ] After 1200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 256 ms.
Support contains 17 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 702/702 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 428 transition count 701
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 428 transition count 699
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 426 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 425 transition count 698
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 425 transition count 698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 424 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 423 transition count 699
Applied a total of 12 rules in 71 ms. Remains 423 /429 variables (removed 6) and now considering 699/702 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 423/429 places, 699/702 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 66344 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{1=1}
Probabilistic random walk after 66344 steps, saw 40796 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :1
Running SMT prover for 7 properties.
// Phase 1: matrix 699 rows 423 cols
[2023-03-20 11:06:06] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-20 11:06:06] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 11:06:06] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-20 11:06:06] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 11:06:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 11:06:06] [INFO ] After 180ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 11:06:07] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-20 11:06:07] [INFO ] After 1238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 15 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 699/699 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 423 transition count 698
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 421 transition count 698
Applied a total of 4 rules in 25 ms. Remains 421 /423 variables (removed 2) and now considering 698/699 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 421/423 places, 698/699 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 162012 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 6=1}
Probabilistic random walk after 162012 steps, saw 98809 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :6
Running SMT prover for 1 properties.
// Phase 1: matrix 698 rows 421 cols
[2023-03-20 11:06:11] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-20 11:06:11] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:06:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-20 11:06:11] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:06:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 11:06:11] [INFO ] After 32ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 11:06:11] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2023-03-20 11:06:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-20 11:06:11] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-20 11:06:11] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 38 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 698/698 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 421 transition count 696
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 419 transition count 696
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 419 transition count 691
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 414 transition count 691
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 411 transition count 688
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 34 place count 404 transition count 695
Applied a total of 34 rules in 51 ms. Remains 404 /421 variables (removed 17) and now considering 695/698 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 404/421 places, 695/698 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 351290 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 351290 steps, saw 224020 distinct states, run finished after 3002 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 695 rows 404 cols
[2023-03-20 11:06:15] [INFO ] Computed 200 place invariants in 6 ms
[2023-03-20 11:06:15] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:06:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 52 ms returned sat
[2023-03-20 11:06:15] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:06:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 11:06:15] [INFO ] After 19ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 11:06:15] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-20 11:06:15] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 695/695 transitions.
Applied a total of 0 rules in 10 ms. Remains 404 /404 variables (removed 0) and now considering 695/695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 404/404 places, 695/695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 695/695 transitions.
Applied a total of 0 rules in 10 ms. Remains 404 /404 variables (removed 0) and now considering 695/695 (removed 0) transitions.
[2023-03-20 11:06:15] [INFO ] Invariant cache hit.
[2023-03-20 11:06:16] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-20 11:06:16] [INFO ] Invariant cache hit.
[2023-03-20 11:06:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 11:06:16] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
[2023-03-20 11:06:16] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-20 11:06:16] [INFO ] Invariant cache hit.
[2023-03-20 11:06:17] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1653 ms. Remains : 404/404 places, 695/695 transitions.
Graph (trivial) has 197 edges and 404 vertex of which 4 / 404 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1386 edges and 402 vertex of which 400 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 194 edges and 398 vertex of which 4 / 398 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 396 transition count 686
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 193 edges and 394 vertex of which 6 / 394 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 391 transition count 677
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 191 edges and 388 vertex of which 8 / 388 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 384 transition count 666
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 380 vertex of which 8 / 380 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 376 transition count 652
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 372 vertex of which 8 / 372 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 368 transition count 638
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 364 vertex of which 8 / 364 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 360 transition count 624
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 356 vertex of which 8 / 356 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 352 transition count 610
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 171 edges and 348 vertex of which 6 / 348 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 18 rules applied. Total rules applied 129 place count 345 transition count 597
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 168 edges and 342 vertex of which 6 / 342 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 16 rules applied. Total rules applied 145 place count 339 transition count 585
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 166 edges and 336 vertex of which 8 / 336 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 15 rules applied. Total rules applied 160 place count 332 transition count 574
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 328 vertex of which 10 / 328 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 179 place count 323 transition count 560
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 157 edges and 319 vertex of which 6 / 319 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 11 with 20 rules applied. Total rules applied 199 place count 316 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 154 edges and 313 vertex of which 6 / 313 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 16 rules applied. Total rules applied 215 place count 310 transition count 533
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 152 edges and 307 vertex of which 6 / 307 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 15 rules applied. Total rules applied 230 place count 304 transition count 522
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 150 edges and 301 vertex of which 8 / 301 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 15 rules applied. Total rules applied 245 place count 297 transition count 511
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 984 edges and 293 vertex of which 287 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 143 edges and 287 vertex of which 8 / 287 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 21 rules applied. Total rules applied 266 place count 283 transition count 491
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 139 edges and 279 vertex of which 8 / 279 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 285 place count 275 transition count 477
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 135 edges and 271 vertex of which 8 / 271 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 304 place count 267 transition count 463
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 131 edges and 263 vertex of which 8 / 263 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 323 place count 259 transition count 449
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 127 edges and 255 vertex of which 8 / 255 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 342 place count 251 transition count 435
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 123 edges and 247 vertex of which 8 / 247 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 361 place count 243 transition count 421
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 119 edges and 239 vertex of which 8 / 239 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 380 place count 235 transition count 407
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 115 edges and 231 vertex of which 8 / 231 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 399 place count 227 transition count 393
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 111 edges and 223 vertex of which 8 / 223 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 418 place count 219 transition count 379
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 107 edges and 215 vertex of which 8 / 215 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 437 place count 211 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 103 edges and 207 vertex of which 8 / 207 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 456 place count 203 transition count 351
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 199 vertex of which 8 / 199 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 475 place count 195 transition count 337
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 94 edges and 192 vertex of which 6 / 192 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 27 with 18 rules applied. Total rules applied 493 place count 189 transition count 323
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 92 edges and 186 vertex of which 8 / 186 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 15 rules applied. Total rules applied 508 place count 182 transition count 312
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 585 edges and 178 vertex of which 175 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (trivial) has 87 edges and 175 vertex of which 8 / 175 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 20 rules applied. Total rules applied 528 place count 171 transition count 295
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 167 vertex of which 8 / 167 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 547 place count 163 transition count 281
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 79 edges and 159 vertex of which 8 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 566 place count 155 transition count 267
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 75 edges and 151 vertex of which 8 / 151 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 585 place count 147 transition count 253
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 71 edges and 143 vertex of which 8 / 143 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 604 place count 139 transition count 239
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 67 edges and 135 vertex of which 8 / 135 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 623 place count 131 transition count 225
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 63 edges and 127 vertex of which 8 / 127 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 642 place count 123 transition count 211
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 59 edges and 119 vertex of which 8 / 119 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 661 place count 115 transition count 197
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 55 edges and 111 vertex of which 8 / 111 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 680 place count 107 transition count 183
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 51 edges and 103 vertex of which 8 / 103 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 699 place count 99 transition count 169
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 47 edges and 95 vertex of which 8 / 95 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 718 place count 91 transition count 155
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 43 edges and 87 vertex of which 8 / 87 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 737 place count 83 transition count 141
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 39 edges and 79 vertex of which 8 / 79 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 756 place count 75 transition count 127
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 35 edges and 71 vertex of which 8 / 71 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 775 place count 67 transition count 113
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 31 edges and 63 vertex of which 8 / 63 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 794 place count 59 transition count 99
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 27 edges and 55 vertex of which 8 / 55 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 813 place count 51 transition count 85
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 23 edges and 47 vertex of which 6 / 47 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 832 place count 44 transition count 71
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 21 edges and 41 vertex of which 8 / 41 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 46 with 15 rules applied. Total rules applied 847 place count 37 transition count 60
Discarding 24 places :
Also discarding 42 output transitions
Drop transitions removed 42 transitions
Remove reverse transitions (loop back) rule discarded transition t47.t44.t45 and 24 places that fell out of Prefix Of Interest.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 47 with 11 rules applied. Total rules applied 858 place count 9 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 48 with 2 Pre rules applied. Total rules applied 858 place count 9 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 48 with 5 rules applied. Total rules applied 863 place count 6 transition count 6
Applied a total of 863 rules in 97 ms. Remains 6 /404 variables (removed 398) and now considering 6/695 (removed 689) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 6 cols
[2023-03-20 11:06:17] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-20 11:06:17] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:06:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 11:06:17] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:06:17] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 11:06:17] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldRVt-PT-050B-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 599 stabilizing places and 599 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' '!(X(G((F(G(!p0)) U p1))))'
Support contains 4 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1954 transition count 1954
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1954 transition count 1954
Applied a total of 28 rules in 206 ms. Remains 1954 /1968 variables (removed 14) and now considering 1954/1968 (removed 14) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2023-03-20 11:06:18] [INFO ] Computed 201 place invariants in 16 ms
[2023-03-20 11:06:18] [INFO ] Implicit Places using invariants in 592 ms returned []
[2023-03-20 11:06:18] [INFO ] Invariant cache hit.
[2023-03-20 11:06:20] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 2364 ms to find 0 implicit places.
[2023-03-20 11:06:20] [INFO ] Invariant cache hit.
[2023-03-20 11:06:21] [INFO ] Dead Transitions using invariants and state equation in 1105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1954/1968 places, 1954/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3679 ms. Remains : 1954/1968 places, 1954/1968 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s685 0) (EQ s1504 1)), p0:(OR (EQ s1786 0) (EQ s1514 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 585 ms.
Product exploration explored 100000 steps with 3 reset in 646 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 11:06:23] [INFO ] Invariant cache hit.
[2023-03-20 11:06:23] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:06:24] [INFO ] [Nat]Absence check using 201 positive place invariants in 109 ms returned sat
[2023-03-20 11:06:25] [INFO ] After 942ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:06:25] [INFO ] Deduced a trap composed of 33 places in 416 ms of which 3 ms to minimize.
[2023-03-20 11:06:26] [INFO ] Deduced a trap composed of 45 places in 463 ms of which 2 ms to minimize.
[2023-03-20 11:06:26] [INFO ] Deduced a trap composed of 29 places in 402 ms of which 2 ms to minimize.
[2023-03-20 11:06:26] [INFO ] Deduced a trap composed of 22 places in 351 ms of which 1 ms to minimize.
[2023-03-20 11:06:27] [INFO ] Deduced a trap composed of 25 places in 363 ms of which 1 ms to minimize.
[2023-03-20 11:06:27] [INFO ] Deduced a trap composed of 52 places in 380 ms of which 1 ms to minimize.
[2023-03-20 11:06:28] [INFO ] Deduced a trap composed of 26 places in 452 ms of which 4 ms to minimize.
[2023-03-20 11:06:28] [INFO ] Deduced a trap composed of 53 places in 339 ms of which 1 ms to minimize.
[2023-03-20 11:06:29] [INFO ] Deduced a trap composed of 37 places in 372 ms of which 1 ms to minimize.
[2023-03-20 11:06:29] [INFO ] Deduced a trap composed of 33 places in 420 ms of which 1 ms to minimize.
[2023-03-20 11:06:30] [INFO ] Deduced a trap composed of 47 places in 452 ms of which 2 ms to minimize.
[2023-03-20 11:06:30] [INFO ] Deduced a trap composed of 28 places in 392 ms of which 1 ms to minimize.
[2023-03-20 11:06:31] [INFO ] Deduced a trap composed of 24 places in 450 ms of which 2 ms to minimize.
[2023-03-20 11:06:31] [INFO ] Deduced a trap composed of 32 places in 420 ms of which 1 ms to minimize.
[2023-03-20 11:06:32] [INFO ] Deduced a trap composed of 24 places in 431 ms of which 1 ms to minimize.
[2023-03-20 11:06:32] [INFO ] Deduced a trap composed of 21 places in 437 ms of which 1 ms to minimize.
[2023-03-20 11:06:33] [INFO ] Deduced a trap composed of 38 places in 424 ms of which 4 ms to minimize.
[2023-03-20 11:06:33] [INFO ] Deduced a trap composed of 42 places in 415 ms of which 1 ms to minimize.
[2023-03-20 11:06:34] [INFO ] Deduced a trap composed of 41 places in 434 ms of which 3 ms to minimize.
[2023-03-20 11:06:34] [INFO ] Deduced a trap composed of 44 places in 428 ms of which 3 ms to minimize.
[2023-03-20 11:06:35] [INFO ] Deduced a trap composed of 31 places in 408 ms of which 2 ms to minimize.
[2023-03-20 11:06:35] [INFO ] Deduced a trap composed of 35 places in 373 ms of which 1 ms to minimize.
[2023-03-20 11:06:36] [INFO ] Deduced a trap composed of 25 places in 371 ms of which 1 ms to minimize.
[2023-03-20 11:06:36] [INFO ] Deduced a trap composed of 36 places in 353 ms of which 1 ms to minimize.
[2023-03-20 11:06:36] [INFO ] Deduced a trap composed of 26 places in 412 ms of which 1 ms to minimize.
[2023-03-20 11:06:37] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 1 ms to minimize.
[2023-03-20 11:06:37] [INFO ] Deduced a trap composed of 52 places in 367 ms of which 1 ms to minimize.
[2023-03-20 11:06:38] [INFO ] Deduced a trap composed of 51 places in 348 ms of which 1 ms to minimize.
[2023-03-20 11:06:38] [INFO ] Deduced a trap composed of 45 places in 346 ms of which 1 ms to minimize.
[2023-03-20 11:06:39] [INFO ] Deduced a trap composed of 71 places in 349 ms of which 1 ms to minimize.
[2023-03-20 11:06:39] [INFO ] Deduced a trap composed of 65 places in 330 ms of which 1 ms to minimize.
[2023-03-20 11:06:39] [INFO ] Deduced a trap composed of 48 places in 322 ms of which 1 ms to minimize.
[2023-03-20 11:06:40] [INFO ] Deduced a trap composed of 67 places in 313 ms of which 1 ms to minimize.
[2023-03-20 11:06:40] [INFO ] Deduced a trap composed of 71 places in 340 ms of which 1 ms to minimize.
[2023-03-20 11:06:41] [INFO ] Deduced a trap composed of 73 places in 307 ms of which 1 ms to minimize.
[2023-03-20 11:06:41] [INFO ] Deduced a trap composed of 76 places in 312 ms of which 1 ms to minimize.
[2023-03-20 11:06:41] [INFO ] Deduced a trap composed of 58 places in 268 ms of which 1 ms to minimize.
[2023-03-20 11:06:42] [INFO ] Deduced a trap composed of 61 places in 354 ms of which 1 ms to minimize.
[2023-03-20 11:06:42] [INFO ] Deduced a trap composed of 69 places in 310 ms of which 1 ms to minimize.
[2023-03-20 11:06:43] [INFO ] Deduced a trap composed of 60 places in 295 ms of which 1 ms to minimize.
[2023-03-20 11:06:43] [INFO ] Deduced a trap composed of 61 places in 283 ms of which 1 ms to minimize.
[2023-03-20 11:06:43] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 0 ms to minimize.
[2023-03-20 11:06:44] [INFO ] Deduced a trap composed of 54 places in 339 ms of which 1 ms to minimize.
[2023-03-20 11:06:44] [INFO ] Deduced a trap composed of 74 places in 296 ms of which 1 ms to minimize.
[2023-03-20 11:06:44] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 19672 ms
[2023-03-20 11:06:44] [INFO ] After 20689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-20 11:06:44] [INFO ] After 21189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 1954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Drop transitions removed 549 transitions
Trivial Post-agglo rules discarded 549 transitions
Performed 549 trivial Post agglomeration. Transition count delta: 549
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 1954 transition count 1405
Reduce places removed 549 places and 0 transitions.
Iterating post reduction 1 with 549 rules applied. Total rules applied 1098 place count 1405 transition count 1405
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 398 Pre rules applied. Total rules applied 1098 place count 1405 transition count 1007
Deduced a syphon composed of 398 places in 2 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1894 place count 1007 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1895 place count 1006 transition count 1006
Iterating global reduction 2 with 1 rules applied. Total rules applied 1896 place count 1006 transition count 1006
Performed 452 Post agglomeration using F-continuation condition.Transition count delta: 452
Deduced a syphon composed of 452 places in 1 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 2 with 904 rules applied. Total rules applied 2800 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2801 place count 554 transition count 553
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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2803 place count 553 transition count 552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3005 place count 452 transition count 652
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3099 place count 405 transition count 698
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3100 place count 405 transition count 697
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3101 place count 405 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3102 place count 404 transition count 696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3103 place count 404 transition count 695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3104 place count 403 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3105 place count 402 transition count 694
Applied a total of 3105 rules in 360 ms. Remains 402 /1954 variables (removed 1552) and now considering 694/1954 (removed 1260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 402/1954 places, 694/1954 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 372049 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 372049 steps, saw 239958 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 694 rows 402 cols
[2023-03-20 11:06:48] [INFO ] Computed 200 place invariants in 5 ms
[2023-03-20 11:06:48] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:06:48] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-20 11:06:48] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:06:48] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-20 11:06:48] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 694/694 transitions.
Applied a total of 0 rules in 9 ms. Remains 402 /402 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 402/402 places, 694/694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 694/694 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2023-03-20 11:06:49] [INFO ] Invariant cache hit.
[2023-03-20 11:06:49] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-20 11:06:49] [INFO ] Invariant cache hit.
[2023-03-20 11:06:49] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2023-03-20 11:06:49] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 11:06:49] [INFO ] Invariant cache hit.
[2023-03-20 11:06:50] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1128 ms. Remains : 402/402 places, 694/694 transitions.
Graph (trivial) has 197 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 194 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 685
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 193 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 676
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 191 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 665
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 651
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 637
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 623
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 609
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 346 vertex of which 8 / 346 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 595
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 338 vertex of which 8 / 338 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 334 transition count 581
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 330 vertex of which 8 / 330 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 326 transition count 567
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 160 edges and 322 vertex of which 8 / 322 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 18 rules applied. Total rules applied 186 place count 318 transition count 554
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 156 edges and 314 vertex of which 6 / 314 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 203 place count 311 transition count 542
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 153 edges and 308 vertex of which 6 / 308 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 16 rules applied. Total rules applied 219 place count 305 transition count 530
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 151 edges and 302 vertex of which 6 / 302 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 15 rules applied. Total rules applied 234 place count 299 transition count 519
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 149 edges and 296 vertex of which 8 / 296 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 15 rules applied. Total rules applied 249 place count 292 transition count 508
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 145 edges and 288 vertex of which 8 / 288 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 20 rules applied. Total rules applied 269 place count 284 transition count 493
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 141 edges and 280 vertex of which 8 / 280 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 288 place count 276 transition count 479
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 272 vertex of which 8 / 272 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 307 place count 268 transition count 465
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 133 edges and 264 vertex of which 8 / 264 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 326 place count 260 transition count 451
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 129 edges and 256 vertex of which 8 / 256 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 345 place count 252 transition count 437
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 125 edges and 248 vertex of which 8 / 248 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 364 place count 244 transition count 423
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 121 edges and 240 vertex of which 8 / 240 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 383 place count 236 transition count 409
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 117 edges and 232 vertex of which 8 / 232 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 402 place count 228 transition count 395
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 113 edges and 224 vertex of which 8 / 224 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 421 place count 220 transition count 381
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 109 edges and 216 vertex of which 8 / 216 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 440 place count 212 transition count 367
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 105 edges and 208 vertex of which 8 / 208 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 459 place count 204 transition count 353
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 101 edges and 200 vertex of which 8 / 200 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 478 place count 196 transition count 339
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 97 edges and 192 vertex of which 8 / 192 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 497 place count 188 transition count 325
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 93 edges and 184 vertex of which 8 / 184 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 516 place count 180 transition count 311
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 89 edges and 176 vertex of which 8 / 176 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 535 place count 172 transition count 297
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 85 edges and 168 vertex of which 8 / 168 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 554 place count 164 transition count 283
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 81 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 573 place count 156 transition count 269
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 77 edges and 152 vertex of which 6 / 152 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 592 place count 149 transition count 255
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 73 edges and 146 vertex of which 4 / 146 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 33 with 14 rules applied. Total rules applied 606 place count 144 transition count 245
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 70 edges and 142 vertex of which 2 / 142 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 34 with 9 rules applied. Total rules applied 615 place count 141 transition count 239
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 5 rules applied. Total rules applied 620 place count 140 transition count 235
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 3 Pre rules applied. Total rules applied 620 place count 140 transition count 232
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 628 place count 135 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 66 edges and 135 vertex of which 2 / 135 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 36 with 2 rules applied. Total rules applied 630 place count 134 transition count 231
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 632 place count 134 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 38 with 3 rules applied. Total rules applied 635 place count 132 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 639 place count 132 transition count 224
Applied a total of 639 rules in 80 ms. Remains 132 /402 variables (removed 270) and now considering 224/694 (removed 470) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 132 cols
[2023-03-20 11:06:50] [INFO ] Computed 66 place invariants in 1 ms
[2023-03-20 11:06:50] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:06:50] [INFO ] [Nat]Absence check using 66 positive place invariants in 9 ms returned sat
[2023-03-20 11:06:50] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:06:50] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 11:06:50] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Applied a total of 0 rules in 93 ms. Remains 1954 /1954 variables (removed 0) and now considering 1954/1954 (removed 0) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2023-03-20 11:06:51] [INFO ] Computed 201 place invariants in 15 ms
[2023-03-20 11:06:51] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-20 11:06:51] [INFO ] Invariant cache hit.
[2023-03-20 11:06:53] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2232 ms to find 0 implicit places.
[2023-03-20 11:06:53] [INFO ] Invariant cache hit.
[2023-03-20 11:06:54] [INFO ] Dead Transitions using invariants and state equation in 990 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3339 ms. Remains : 1954/1954 places, 1954/1954 transitions.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 11:06:54] [INFO ] Invariant cache hit.
[2023-03-20 11:06:54] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:06:55] [INFO ] [Nat]Absence check using 201 positive place invariants in 61 ms returned sat
[2023-03-20 11:06:56] [INFO ] After 798ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:06:56] [INFO ] Deduced a trap composed of 33 places in 416 ms of which 1 ms to minimize.
[2023-03-20 11:06:56] [INFO ] Deduced a trap composed of 45 places in 394 ms of which 1 ms to minimize.
[2023-03-20 11:06:57] [INFO ] Deduced a trap composed of 29 places in 371 ms of which 1 ms to minimize.
[2023-03-20 11:06:57] [INFO ] Deduced a trap composed of 22 places in 377 ms of which 1 ms to minimize.
[2023-03-20 11:06:58] [INFO ] Deduced a trap composed of 25 places in 394 ms of which 1 ms to minimize.
[2023-03-20 11:06:58] [INFO ] Deduced a trap composed of 52 places in 360 ms of which 1 ms to minimize.
[2023-03-20 11:06:59] [INFO ] Deduced a trap composed of 26 places in 352 ms of which 1 ms to minimize.
[2023-03-20 11:06:59] [INFO ] Deduced a trap composed of 53 places in 348 ms of which 1 ms to minimize.
[2023-03-20 11:06:59] [INFO ] Deduced a trap composed of 37 places in 384 ms of which 1 ms to minimize.
[2023-03-20 11:07:00] [INFO ] Deduced a trap composed of 33 places in 351 ms of which 1 ms to minimize.
[2023-03-20 11:07:00] [INFO ] Deduced a trap composed of 47 places in 356 ms of which 1 ms to minimize.
[2023-03-20 11:07:01] [INFO ] Deduced a trap composed of 28 places in 362 ms of which 1 ms to minimize.
[2023-03-20 11:07:01] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 1 ms to minimize.
[2023-03-20 11:07:01] [INFO ] Deduced a trap composed of 32 places in 358 ms of which 1 ms to minimize.
[2023-03-20 11:07:02] [INFO ] Deduced a trap composed of 24 places in 340 ms of which 1 ms to minimize.
[2023-03-20 11:07:02] [INFO ] Deduced a trap composed of 21 places in 343 ms of which 1 ms to minimize.
[2023-03-20 11:07:03] [INFO ] Deduced a trap composed of 38 places in 350 ms of which 1 ms to minimize.
[2023-03-20 11:07:03] [INFO ] Deduced a trap composed of 42 places in 348 ms of which 1 ms to minimize.
[2023-03-20 11:07:03] [INFO ] Deduced a trap composed of 41 places in 319 ms of which 1 ms to minimize.
[2023-03-20 11:07:04] [INFO ] Deduced a trap composed of 44 places in 322 ms of which 1 ms to minimize.
[2023-03-20 11:07:04] [INFO ] Deduced a trap composed of 31 places in 308 ms of which 1 ms to minimize.
[2023-03-20 11:07:05] [INFO ] Deduced a trap composed of 35 places in 304 ms of which 0 ms to minimize.
[2023-03-20 11:07:05] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 1 ms to minimize.
[2023-03-20 11:07:05] [INFO ] Deduced a trap composed of 36 places in 293 ms of which 1 ms to minimize.
[2023-03-20 11:07:06] [INFO ] Deduced a trap composed of 26 places in 287 ms of which 1 ms to minimize.
[2023-03-20 11:07:06] [INFO ] Deduced a trap composed of 27 places in 320 ms of which 1 ms to minimize.
[2023-03-20 11:07:06] [INFO ] Deduced a trap composed of 52 places in 283 ms of which 1 ms to minimize.
[2023-03-20 11:07:07] [INFO ] Deduced a trap composed of 51 places in 314 ms of which 1 ms to minimize.
[2023-03-20 11:07:07] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 0 ms to minimize.
[2023-03-20 11:07:07] [INFO ] Deduced a trap composed of 71 places in 265 ms of which 1 ms to minimize.
[2023-03-20 11:07:08] [INFO ] Deduced a trap composed of 65 places in 288 ms of which 0 ms to minimize.
[2023-03-20 11:07:08] [INFO ] Deduced a trap composed of 48 places in 296 ms of which 1 ms to minimize.
[2023-03-20 11:07:08] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 1 ms to minimize.
[2023-03-20 11:07:09] [INFO ] Deduced a trap composed of 71 places in 255 ms of which 1 ms to minimize.
[2023-03-20 11:07:09] [INFO ] Deduced a trap composed of 73 places in 257 ms of which 1 ms to minimize.
[2023-03-20 11:07:09] [INFO ] Deduced a trap composed of 76 places in 262 ms of which 0 ms to minimize.
[2023-03-20 11:07:10] [INFO ] Deduced a trap composed of 58 places in 263 ms of which 1 ms to minimize.
[2023-03-20 11:07:10] [INFO ] Deduced a trap composed of 61 places in 250 ms of which 1 ms to minimize.
[2023-03-20 11:07:10] [INFO ] Deduced a trap composed of 69 places in 249 ms of which 1 ms to minimize.
[2023-03-20 11:07:11] [INFO ] Deduced a trap composed of 60 places in 254 ms of which 1 ms to minimize.
[2023-03-20 11:07:11] [INFO ] Deduced a trap composed of 61 places in 276 ms of which 0 ms to minimize.
[2023-03-20 11:07:11] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 1 ms to minimize.
[2023-03-20 11:07:12] [INFO ] Deduced a trap composed of 54 places in 223 ms of which 0 ms to minimize.
[2023-03-20 11:07:12] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 1 ms to minimize.
[2023-03-20 11:07:12] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 16372 ms
[2023-03-20 11:07:12] [INFO ] After 17237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-20 11:07:12] [INFO ] After 17652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 1954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Drop transitions removed 549 transitions
Trivial Post-agglo rules discarded 549 transitions
Performed 549 trivial Post agglomeration. Transition count delta: 549
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 1954 transition count 1405
Reduce places removed 549 places and 0 transitions.
Iterating post reduction 1 with 549 rules applied. Total rules applied 1098 place count 1405 transition count 1405
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 398 Pre rules applied. Total rules applied 1098 place count 1405 transition count 1007
Deduced a syphon composed of 398 places in 2 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1894 place count 1007 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1895 place count 1006 transition count 1006
Iterating global reduction 2 with 1 rules applied. Total rules applied 1896 place count 1006 transition count 1006
Performed 452 Post agglomeration using F-continuation condition.Transition count delta: 452
Deduced a syphon composed of 452 places in 0 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 2 with 904 rules applied. Total rules applied 2800 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2801 place count 554 transition count 553
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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2803 place count 553 transition count 552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3005 place count 452 transition count 652
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3099 place count 405 transition count 698
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3100 place count 405 transition count 697
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3101 place count 405 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3102 place count 404 transition count 696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3103 place count 404 transition count 695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3104 place count 403 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3105 place count 402 transition count 694
Applied a total of 3105 rules in 299 ms. Remains 402 /1954 variables (removed 1552) and now considering 694/1954 (removed 1260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 402/1954 places, 694/1954 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 369468 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 369468 steps, saw 238387 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 694 rows 402 cols
[2023-03-20 11:07:15] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-20 11:07:16] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:07:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-20 11:07:16] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:07:16] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-20 11:07:16] [INFO ] After 386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 694/694 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 402/402 places, 694/694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 694/694 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2023-03-20 11:07:16] [INFO ] Invariant cache hit.
[2023-03-20 11:07:16] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-20 11:07:16] [INFO ] Invariant cache hit.
[2023-03-20 11:07:17] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2023-03-20 11:07:17] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 11:07:17] [INFO ] Invariant cache hit.
[2023-03-20 11:07:17] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1018 ms. Remains : 402/402 places, 694/694 transitions.
Graph (trivial) has 197 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 194 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 685
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 193 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 676
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 191 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 665
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 651
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 637
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 623
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 609
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 346 vertex of which 8 / 346 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 595
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 338 vertex of which 8 / 338 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 334 transition count 581
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 163 edges and 330 vertex of which 8 / 330 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 326 transition count 567
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 160 edges and 322 vertex of which 8 / 322 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 18 rules applied. Total rules applied 186 place count 318 transition count 554
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 156 edges and 314 vertex of which 6 / 314 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 203 place count 311 transition count 542
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 153 edges and 308 vertex of which 6 / 308 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 16 rules applied. Total rules applied 219 place count 305 transition count 530
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 151 edges and 302 vertex of which 6 / 302 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 15 rules applied. Total rules applied 234 place count 299 transition count 519
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 149 edges and 296 vertex of which 8 / 296 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 15 rules applied. Total rules applied 249 place count 292 transition count 508
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 145 edges and 288 vertex of which 8 / 288 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 20 rules applied. Total rules applied 269 place count 284 transition count 493
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 141 edges and 280 vertex of which 8 / 280 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 288 place count 276 transition count 479
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 272 vertex of which 8 / 272 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 307 place count 268 transition count 465
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 133 edges and 264 vertex of which 8 / 264 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 326 place count 260 transition count 451
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 129 edges and 256 vertex of which 8 / 256 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 345 place count 252 transition count 437
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 125 edges and 248 vertex of which 8 / 248 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 364 place count 244 transition count 423
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 121 edges and 240 vertex of which 8 / 240 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 383 place count 236 transition count 409
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 117 edges and 232 vertex of which 8 / 232 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 402 place count 228 transition count 395
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 113 edges and 224 vertex of which 8 / 224 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 421 place count 220 transition count 381
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 109 edges and 216 vertex of which 8 / 216 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 440 place count 212 transition count 367
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 105 edges and 208 vertex of which 8 / 208 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 459 place count 204 transition count 353
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 101 edges and 200 vertex of which 8 / 200 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 478 place count 196 transition count 339
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 97 edges and 192 vertex of which 8 / 192 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 497 place count 188 transition count 325
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 93 edges and 184 vertex of which 8 / 184 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 516 place count 180 transition count 311
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 89 edges and 176 vertex of which 8 / 176 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 535 place count 172 transition count 297
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 85 edges and 168 vertex of which 8 / 168 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 554 place count 164 transition count 283
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 81 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 573 place count 156 transition count 269
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 77 edges and 152 vertex of which 6 / 152 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 592 place count 149 transition count 255
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 73 edges and 146 vertex of which 4 / 146 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 33 with 14 rules applied. Total rules applied 606 place count 144 transition count 245
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 70 edges and 142 vertex of which 2 / 142 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 34 with 9 rules applied. Total rules applied 615 place count 141 transition count 239
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 5 rules applied. Total rules applied 620 place count 140 transition count 235
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 3 Pre rules applied. Total rules applied 620 place count 140 transition count 232
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 628 place count 135 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 66 edges and 135 vertex of which 2 / 135 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 36 with 2 rules applied. Total rules applied 630 place count 134 transition count 231
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 632 place count 134 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 38 with 3 rules applied. Total rules applied 635 place count 132 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 639 place count 132 transition count 224
Applied a total of 639 rules in 92 ms. Remains 132 /402 variables (removed 270) and now considering 224/694 (removed 470) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 132 cols
[2023-03-20 11:07:17] [INFO ] Computed 66 place invariants in 1 ms
[2023-03-20 11:07:17] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:07:17] [INFO ] [Nat]Absence check using 66 positive place invariants in 8 ms returned sat
[2023-03-20 11:07:17] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:07:17] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 11:07:17] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 636 ms.
Product exploration explored 100000 steps with 1 reset in 631 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Performed 548 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1954 transition count 1954
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 199 Pre rules applied. Total rules applied 548 place count 1954 transition count 2154
Deduced a syphon composed of 747 places in 3 ms
Iterating global reduction 1 with 199 rules applied. Total rules applied 747 place count 1954 transition count 2154
Performed 601 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1348 places in 2 ms
Iterating global reduction 1 with 601 rules applied. Total rules applied 1348 place count 1954 transition count 2155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1349 place count 1954 transition count 2154
Renaming transitions due to excessive name length > 1024 char.
Discarding 401 places :
Symmetric choice reduction at 2 with 401 rule applications. Total rules 1750 place count 1553 transition count 1752
Deduced a syphon composed of 947 places in 2 ms
Iterating global reduction 2 with 401 rules applied. Total rules applied 2151 place count 1553 transition count 1752
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 948 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2152 place count 1553 transition count 1752
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2154 place count 1551 transition count 1750
Deduced a syphon composed of 946 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2156 place count 1551 transition count 1750
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1047 places in 15 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2257 place count 1551 transition count 2482
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2358 place count 1450 transition count 2280
Deduced a syphon composed of 946 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2459 place count 1450 transition count 2280
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -694
Deduced a syphon composed of 1042 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 2555 place count 1450 transition count 2974
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 2651 place count 1354 transition count 2782
Deduced a syphon composed of 946 places in 0 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 2747 place count 1354 transition count 2782
Deduced a syphon composed of 946 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2750 place count 1354 transition count 2779
Deduced a syphon composed of 946 places in 1 ms
Applied a total of 2750 rules in 1730 ms. Remains 1354 /1954 variables (removed 600) and now considering 2779/1954 (removed -825) transitions.
[2023-03-20 11:07:21] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2779 rows 1354 cols
[2023-03-20 11:07:21] [INFO ] Computed 201 place invariants in 31 ms
[2023-03-20 11:07:23] [INFO ] Dead Transitions using invariants and state equation in 1204 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1354/1954 places, 2779/1954 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3052 ms. Remains : 1354/1954 places, 2779/1954 transitions.
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Applied a total of 0 rules in 125 ms. Remains 1954 /1954 variables (removed 0) and now considering 1954/1954 (removed 0) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2023-03-20 11:07:23] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-20 11:07:23] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-20 11:07:23] [INFO ] Invariant cache hit.
[2023-03-20 11:07:25] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
[2023-03-20 11:07:25] [INFO ] Invariant cache hit.
[2023-03-20 11:07:26] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3248 ms. Remains : 1954/1954 places, 1954/1954 transitions.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-00 finished in 68810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 540 transitions
Trivial Post-agglo rules discarded 540 transitions
Performed 540 trivial Post agglomeration. Transition count delta: 540
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 1967 transition count 1427
Reduce places removed 540 places and 0 transitions.
Iterating post reduction 1 with 540 rules applied. Total rules applied 1080 place count 1427 transition count 1427
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 394 Pre rules applied. Total rules applied 1080 place count 1427 transition count 1033
Deduced a syphon composed of 394 places in 1 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 1868 place count 1033 transition count 1033
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1883 place count 1018 transition count 1018
Iterating global reduction 2 with 15 rules applied. Total rules applied 1898 place count 1018 transition count 1018
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 1898 place count 1018 transition count 1004
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 1926 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2824 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2825 place count 555 transition count 554
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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2827 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3029 place count 453 transition count 652
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3125 place count 405 transition count 700
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3127 place count 403 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3128 place count 402 transition count 698
Applied a total of 3128 rules in 204 ms. Remains 402 /1968 variables (removed 1566) and now considering 698/1968 (removed 1270) transitions.
// Phase 1: matrix 698 rows 402 cols
[2023-03-20 11:07:26] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-20 11:07:27] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-20 11:07:27] [INFO ] Invariant cache hit.
[2023-03-20 11:07:27] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2023-03-20 11:07:27] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 11:07:27] [INFO ] Invariant cache hit.
[2023-03-20 11:07:27] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/1968 places, 698/1968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1288 ms. Remains : 402/1968 places, 698/1968 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-01 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 s394 0) (EQ s212 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-01 finished in 1383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (p1&&X(!p1))))))'
Support contains 3 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1952 transition count 1952
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1952 transition count 1952
Applied a total of 32 rules in 263 ms. Remains 1952 /1968 variables (removed 16) and now considering 1952/1968 (removed 16) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2023-03-20 11:07:28] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-20 11:07:28] [INFO ] Implicit Places using invariants in 570 ms returned []
[2023-03-20 11:07:28] [INFO ] Invariant cache hit.
[2023-03-20 11:07:30] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1909 ms to find 0 implicit places.
[2023-03-20 11:07:30] [INFO ] Invariant cache hit.
[2023-03-20 11:07:31] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1968 places, 1952/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3086 ms. Remains : 1952/1968 places, 1952/1968 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, p1, p1, true, true, true]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(NEQ s1240 1), p0:(OR (EQ s1828 0) (EQ s651 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 897 steps with 0 reset in 7 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-04 finished in 3282 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) U (p0&&X(p2))))'
Support contains 5 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1953 transition count 1953
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1953 transition count 1953
Applied a total of 30 rules in 192 ms. Remains 1953 /1968 variables (removed 15) and now considering 1953/1968 (removed 15) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-20 11:07:31] [INFO ] Computed 201 place invariants in 13 ms
[2023-03-20 11:07:31] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-20 11:07:31] [INFO ] Invariant cache hit.
[2023-03-20 11:07:33] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 1934 ms to find 0 implicit places.
[2023-03-20 11:07:33] [INFO ] Invariant cache hit.
[2023-03-20 11:07:34] [INFO ] Dead Transitions using invariants and state equation in 1085 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1968 places, 1953/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3217 ms. Remains : 1953/1968 places, 1953/1968 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p2)), true, (AND p0 (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s721 0) (EQ s606 1)), p1:(OR (EQ s275 0) (EQ s1129 1)), p2:(EQ s189 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 69763 steps with 0 reset in 357 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-06 finished in 3734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(G(p2)||p1)))))'
Support contains 6 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1953 transition count 1953
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1953 transition count 1953
Applied a total of 30 rules in 304 ms. Remains 1953 /1968 variables (removed 15) and now considering 1953/1968 (removed 15) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-20 11:07:35] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-20 11:07:35] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-20 11:07:35] [INFO ] Invariant cache hit.
[2023-03-20 11:07:37] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2023-03-20 11:07:37] [INFO ] Invariant cache hit.
[2023-03-20 11:07:38] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1968 places, 1953/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3282 ms. Remains : 1953/1968 places, 1953/1968 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s1370 0) (EQ s68 1)), p2:(AND (EQ s23 0) (EQ s357 1)), p0:(AND (EQ s1268 0) (EQ s1737 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 531 ms.
Stack based approach found an accepted trace after 3396 steps with 1 reset with depth 1813 and stack size 1813 in 43 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-10 finished in 4058 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 3 out of 1968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 539 transitions
Trivial Post-agglo rules discarded 539 transitions
Performed 539 trivial Post agglomeration. Transition count delta: 539
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 1967 transition count 1428
Reduce places removed 539 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 540 rules applied. Total rules applied 1079 place count 1428 transition count 1427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 1427 transition count 1427
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 394 Pre rules applied. Total rules applied 1080 place count 1427 transition count 1033
Deduced a syphon composed of 394 places in 1 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 3 with 788 rules applied. Total rules applied 1868 place count 1033 transition count 1033
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1882 place count 1019 transition count 1019
Iterating global reduction 3 with 14 rules applied. Total rules applied 1896 place count 1019 transition count 1019
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 1896 place count 1019 transition count 1006
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 1922 place count 1006 transition count 1006
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 1 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 3 with 900 rules applied. Total rules applied 2822 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2823 place count 556 transition count 555
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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2825 place count 555 transition count 554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3027 place count 454 transition count 653
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3121 place count 407 transition count 699
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3123 place count 405 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3124 place count 404 transition count 697
Applied a total of 3124 rules in 321 ms. Remains 404 /1968 variables (removed 1564) and now considering 697/1968 (removed 1271) transitions.
// Phase 1: matrix 697 rows 404 cols
[2023-03-20 11:07:39] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-20 11:07:39] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-20 11:07:39] [INFO ] Invariant cache hit.
[2023-03-20 11:07:40] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
[2023-03-20 11:07:40] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 11:07:40] [INFO ] Invariant cache hit.
[2023-03-20 11:07:40] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/1968 places, 697/1968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1497 ms. Remains : 404/1968 places, 697/1968 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s34 0) (EQ s271 1) (EQ s347 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 23 reset in 490 ms.
Product exploration explored 100000 steps with 30 reset in 554 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 121 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 93 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 74599 steps, run visited all 1 properties in 700 ms. (steps per millisecond=106 )
Probabilistic random walk after 74599 steps, saw 49883 distinct states, run finished after 701 ms. (steps per millisecond=106 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 151 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 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 697/697 transitions.
Applied a total of 0 rules in 13 ms. Remains 404 /404 variables (removed 0) and now considering 697/697 (removed 0) transitions.
[2023-03-20 11:07:43] [INFO ] Invariant cache hit.
[2023-03-20 11:07:43] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-20 11:07:43] [INFO ] Invariant cache hit.
[2023-03-20 11:07:43] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2023-03-20 11:07:43] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 11:07:43] [INFO ] Invariant cache hit.
[2023-03-20 11:07:44] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1148 ms. Remains : 404/404 places, 697/697 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 88 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 44 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Finished probabilistic random walk after 74599 steps, run visited all 1 properties in 642 ms. (steps per millisecond=116 )
Probabilistic random walk after 74599 steps, saw 49883 distinct states, run finished after 643 ms. (steps per millisecond=116 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32 reset in 604 ms.
Product exploration explored 100000 steps with 34 reset in 727 ms.
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 697/697 transitions.
Applied a total of 0 rules in 11 ms. Remains 404 /404 variables (removed 0) and now considering 697/697 (removed 0) transitions.
[2023-03-20 11:07:46] [INFO ] Invariant cache hit.
[2023-03-20 11:07:47] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-20 11:07:47] [INFO ] Invariant cache hit.
[2023-03-20 11:07:47] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2023-03-20 11:07:47] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 11:07:47] [INFO ] Invariant cache hit.
[2023-03-20 11:07:47] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1091 ms. Remains : 404/404 places, 697/697 transitions.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-12 finished in 8953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U (G(!p0)||(!p0&&G(p1)))))))'
Support contains 5 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1955 transition count 1955
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1955 transition count 1955
Applied a total of 26 rules in 191 ms. Remains 1955 /1968 variables (removed 13) and now considering 1955/1968 (removed 13) transitions.
// Phase 1: matrix 1955 rows 1955 cols
[2023-03-20 11:07:48] [INFO ] Computed 201 place invariants in 9 ms
[2023-03-20 11:07:48] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-20 11:07:48] [INFO ] Invariant cache hit.
[2023-03-20 11:07:50] [INFO ] Implicit Places using invariants and state equation in 1465 ms returned []
Implicit Place search using SMT with State Equation took 1896 ms to find 0 implicit places.
[2023-03-20 11:07:50] [INFO ] Invariant cache hit.
[2023-03-20 11:07:51] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1955/1968 places, 1955/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3159 ms. Remains : 1955/1968 places, 1955/1968 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1), p0, p0]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(OR (EQ s1143 0) (EQ s1129 1)), p1:(AND (EQ s250 1) (NOT (OR (EQ s1657 0) (EQ s932 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-13 finished in 3434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F((G(p2)||G(p3)||p1)))))'
Support contains 6 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1953 transition count 1953
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1953 transition count 1953
Applied a total of 30 rules in 315 ms. Remains 1953 /1968 variables (removed 15) and now considering 1953/1968 (removed 15) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-20 11:07:51] [INFO ] Computed 201 place invariants in 9 ms
[2023-03-20 11:07:52] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-20 11:07:52] [INFO ] Invariant cache hit.
[2023-03-20 11:07:53] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 2093 ms to find 0 implicit places.
[2023-03-20 11:07:53] [INFO ] Invariant cache hit.
[2023-03-20 11:07:54] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1968 places, 1953/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3439 ms. Remains : 1953/1968 places, 1953/1968 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s737 0) (EQ s412 1)), p1:(OR (EQ s653 0) (EQ s1554 1)), p2:(OR (EQ s653 0) (EQ s1554 1)), p3:(OR (EQ s662 0) (EQ s499 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1150 ms.
Product exploration explored 100000 steps with 50000 reset in 1248 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 201 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLCardinality-15 finished in 6319 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((F(G(!p0)) U p1))))'
Found a Lengthening insensitive property : ShieldRVt-PT-050B-LTLCardinality-00
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Support contains 4 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 539 transitions
Trivial Post-agglo rules discarded 539 transitions
Performed 539 trivial Post agglomeration. Transition count delta: 539
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 1967 transition count 1428
Reduce places removed 539 places and 0 transitions.
Iterating post reduction 1 with 539 rules applied. Total rules applied 1078 place count 1428 transition count 1428
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 393 Pre rules applied. Total rules applied 1078 place count 1428 transition count 1035
Deduced a syphon composed of 393 places in 2 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1864 place count 1035 transition count 1035
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1878 place count 1021 transition count 1021
Iterating global reduction 2 with 14 rules applied. Total rules applied 1892 place count 1021 transition count 1021
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 1892 place count 1021 transition count 1007
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 1920 place count 1007 transition count 1007
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2818 place count 558 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2819 place count 558 transition count 557
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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2821 place count 557 transition count 556
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3023 place count 456 transition count 656
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3117 place count 409 transition count 702
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3119 place count 407 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3120 place count 406 transition count 700
Applied a total of 3120 rules in 351 ms. Remains 406 /1968 variables (removed 1562) and now considering 700/1968 (removed 1268) transitions.
// Phase 1: matrix 700 rows 406 cols
[2023-03-20 11:07:58] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-20 11:07:58] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-20 11:07:58] [INFO ] Invariant cache hit.
[2023-03-20 11:07:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 11:07:59] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
[2023-03-20 11:07:59] [INFO ] Invariant cache hit.
[2023-03-20 11:07:59] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 406/1968 places, 700/1968 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1500 ms. Remains : 406/1968 places, 700/1968 transitions.
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s134 0) (EQ s308 1)), p0:(OR (EQ s371 0) (EQ s311 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28 reset in 625 ms.
Product exploration explored 100000 steps with 24 reset in 630 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 291 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 11:08:01] [INFO ] Invariant cache hit.
[2023-03-20 11:08:01] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:08:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-20 11:08:01] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:08:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 11:08:01] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 11:08:01] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-20 11:08:01] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 700/700 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 406 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 405 transition count 698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 404 transition count 697
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 404 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 403 transition count 696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 403 transition count 695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 402 transition count 694
Applied a total of 9 rules in 57 ms. Remains 402 /406 variables (removed 4) and now considering 694/700 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 402/406 places, 694/700 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 42492 steps, run visited all 1 properties in 394 ms. (steps per millisecond=107 )
Probabilistic random walk after 42492 steps, saw 31092 distinct states, run finished after 394 ms. (steps per millisecond=107 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 372 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Support contains 4 out of 406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 406/406 places, 700/700 transitions.
Applied a total of 0 rules in 8 ms. Remains 406 /406 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-20 11:08:03] [INFO ] Invariant cache hit.
[2023-03-20 11:08:03] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-20 11:08:03] [INFO ] Invariant cache hit.
[2023-03-20 11:08:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 11:08:03] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2023-03-20 11:08:03] [INFO ] Invariant cache hit.
[2023-03-20 11:08:04] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1086 ms. Remains : 406/406 places, 700/700 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 233 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 11:08:04] [INFO ] Invariant cache hit.
[2023-03-20 11:08:04] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:08:04] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-20 11:08:05] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:08:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 11:08:05] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 11:08:05] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-20 11:08:05] [INFO ] After 386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 700/700 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 406 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 405 transition count 698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 404 transition count 697
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 404 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 403 transition count 696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 403 transition count 695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 402 transition count 694
Applied a total of 9 rules in 49 ms. Remains 402 /406 variables (removed 4) and now considering 694/700 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 402/406 places, 694/700 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished probabilistic random walk after 42492 steps, run visited all 1 properties in 352 ms. (steps per millisecond=120 )
Probabilistic random walk after 42492 steps, saw 31092 distinct states, run finished after 352 ms. (steps per millisecond=120 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Product exploration explored 100000 steps with 24 reset in 570 ms.
Product exploration explored 100000 steps with 28 reset in 609 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Support contains 4 out of 406 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 406/406 places, 700/700 transitions.
Applied a total of 0 rules in 16 ms. Remains 406 /406 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-20 11:08:08] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-20 11:08:08] [INFO ] Invariant cache hit.
[2023-03-20 11:08:08] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 358 ms. Remains : 406/406 places, 700/700 transitions.
Support contains 4 out of 406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 406/406 places, 700/700 transitions.
Applied a total of 0 rules in 7 ms. Remains 406 /406 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-20 11:08:08] [INFO ] Invariant cache hit.
[2023-03-20 11:08:08] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-20 11:08:08] [INFO ] Invariant cache hit.
[2023-03-20 11:08:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 11:08:09] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2023-03-20 11:08:09] [INFO ] Invariant cache hit.
[2023-03-20 11:08:09] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1004 ms. Remains : 406/406 places, 700/700 transitions.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-00 finished in 11767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-20 11:08:09] [INFO ] Flatten gal took : 88 ms
[2023-03-20 11:08:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-20 11:08:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1968 places, 1968 transitions and 4836 arcs took 27 ms.
Total runtime 172369 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1922/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1922/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVt-PT-050B-LTLCardinality-00
Could not compute solution for formula : ShieldRVt-PT-050B-LTLCardinality-12

BK_STOP 1679310491845

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldRVt-PT-050B-LTLCardinality-00
ltl formula formula --ltl=/tmp/1922/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1968 places, 1968 transitions and 4836 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.090 user 0.110 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1922/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1922/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1922/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1922/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldRVt-PT-050B-LTLCardinality-12
ltl formula formula --ltl=/tmp/1922/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1968 places, 1968 transitions and 4836 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1922/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1922/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1922/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.070 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1922/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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