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.r423-tajo-167905976600331.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 lolaxred
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 r423-tajo-167905976600331
=====================================================================

--------------------
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 1679246090973

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:14:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 17:14:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:14:53] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2023-03-19 17:14:53] [INFO ] Transformed 2503 places.
[2023-03-19 17:14:53] [INFO ] Transformed 2503 transitions.
[2023-03-19 17:14:53] [INFO ] Found NUPN structural information;
[2023-03-19 17:14:53] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 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 931 ms. Remains 1968 /2503 variables (removed 535) and now considering 1968/2503 (removed 535) transitions.
// Phase 1: matrix 1968 rows 1968 cols
[2023-03-19 17:14:54] [INFO ] Computed 201 place invariants in 49 ms
[2023-03-19 17:14:55] [INFO ] Implicit Places using invariants in 880 ms returned []
[2023-03-19 17:14:55] [INFO ] Invariant cache hit.
[2023-03-19 17:14:57] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 2687 ms to find 0 implicit places.
[2023-03-19 17:14:57] [INFO ] Invariant cache hit.
[2023-03-19 17:14:58] [INFO ] Dead Transitions using invariants and state equation in 1059 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 4682 ms. Remains : 1968/2503 places, 1968/2503 transitions.
Support contains 36 out of 1968 places after structural reductions.
[2023-03-19 17:14:58] [INFO ] Flatten gal took : 128 ms
[2023-03-19 17:14:58] [INFO ] Flatten gal took : 104 ms
[2023-03-19 17:14:58] [INFO ] Input system was already deterministic with 1968 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 19) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) 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 12) seen :0
Running SMT prover for 12 properties.
[2023-03-19 17:14:59] [INFO ] Invariant cache hit.
[2023-03-19 17:15:00] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 17:15:00] [INFO ] [Nat]Absence check using 201 positive place invariants in 143 ms returned sat
[2023-03-19 17:15:03] [INFO ] After 2425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 17:15:04] [INFO ] Deduced a trap composed of 29 places in 596 ms of which 7 ms to minimize.
[2023-03-19 17:15:04] [INFO ] Deduced a trap composed of 26 places in 505 ms of which 5 ms to minimize.
[2023-03-19 17:15:05] [INFO ] Deduced a trap composed of 29 places in 598 ms of which 3 ms to minimize.
[2023-03-19 17:15:06] [INFO ] Deduced a trap composed of 30 places in 536 ms of which 2 ms to minimize.
[2023-03-19 17:15:06] [INFO ] Deduced a trap composed of 22 places in 512 ms of which 2 ms to minimize.
[2023-03-19 17:15:07] [INFO ] Deduced a trap composed of 23 places in 438 ms of which 1 ms to minimize.
[2023-03-19 17:15:07] [INFO ] Deduced a trap composed of 21 places in 405 ms of which 1 ms to minimize.
[2023-03-19 17:15:08] [INFO ] Deduced a trap composed of 68 places in 418 ms of which 1 ms to minimize.
[2023-03-19 17:15:08] [INFO ] Deduced a trap composed of 67 places in 437 ms of which 1 ms to minimize.
[2023-03-19 17:15:09] [INFO ] Deduced a trap composed of 60 places in 413 ms of which 1 ms to minimize.
[2023-03-19 17:15:09] [INFO ] Deduced a trap composed of 61 places in 399 ms of which 2 ms to minimize.
[2023-03-19 17:15:10] [INFO ] Deduced a trap composed of 54 places in 397 ms of which 1 ms to minimize.
[2023-03-19 17:15:10] [INFO ] Deduced a trap composed of 57 places in 343 ms of which 1 ms to minimize.
[2023-03-19 17:15:11] [INFO ] Deduced a trap composed of 57 places in 376 ms of which 2 ms to minimize.
[2023-03-19 17:15:11] [INFO ] Deduced a trap composed of 58 places in 353 ms of which 1 ms to minimize.
[2023-03-19 17:15:12] [INFO ] Deduced a trap composed of 62 places in 342 ms of which 1 ms to minimize.
[2023-03-19 17:15:12] [INFO ] Deduced a trap composed of 62 places in 335 ms of which 1 ms to minimize.
[2023-03-19 17:15:12] [INFO ] Deduced a trap composed of 68 places in 329 ms of which 1 ms to minimize.
[2023-03-19 17:15:13] [INFO ] Deduced a trap composed of 68 places in 313 ms of which 1 ms to minimize.
[2023-03-19 17:15:13] [INFO ] Deduced a trap composed of 68 places in 323 ms of which 1 ms to minimize.
[2023-03-19 17:15:13] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 10015 ms
[2023-03-19 17:15:14] [INFO ] Deduced a trap composed of 62 places in 345 ms of which 1 ms to minimize.
[2023-03-19 17:15:14] [INFO ] Deduced a trap composed of 48 places in 337 ms of which 1 ms to minimize.
[2023-03-19 17:15:15] [INFO ] Deduced a trap composed of 45 places in 334 ms of which 1 ms to minimize.
[2023-03-19 17:15:15] [INFO ] Deduced a trap composed of 49 places in 352 ms of which 1 ms to minimize.
[2023-03-19 17:15:15] [INFO ] Deduced a trap composed of 58 places in 333 ms of which 1 ms to minimize.
[2023-03-19 17:15:16] [INFO ] Deduced a trap composed of 68 places in 323 ms of which 1 ms to minimize.
[2023-03-19 17:15:16] [INFO ] Deduced a trap composed of 45 places in 324 ms of which 1 ms to minimize.
[2023-03-19 17:15:17] [INFO ] Deduced a trap composed of 45 places in 321 ms of which 1 ms to minimize.
[2023-03-19 17:15:17] [INFO ] Deduced a trap composed of 56 places in 296 ms of which 1 ms to minimize.
[2023-03-19 17:15:18] [INFO ] Deduced a trap composed of 54 places in 335 ms of which 1 ms to minimize.
[2023-03-19 17:15:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4389 ms
[2023-03-19 17:15:18] [INFO ] Deduced a trap composed of 40 places in 333 ms of which 1 ms to minimize.
[2023-03-19 17:15:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 508 ms
[2023-03-19 17:15:19] [INFO ] Deduced a trap composed of 43 places in 369 ms of which 1 ms to minimize.
[2023-03-19 17:15:20] [INFO ] Deduced a trap composed of 44 places in 535 ms of which 2 ms to minimize.
[2023-03-19 17:15:20] [INFO ] Deduced a trap composed of 50 places in 342 ms of which 2 ms to minimize.
[2023-03-19 17:15:21] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 1 ms to minimize.
[2023-03-19 17:15:21] [INFO ] Deduced a trap composed of 51 places in 369 ms of which 2 ms to minimize.
[2023-03-19 17:15:22] [INFO ] Deduced a trap composed of 44 places in 313 ms of which 1 ms to minimize.
[2023-03-19 17:15:22] [INFO ] Deduced a trap composed of 43 places in 397 ms of which 1 ms to minimize.
[2023-03-19 17:15:22] [INFO ] Deduced a trap composed of 48 places in 361 ms of which 1 ms to minimize.
[2023-03-19 17:15:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3712 ms
[2023-03-19 17:15:23] [INFO ] Deduced a trap composed of 22 places in 320 ms of which 2 ms to minimize.
[2023-03-19 17:15:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 498 ms
[2023-03-19 17:15:24] [INFO ] Deduced a trap composed of 43 places in 307 ms of which 1 ms to minimize.
[2023-03-19 17:15:24] [INFO ] Deduced a trap composed of 35 places in 377 ms of which 2 ms to minimize.
[2023-03-19 17:15:25] [INFO ] Deduced a trap composed of 38 places in 352 ms of which 1 ms to minimize.
[2023-03-19 17:15:25] [INFO ] Deduced a trap composed of 35 places in 360 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-19 17:15:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 17:15:25] [INFO ] After 25284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Parikh walk visited 0 properties in 780 ms.
Support contains 24 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 2 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 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1850 place count 1041 transition count 1041
Iterating global reduction 3 with 4 rules applied. Total rules applied 1854 place count 1041 transition count 1041
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1854 place count 1041 transition count 1038
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1860 place count 1038 transition count 1038
Performed 460 Post agglomeration using F-continuation condition.Transition count delta: 460
Deduced a syphon composed of 460 places in 1 ms
Reduce places removed 460 places and 0 transitions.
Iterating global reduction 3 with 920 rules applied. Total rules applied 2780 place count 578 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2781 place count 578 transition count 577
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 2783 place count 577 transition count 576
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -92
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 2985 place count 476 transition count 668
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -38
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 3069 place count 434 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 3070 place count 434 transition count 705
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3071 place count 434 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3072 place count 433 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 3073 place count 433 transition count 703
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3074 place count 432 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3075 place count 431 transition count 702
Applied a total of 3075 rules in 782 ms. Remains 431 /1968 variables (removed 1537) and now considering 702/1968 (removed 1266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 782 ms. Remains : 431/1968 places, 702/1968 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 112591 steps, run timeout after 3007 ms. (steps per millisecond=37 ) properties seen :{2=1, 6=1, 8=1}
Probabilistic random walk after 112591 steps, saw 69717 distinct states, run finished after 3010 ms. (steps per millisecond=37 ) properties seen :3
Running SMT prover for 8 properties.
// Phase 1: matrix 702 rows 431 cols
[2023-03-19 17:15:31] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-19 17:15:31] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 17:15:31] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2023-03-19 17:15:31] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 17:15:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 17:15:31] [INFO ] After 209ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-19 17:15:32] [INFO ] After 482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-19 17:15:32] [INFO ] After 1116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 181 ms.
Support contains 17 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 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 431 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 430 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 430 transition count 699
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 428 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 427 transition count 698
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 427 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 10 place count 426 transition count 697
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 423 transition count 699
Applied a total of 16 rules in 37 ms. Remains 423 /431 variables (removed 8) and now considering 699/702 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 423/431 places, 699/702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) 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 8) seen :0
Finished probabilistic random walk after 141185 steps, run visited all 8 properties in 2404 ms. (steps per millisecond=58 )
Probabilistic random walk after 141185 steps, saw 87159 distinct states, run finished after 2405 ms. (steps per millisecond=58 ) properties seen :8
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 179 ms. Remains 1954 /1968 variables (removed 14) and now considering 1954/1968 (removed 14) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2023-03-19 17:15:36] [INFO ] Computed 201 place invariants in 15 ms
[2023-03-19 17:15:36] [INFO ] Implicit Places using invariants in 513 ms returned []
[2023-03-19 17:15:36] [INFO ] Invariant cache hit.
[2023-03-19 17:15:39] [INFO ] Implicit Places using invariants and state equation in 2633 ms returned []
Implicit Place search using SMT with State Equation took 3167 ms to find 0 implicit places.
[2023-03-19 17:15:39] [INFO ] Invariant cache hit.
[2023-03-19 17:15:40] [INFO ] Dead Transitions using invariants and state equation in 1100 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 4451 ms. Remains : 1954/1968 places, 1954/1968 transitions.
Stuttering acceptance computed with spot in 465 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 3 reset in 795 ms.
Product exploration explored 100000 steps with 0 reset in 661 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 286 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 220 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:15:42] [INFO ] Invariant cache hit.
[2023-03-19 17:15:43] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:15:43] [INFO ] [Nat]Absence check using 201 positive place invariants in 61 ms returned sat
[2023-03-19 17:15:44] [INFO ] After 1052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:15:45] [INFO ] Deduced a trap composed of 33 places in 455 ms of which 1 ms to minimize.
[2023-03-19 17:15:45] [INFO ] Deduced a trap composed of 45 places in 513 ms of which 1 ms to minimize.
[2023-03-19 17:15:46] [INFO ] Deduced a trap composed of 29 places in 515 ms of which 2 ms to minimize.
[2023-03-19 17:15:47] [INFO ] Deduced a trap composed of 22 places in 508 ms of which 2 ms to minimize.
[2023-03-19 17:15:47] [INFO ] Deduced a trap composed of 25 places in 510 ms of which 2 ms to minimize.
[2023-03-19 17:15:48] [INFO ] Deduced a trap composed of 52 places in 504 ms of which 3 ms to minimize.
[2023-03-19 17:15:48] [INFO ] Deduced a trap composed of 26 places in 509 ms of which 1 ms to minimize.
[2023-03-19 17:15:49] [INFO ] Deduced a trap composed of 53 places in 472 ms of which 2 ms to minimize.
[2023-03-19 17:15:49] [INFO ] Deduced a trap composed of 37 places in 491 ms of which 1 ms to minimize.
[2023-03-19 17:15:50] [INFO ] Deduced a trap composed of 33 places in 477 ms of which 2 ms to minimize.
[2023-03-19 17:15:51] [INFO ] Deduced a trap composed of 47 places in 504 ms of which 6 ms to minimize.
[2023-03-19 17:15:51] [INFO ] Deduced a trap composed of 28 places in 465 ms of which 1 ms to minimize.
[2023-03-19 17:15:52] [INFO ] Deduced a trap composed of 24 places in 459 ms of which 1 ms to minimize.
[2023-03-19 17:15:52] [INFO ] Deduced a trap composed of 32 places in 447 ms of which 1 ms to minimize.
[2023-03-19 17:15:53] [INFO ] Deduced a trap composed of 24 places in 443 ms of which 1 ms to minimize.
[2023-03-19 17:15:53] [INFO ] Deduced a trap composed of 21 places in 420 ms of which 1 ms to minimize.
[2023-03-19 17:15:54] [INFO ] Deduced a trap composed of 38 places in 425 ms of which 1 ms to minimize.
[2023-03-19 17:15:54] [INFO ] Deduced a trap composed of 42 places in 395 ms of which 1 ms to minimize.
[2023-03-19 17:15:55] [INFO ] Deduced a trap composed of 41 places in 409 ms of which 1 ms to minimize.
[2023-03-19 17:15:55] [INFO ] Deduced a trap composed of 44 places in 321 ms of which 1 ms to minimize.
[2023-03-19 17:15:55] [INFO ] Deduced a trap composed of 31 places in 366 ms of which 1 ms to minimize.
[2023-03-19 17:15:56] [INFO ] Deduced a trap composed of 35 places in 361 ms of which 3 ms to minimize.
[2023-03-19 17:15:56] [INFO ] Deduced a trap composed of 25 places in 353 ms of which 3 ms to minimize.
[2023-03-19 17:15:57] [INFO ] Deduced a trap composed of 36 places in 432 ms of which 3 ms to minimize.
[2023-03-19 17:15:57] [INFO ] Deduced a trap composed of 26 places in 377 ms of which 1 ms to minimize.
[2023-03-19 17:15:58] [INFO ] Deduced a trap composed of 27 places in 413 ms of which 1 ms to minimize.
[2023-03-19 17:15:58] [INFO ] Deduced a trap composed of 52 places in 371 ms of which 1 ms to minimize.
[2023-03-19 17:15:59] [INFO ] Deduced a trap composed of 51 places in 407 ms of which 1 ms to minimize.
[2023-03-19 17:15:59] [INFO ] Deduced a trap composed of 45 places in 365 ms of which 1 ms to minimize.
[2023-03-19 17:16:00] [INFO ] Deduced a trap composed of 71 places in 399 ms of which 1 ms to minimize.
[2023-03-19 17:16:00] [INFO ] Deduced a trap composed of 65 places in 335 ms of which 1 ms to minimize.
[2023-03-19 17:16:00] [INFO ] Deduced a trap composed of 48 places in 361 ms of which 1 ms to minimize.
[2023-03-19 17:16:01] [INFO ] Deduced a trap composed of 67 places in 348 ms of which 1 ms to minimize.
[2023-03-19 17:16:01] [INFO ] Deduced a trap composed of 71 places in 332 ms of which 1 ms to minimize.
[2023-03-19 17:16:02] [INFO ] Deduced a trap composed of 73 places in 336 ms of which 0 ms to minimize.
[2023-03-19 17:16:02] [INFO ] Deduced a trap composed of 76 places in 321 ms of which 1 ms to minimize.
[2023-03-19 17:16:02] [INFO ] Deduced a trap composed of 58 places in 326 ms of which 1 ms to minimize.
[2023-03-19 17:16:03] [INFO ] Deduced a trap composed of 61 places in 329 ms of which 1 ms to minimize.
[2023-03-19 17:16:03] [INFO ] Deduced a trap composed of 69 places in 318 ms of which 1 ms to minimize.
[2023-03-19 17:16:04] [INFO ] Deduced a trap composed of 60 places in 327 ms of which 1 ms to minimize.
[2023-03-19 17:16:04] [INFO ] Deduced a trap composed of 61 places in 306 ms of which 1 ms to minimize.
[2023-03-19 17:16:04] [INFO ] Deduced a trap composed of 45 places in 313 ms of which 1 ms to minimize.
[2023-03-19 17:16:05] [INFO ] Deduced a trap composed of 54 places in 287 ms of which 1 ms to minimize.
[2023-03-19 17:16:05] [INFO ] Deduced a trap composed of 74 places in 252 ms of which 1 ms to minimize.
[2023-03-19 17:16:05] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 21066 ms
[2023-03-19 17:16:05] [INFO ] After 22196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-19 17:16:05] [INFO ] After 22689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 57 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 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 541 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 541 ms. Remains : 402/1954 places, 694/1954 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 403299 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403299 steps, saw 259030 distinct states, run finished after 3002 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 694 rows 402 cols
[2023-03-19 17:16:09] [INFO ] Computed 200 place invariants in 15 ms
[2023-03-19 17:16:09] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:16:09] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2023-03-19 17:16:10] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:16:10] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-19 17:16:10] [INFO ] After 394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 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 15 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 15 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 14 ms. Remains 402 /402 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2023-03-19 17:16:10] [INFO ] Invariant cache hit.
[2023-03-19 17:16:10] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-19 17:16:10] [INFO ] Invariant cache hit.
[2023-03-19 17:16:10] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-19 17:16:10] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-19 17:16:10] [INFO ] Invariant cache hit.
[2023-03-19 17:16:11] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1041 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 3 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.7 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 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 1 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 1 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 1 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 1 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 1 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 1 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 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 1 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 1 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 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 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 1 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 1 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 1 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 142 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-19 17:16:11] [INFO ] Computed 66 place invariants in 2 ms
[2023-03-19 17:16:11] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:16:11] [INFO ] [Nat]Absence check using 66 positive place invariants in 7 ms returned sat
[2023-03-19 17:16:11] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:16:11] [INFO ] After 61ms 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-19 17:16:11] [INFO ] After 116ms 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 151 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 173 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 222 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 135 ms. Remains 1954 /1954 variables (removed 0) and now considering 1954/1954 (removed 0) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2023-03-19 17:16:12] [INFO ] Computed 201 place invariants in 17 ms
[2023-03-19 17:16:12] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-19 17:16:12] [INFO ] Invariant cache hit.
[2023-03-19 17:16:14] [INFO ] Implicit Places using invariants and state equation in 1710 ms returned []
Implicit Place search using SMT with State Equation took 2299 ms to find 0 implicit places.
[2023-03-19 17:16:14] [INFO ] Invariant cache hit.
[2023-03-19 17:16:15] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3358 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 207 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 217 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) 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-19 17:16:16] [INFO ] Invariant cache hit.
[2023-03-19 17:16:16] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:16:16] [INFO ] [Nat]Absence check using 201 positive place invariants in 78 ms returned sat
[2023-03-19 17:16:17] [INFO ] After 943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:16:18] [INFO ] Deduced a trap composed of 33 places in 472 ms of which 1 ms to minimize.
[2023-03-19 17:16:18] [INFO ] Deduced a trap composed of 45 places in 491 ms of which 1 ms to minimize.
[2023-03-19 17:16:19] [INFO ] Deduced a trap composed of 29 places in 497 ms of which 1 ms to minimize.
[2023-03-19 17:16:19] [INFO ] Deduced a trap composed of 22 places in 505 ms of which 1 ms to minimize.
[2023-03-19 17:16:20] [INFO ] Deduced a trap composed of 25 places in 489 ms of which 1 ms to minimize.
[2023-03-19 17:16:21] [INFO ] Deduced a trap composed of 52 places in 565 ms of which 2 ms to minimize.
[2023-03-19 17:16:21] [INFO ] Deduced a trap composed of 26 places in 490 ms of which 1 ms to minimize.
[2023-03-19 17:16:22] [INFO ] Deduced a trap composed of 53 places in 440 ms of which 2 ms to minimize.
[2023-03-19 17:16:22] [INFO ] Deduced a trap composed of 37 places in 494 ms of which 1 ms to minimize.
[2023-03-19 17:16:23] [INFO ] Deduced a trap composed of 33 places in 480 ms of which 1 ms to minimize.
[2023-03-19 17:16:24] [INFO ] Deduced a trap composed of 47 places in 478 ms of which 1 ms to minimize.
[2023-03-19 17:16:24] [INFO ] Deduced a trap composed of 28 places in 423 ms of which 1 ms to minimize.
[2023-03-19 17:16:25] [INFO ] Deduced a trap composed of 24 places in 489 ms of which 2 ms to minimize.
[2023-03-19 17:16:25] [INFO ] Deduced a trap composed of 32 places in 446 ms of which 1 ms to minimize.
[2023-03-19 17:16:26] [INFO ] Deduced a trap composed of 24 places in 438 ms of which 2 ms to minimize.
[2023-03-19 17:16:26] [INFO ] Deduced a trap composed of 21 places in 444 ms of which 2 ms to minimize.
[2023-03-19 17:16:27] [INFO ] Deduced a trap composed of 38 places in 437 ms of which 1 ms to minimize.
[2023-03-19 17:16:27] [INFO ] Deduced a trap composed of 42 places in 412 ms of which 1 ms to minimize.
[2023-03-19 17:16:28] [INFO ] Deduced a trap composed of 41 places in 422 ms of which 2 ms to minimize.
[2023-03-19 17:16:28] [INFO ] Deduced a trap composed of 44 places in 410 ms of which 1 ms to minimize.
[2023-03-19 17:16:29] [INFO ] Deduced a trap composed of 31 places in 405 ms of which 1 ms to minimize.
[2023-03-19 17:16:29] [INFO ] Deduced a trap composed of 35 places in 385 ms of which 1 ms to minimize.
[2023-03-19 17:16:30] [INFO ] Deduced a trap composed of 25 places in 372 ms of which 1 ms to minimize.
[2023-03-19 17:16:30] [INFO ] Deduced a trap composed of 36 places in 399 ms of which 1 ms to minimize.
[2023-03-19 17:16:31] [INFO ] Deduced a trap composed of 26 places in 394 ms of which 1 ms to minimize.
[2023-03-19 17:16:31] [INFO ] Deduced a trap composed of 27 places in 377 ms of which 1 ms to minimize.
[2023-03-19 17:16:32] [INFO ] Deduced a trap composed of 52 places in 426 ms of which 1 ms to minimize.
[2023-03-19 17:16:32] [INFO ] Deduced a trap composed of 51 places in 394 ms of which 2 ms to minimize.
[2023-03-19 17:16:32] [INFO ] Deduced a trap composed of 45 places in 351 ms of which 1 ms to minimize.
[2023-03-19 17:16:33] [INFO ] Deduced a trap composed of 71 places in 348 ms of which 1 ms to minimize.
[2023-03-19 17:16:33] [INFO ] Deduced a trap composed of 65 places in 370 ms of which 2 ms to minimize.
[2023-03-19 17:16:34] [INFO ] Deduced a trap composed of 48 places in 364 ms of which 1 ms to minimize.
[2023-03-19 17:16:34] [INFO ] Deduced a trap composed of 67 places in 346 ms of which 2 ms to minimize.
[2023-03-19 17:16:35] [INFO ] Deduced a trap composed of 71 places in 332 ms of which 1 ms to minimize.
[2023-03-19 17:16:35] [INFO ] Deduced a trap composed of 73 places in 342 ms of which 1 ms to minimize.
[2023-03-19 17:16:35] [INFO ] Deduced a trap composed of 76 places in 337 ms of which 1 ms to minimize.
[2023-03-19 17:16:36] [INFO ] Deduced a trap composed of 58 places in 327 ms of which 1 ms to minimize.
[2023-03-19 17:16:36] [INFO ] Deduced a trap composed of 61 places in 316 ms of which 2 ms to minimize.
[2023-03-19 17:16:37] [INFO ] Deduced a trap composed of 69 places in 312 ms of which 1 ms to minimize.
[2023-03-19 17:16:37] [INFO ] Deduced a trap composed of 60 places in 305 ms of which 1 ms to minimize.
[2023-03-19 17:16:37] [INFO ] Deduced a trap composed of 61 places in 301 ms of which 1 ms to minimize.
[2023-03-19 17:16:38] [INFO ] Deduced a trap composed of 45 places in 300 ms of which 1 ms to minimize.
[2023-03-19 17:16:38] [INFO ] Deduced a trap composed of 54 places in 290 ms of which 1 ms to minimize.
[2023-03-19 17:16:39] [INFO ] Deduced a trap composed of 74 places in 282 ms of which 2 ms to minimize.
[2023-03-19 17:16:39] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 21486 ms
[2023-03-19 17:16:39] [INFO ] After 22506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-19 17:16:39] [INFO ] After 23035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 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 1 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 298 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 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 411257 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 411257 steps, saw 264303 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 694 rows 402 cols
[2023-03-19 17:16:42] [INFO ] Computed 200 place invariants in 6 ms
[2023-03-19 17:16:42] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:16:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-19 17:16:43] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:16:43] [INFO ] After 244ms 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-19 17:16:43] [INFO ] After 352ms 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 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-19 17:16:43] [INFO ] Invariant cache hit.
[2023-03-19 17:16:43] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-19 17:16:43] [INFO ] Invariant cache hit.
[2023-03-19 17:16:44] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
[2023-03-19 17:16:44] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-19 17:16:44] [INFO ] Invariant cache hit.
[2023-03-19 17:16:44] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1112 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 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 1 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 1 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 1 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 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 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 1 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 1 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 100 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-19 17:16:44] [INFO ] Computed 66 place invariants in 1 ms
[2023-03-19 17:16:44] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:16:44] [INFO ] [Nat]Absence check using 66 positive place invariants in 8 ms returned sat
[2023-03-19 17:16:44] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:16:44] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-19 17:16:44] [INFO ] After 122ms 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 222 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 188 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 551 ms.
Product exploration explored 100000 steps with 0 reset in 757 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 240 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 4 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 3 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 3 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 2 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 2 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 2 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 1 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 0 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 0 ms
Applied a total of 2750 rules in 1479 ms. Remains 1354 /1954 variables (removed 600) and now considering 2779/1954 (removed -825) transitions.
[2023-03-19 17:16:48] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 2779 rows 1354 cols
[2023-03-19 17:16:48] [INFO ] Computed 201 place invariants in 28 ms
[2023-03-19 17:16:50] [INFO ] Dead Transitions using invariants and state equation in 1607 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 3156 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 104 ms. Remains 1954 /1954 variables (removed 0) and now considering 1954/1954 (removed 0) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2023-03-19 17:16:50] [INFO ] Computed 201 place invariants in 8 ms
[2023-03-19 17:16:51] [INFO ] Implicit Places using invariants in 733 ms returned []
[2023-03-19 17:16:51] [INFO ] Invariant cache hit.
[2023-03-19 17:16:53] [INFO ] Implicit Places using invariants and state equation in 2782 ms returned []
Implicit Place search using SMT with State Equation took 3529 ms to find 0 implicit places.
[2023-03-19 17:16:53] [INFO ] Invariant cache hit.
[2023-03-19 17:16:55] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4753 ms. Remains : 1954/1954 places, 1954/1954 transitions.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-00 finished in 79562 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 2 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 2 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 1 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 383 ms. Remains 402 /1968 variables (removed 1566) and now considering 698/1968 (removed 1270) transitions.
// Phase 1: matrix 698 rows 402 cols
[2023-03-19 17:16:55] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-19 17:17:06] [INFO ] Implicit Places using invariants in 10838 ms returned []
[2023-03-19 17:17:06] [INFO ] Invariant cache hit.
[2023-03-19 17:17:07] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 11434 ms to find 0 implicit places.
[2023-03-19 17:17:07] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 17:17:07] [INFO ] Invariant cache hit.
[2023-03-19 17:17:07] [INFO ] Dead Transitions using invariants and state equation in 319 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 12155 ms. Remains : 402/1968 places, 698/1968 transitions.
Stuttering acceptance computed with spot in 35 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 12226 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 264 ms. Remains 1952 /1968 variables (removed 16) and now considering 1952/1968 (removed 16) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2023-03-19 17:17:07] [INFO ] Computed 201 place invariants in 7 ms
[2023-03-19 17:17:08] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-19 17:17:08] [INFO ] Invariant cache hit.
[2023-03-19 17:17:09] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 2083 ms to find 0 implicit places.
[2023-03-19 17:17:09] [INFO ] Invariant cache hit.
[2023-03-19 17:17:10] [INFO ] Dead Transitions using invariants and state equation in 935 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 3285 ms. Remains : 1952/1968 places, 1952/1968 transitions.
Stuttering acceptance computed with spot in 208 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 978 steps with 0 reset in 10 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-04 finished in 3528 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 245 ms. Remains 1953 /1968 variables (removed 15) and now considering 1953/1968 (removed 15) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-19 17:17:11] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-19 17:17:11] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-19 17:17:11] [INFO ] Invariant cache hit.
[2023-03-19 17:17:13] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 1973 ms to find 0 implicit places.
[2023-03-19 17:17:13] [INFO ] Invariant cache hit.
[2023-03-19 17:17:14] [INFO ] Dead Transitions using invariants and state equation in 1207 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 3427 ms. Remains : 1953/1968 places, 1953/1968 transitions.
Stuttering acceptance computed with spot in 260 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 67412 steps with 0 reset in 404 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-06 finished in 4139 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 193 ms. Remains 1953 /1968 variables (removed 15) and now considering 1953/1968 (removed 15) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-19 17:17:15] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-19 17:17:16] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-03-19 17:17:16] [INFO ] Invariant cache hit.
[2023-03-19 17:17:17] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
[2023-03-19 17:17:17] [INFO ] Invariant cache hit.
[2023-03-19 17:17:18] [INFO ] Dead Transitions using invariants and state equation in 964 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 3117 ms. Remains : 1953/1968 places, 1953/1968 transitions.
Stuttering acceptance computed with spot in 259 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]]
Stuttering criterion allowed to conclude after 96194 steps with 22 reset in 614 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-10 finished in 4032 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 2 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 0 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 214 ms. Remains 404 /1968 variables (removed 1564) and now considering 697/1968 (removed 1271) transitions.
// Phase 1: matrix 697 rows 404 cols
[2023-03-19 17:17:19] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-19 17:17:19] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-19 17:17:19] [INFO ] Invariant cache hit.
[2023-03-19 17:17:20] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2023-03-19 17:17:20] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:17:20] [INFO ] Invariant cache hit.
[2023-03-19 17:17:20] [INFO ] Dead Transitions using invariants and state equation in 427 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 1384 ms. Remains : 404/1968 places, 697/1968 transitions.
Stuttering acceptance computed with spot in 54 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 24 reset in 484 ms.
Product exploration explored 100000 steps with 18 reset in 511 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 176 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 104 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished probabilistic random walk after 74599 steps, run visited all 1 properties in 523 ms. (steps per millisecond=142 )
Probabilistic random walk after 74599 steps, saw 49883 distinct states, run finished after 523 ms. (steps per millisecond=142 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 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 18 ms. Remains 404 /404 variables (removed 0) and now considering 697/697 (removed 0) transitions.
[2023-03-19 17:17:23] [INFO ] Invariant cache hit.
[2023-03-19 17:17:23] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-19 17:17:23] [INFO ] Invariant cache hit.
[2023-03-19 17:17:23] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
[2023-03-19 17:17:23] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-19 17:17:23] [INFO ] Invariant cache hit.
[2023-03-19 17:17:24] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1208 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 104 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 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Finished probabilistic random walk after 74599 steps, run visited all 1 properties in 752 ms. (steps per millisecond=99 )
Probabilistic random walk after 74599 steps, saw 49883 distinct states, run finished after 752 ms. (steps per millisecond=99 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 174 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 35 reset in 737 ms.
Product exploration explored 100000 steps with 19 reset in 620 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 10 ms. Remains 404 /404 variables (removed 0) and now considering 697/697 (removed 0) transitions.
[2023-03-19 17:17:27] [INFO ] Invariant cache hit.
[2023-03-19 17:17:27] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-19 17:17:27] [INFO ] Invariant cache hit.
[2023-03-19 17:17:28] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
[2023-03-19 17:17:28] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 17:17:28] [INFO ] Invariant cache hit.
[2023-03-19 17:17:28] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1428 ms. Remains : 404/404 places, 697/697 transitions.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-12 finished in 9416 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 171 ms. Remains 1955 /1968 variables (removed 13) and now considering 1955/1968 (removed 13) transitions.
// Phase 1: matrix 1955 rows 1955 cols
[2023-03-19 17:17:28] [INFO ] Computed 201 place invariants in 10 ms
[2023-03-19 17:17:29] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-19 17:17:29] [INFO ] Invariant cache hit.
[2023-03-19 17:17:31] [INFO ] Implicit Places using invariants and state equation in 1548 ms returned []
Implicit Place search using SMT with State Equation took 2108 ms to find 0 implicit places.
[2023-03-19 17:17:31] [INFO ] Invariant cache hit.
[2023-03-19 17:17:31] [INFO ] Dead Transitions using invariants and state equation in 930 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 3226 ms. Remains : 1955/1968 places, 1955/1968 transitions.
Stuttering acceptance computed with spot in 245 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 3507 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 222 ms. Remains 1953 /1968 variables (removed 15) and now considering 1953/1968 (removed 15) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-19 17:17:32] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-19 17:17:33] [INFO ] Implicit Places using invariants in 539 ms returned []
[2023-03-19 17:17:33] [INFO ] Invariant cache hit.
[2023-03-19 17:17:35] [INFO ] Implicit Places using invariants and state equation in 2364 ms returned []
Implicit Place search using SMT with State Equation took 2909 ms to find 0 implicit places.
[2023-03-19 17:17:35] [INFO ] Invariant cache hit.
[2023-03-19 17:17:36] [INFO ] Dead Transitions using invariants and state equation in 1201 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 4339 ms. Remains : 1953/1968 places, 1953/1968 transitions.
Stuttering acceptance computed with spot in 228 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 1287 ms.
Product exploration explored 100000 steps with 50000 reset in 1326 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 166 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 7412 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 172 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 1 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 462 ms. Remains 406 /1968 variables (removed 1562) and now considering 700/1968 (removed 1268) transitions.
// Phase 1: matrix 700 rows 406 cols
[2023-03-19 17:17:40] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-19 17:17:40] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-19 17:17:40] [INFO ] Invariant cache hit.
[2023-03-19 17:17:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:17:41] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
[2023-03-19 17:17:41] [INFO ] Invariant cache hit.
[2023-03-19 17:17:41] [INFO ] Dead Transitions using invariants and state equation in 316 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 1814 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 23 reset in 616 ms.
Product exploration explored 100000 steps with 22 reset in 776 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 386 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 220 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 144 ms. (steps per millisecond=69 ) 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-19 17:17:43] [INFO ] Invariant cache hit.
[2023-03-19 17:17:44] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:17:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-19 17:17:44] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:17:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:17:44] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:17:44] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-19 17:17:44] [INFO ] After 476ms 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 54 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 54 ms. Remains : 402/406 places, 694/700 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 60 ms. (steps per millisecond=166 ) 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 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 294 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 129 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 127 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 10 ms. Remains 406 /406 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-19 17:17:45] [INFO ] Invariant cache hit.
[2023-03-19 17:17:46] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-19 17:17:46] [INFO ] Invariant cache hit.
[2023-03-19 17:17:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:17:46] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
[2023-03-19 17:17:46] [INFO ] Invariant cache hit.
[2023-03-19 17:17:47] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1538 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 278 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 217 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) 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-19 17:17:47] [INFO ] Invariant cache hit.
[2023-03-19 17:17:47] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:17:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 46 ms returned sat
[2023-03-19 17:17:48] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:17:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:17:48] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:17:48] [INFO ] After 47ms 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-19 17:17:48] [INFO ] After 478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 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 98 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 99 ms. Remains : 402/406 places, 694/700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) 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
Finished probabilistic random walk after 42492 steps, run visited all 1 properties in 467 ms. (steps per millisecond=90 )
Probabilistic random walk after 42492 steps, saw 31092 distinct states, run finished after 467 ms. (steps per millisecond=90 ) 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 286 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 166 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Product exploration explored 100000 steps with 28 reset in 497 ms.
Product exploration explored 100000 steps with 23 reset in 613 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 217 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 10 ms. Remains 406 /406 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-19 17:17:51] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:17:51] [INFO ] Invariant cache hit.
[2023-03-19 17:17:51] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 507 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 6 ms. Remains 406 /406 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-19 17:17:51] [INFO ] Invariant cache hit.
[2023-03-19 17:17:52] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-19 17:17:52] [INFO ] Invariant cache hit.
[2023-03-19 17:17:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:17:52] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
[2023-03-19 17:17:52] [INFO ] Invariant cache hit.
[2023-03-19 17:17:53] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1408 ms. Remains : 406/406 places, 700/700 transitions.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-00 finished in 13768 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-19 17:17:53] [INFO ] Flatten gal took : 98 ms
[2023-03-19 17:17:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-19 17:17:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1968 places, 1968 transitions and 4836 arcs took 24 ms.
Total runtime 180561 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-050B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
LTLCardinality

BK_STOP 1679246494665

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 11/32 ShieldRVt-PT-050B-LTLCardinality-12 754596 m, 150919 m/sec, 1389860 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 22/32 ShieldRVt-PT-050B-LTLCardinality-12 1497563 m, 148593 m/sec, 2753366 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 31/32 ShieldRVt-PT-050B-LTLCardinality-12 2182842 m, 137055 m/sec, 4021808 t fired, .

Time elapsed: 15 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for ShieldRVt-PT-050B-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldRVt-PT-050B-LTLCardinality-00
lola: time limit : 3580 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3580 5/32 ShieldRVt-PT-050B-LTLCardinality-00 141109 m, 28221 m/sec, 495923 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3580 7/32 ShieldRVt-PT-050B-LTLCardinality-00 271631 m, 26104 m/sec, 992064 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3580 8/32 ShieldRVt-PT-050B-LTLCardinality-00 386883 m, 23050 m/sec, 1484575 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3580 9/32 ShieldRVt-PT-050B-LTLCardinality-00 493159 m, 21255 m/sec, 1990733 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3580 10/32 ShieldRVt-PT-050B-LTLCardinality-00 597136 m, 20795 m/sec, 2489887 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3580 11/32 ShieldRVt-PT-050B-LTLCardinality-00 707130 m, 21998 m/sec, 2985283 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3580 11/32 ShieldRVt-PT-050B-LTLCardinality-00 821643 m, 22902 m/sec, 3531213 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3580 12/32 ShieldRVt-PT-050B-LTLCardinality-00 937728 m, 23217 m/sec, 4102509 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3580 13/32 ShieldRVt-PT-050B-LTLCardinality-00 1041187 m, 20691 m/sec, 4693096 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3580 14/32 ShieldRVt-PT-050B-LTLCardinality-00 1142593 m, 20281 m/sec, 5280493 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3580 14/32 ShieldRVt-PT-050B-LTLCardinality-00 1252433 m, 21968 m/sec, 5837444 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3580 15/32 ShieldRVt-PT-050B-LTLCardinality-00 1358577 m, 21228 m/sec, 6343180 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3580 16/32 ShieldRVt-PT-050B-LTLCardinality-00 1463890 m, 21062 m/sec, 6844782 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3580 16/32 ShieldRVt-PT-050B-LTLCardinality-00 1577166 m, 22655 m/sec, 7358871 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3580 17/32 ShieldRVt-PT-050B-LTLCardinality-00 1681582 m, 20883 m/sec, 7858055 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3580 18/32 ShieldRVt-PT-050B-LTLCardinality-00 1792815 m, 22246 m/sec, 8389310 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3580 19/32 ShieldRVt-PT-050B-LTLCardinality-00 1884750 m, 18387 m/sec, 8886507 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3580 19/32 ShieldRVt-PT-050B-LTLCardinality-00 1976091 m, 18268 m/sec, 9414028 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3580 20/32 ShieldRVt-PT-050B-LTLCardinality-00 2066828 m, 18147 m/sec, 9938566 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3580 20/32 ShieldRVt-PT-050B-LTLCardinality-00 2163096 m, 19253 m/sec, 10466468 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3580 21/32 ShieldRVt-PT-050B-LTLCardinality-00 2258521 m, 19085 m/sec, 11019019 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/3580 22/32 ShieldRVt-PT-050B-LTLCardinality-00 2353059 m, 18907 m/sec, 11561380 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/3580 22/32 ShieldRVt-PT-050B-LTLCardinality-00 2439143 m, 17216 m/sec, 12078873 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 120/3580 23/32 ShieldRVt-PT-050B-LTLCardinality-00 2522198 m, 16611 m/sec, 12638090 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 125/3580 23/32 ShieldRVt-PT-050B-LTLCardinality-00 2608627 m, 17285 m/sec, 13221650 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 130/3580 24/32 ShieldRVt-PT-050B-LTLCardinality-00 2693919 m, 17058 m/sec, 13803744 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 135/3580 25/32 ShieldRVt-PT-050B-LTLCardinality-00 2784862 m, 18188 m/sec, 14302478 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 140/3580 25/32 ShieldRVt-PT-050B-LTLCardinality-00 2866901 m, 16407 m/sec, 14776267 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 145/3580 26/32 ShieldRVt-PT-050B-LTLCardinality-00 2949082 m, 16436 m/sec, 15249079 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 150/3580 26/32 ShieldRVt-PT-050B-LTLCardinality-00 3040282 m, 18240 m/sec, 15710180 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 155/3580 27/32 ShieldRVt-PT-050B-LTLCardinality-00 3140320 m, 20007 m/sec, 16183605 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 160/3580 28/32 ShieldRVt-PT-050B-LTLCardinality-00 3239560 m, 19848 m/sec, 16657659 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 165/3580 28/32 ShieldRVt-PT-050B-LTLCardinality-00 3333637 m, 18815 m/sec, 17122713 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 170/3580 29/32 ShieldRVt-PT-050B-LTLCardinality-00 3421578 m, 17588 m/sec, 17625337 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 175/3580 30/32 ShieldRVt-PT-050B-LTLCardinality-00 3509706 m, 17625 m/sec, 18133366 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 180/3580 30/32 ShieldRVt-PT-050B-LTLCardinality-00 3604700 m, 18998 m/sec, 18675403 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 185/3580 31/32 ShieldRVt-PT-050B-LTLCardinality-00 3694281 m, 17916 m/sec, 19172165 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 190/3580 31/32 ShieldRVt-PT-050B-LTLCardinality-00 3780242 m, 17192 m/sec, 19670342 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 195/3580 32/32 ShieldRVt-PT-050B-LTLCardinality-00 3870058 m, 17963 m/sec, 20190019 t fired, .

Time elapsed: 215 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for ShieldRVt-PT-050B-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-050B-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-050B-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-050B-LTLCardinality-00: LTL unknown AGGR
ShieldRVt-PT-050B-LTLCardinality-12: LTL unknown AGGR


Time elapsed: 220 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-050B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is 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 r423-tajo-167905976600331"
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 ;