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-167905976300140.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 ShieldRVs-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976300140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 8.5K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 498K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679242912134

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:21:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:21:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:21:53] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-19 16:21:53] [INFO ] Transformed 1603 places.
[2023-03-19 16:21:53] [INFO ] Transformed 1803 transitions.
[2023-03-19 16:21:53] [INFO ] Found NUPN structural information;
[2023-03-19 16:21:53] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVs-PT-040B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 1603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Discarding 272 places :
Symmetric choice reduction at 0 with 272 rule applications. Total rules 272 place count 1331 transition count 1531
Iterating global reduction 0 with 272 rules applied. Total rules applied 544 place count 1331 transition count 1531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 545 place count 1330 transition count 1530
Iterating global reduction 0 with 1 rules applied. Total rules applied 546 place count 1330 transition count 1530
Applied a total of 546 rules in 276 ms. Remains 1330 /1603 variables (removed 273) and now considering 1530/1803 (removed 273) transitions.
// Phase 1: matrix 1530 rows 1330 cols
[2023-03-19 16:21:54] [INFO ] Computed 161 place invariants in 44 ms
[2023-03-19 16:21:54] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-03-19 16:21:54] [INFO ] Invariant cache hit.
[2023-03-19 16:21:56] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 2350 ms to find 0 implicit places.
[2023-03-19 16:21:56] [INFO ] Invariant cache hit.
[2023-03-19 16:21:57] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1330/1603 places, 1530/1803 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3345 ms. Remains : 1330/1603 places, 1530/1803 transitions.
Support contains 44 out of 1330 places after structural reductions.
[2023-03-19 16:21:57] [INFO ] Flatten gal took : 161 ms
[2023-03-19 16:21:57] [INFO ] Flatten gal took : 96 ms
[2023-03-19 16:21:58] [INFO ] Input system was already deterministic with 1530 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 29) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-19 16:21:58] [INFO ] Invariant cache hit.
[2023-03-19 16:21:59] [INFO ] [Real]Absence check using 161 positive place invariants in 45 ms returned sat
[2023-03-19 16:22:00] [INFO ] After 1393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 16:22:00] [INFO ] [Nat]Absence check using 161 positive place invariants in 58 ms returned sat
[2023-03-19 16:22:01] [INFO ] After 1230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 16:22:02] [INFO ] Deduced a trap composed of 18 places in 364 ms of which 7 ms to minimize.
[2023-03-19 16:22:02] [INFO ] Deduced a trap composed of 23 places in 408 ms of which 1 ms to minimize.
[2023-03-19 16:22:03] [INFO ] Deduced a trap composed of 36 places in 349 ms of which 2 ms to minimize.
[2023-03-19 16:22:03] [INFO ] Deduced a trap composed of 28 places in 346 ms of which 2 ms to minimize.
[2023-03-19 16:22:04] [INFO ] Deduced a trap composed of 33 places in 338 ms of which 2 ms to minimize.
[2023-03-19 16:22:04] [INFO ] Deduced a trap composed of 27 places in 299 ms of which 1 ms to minimize.
[2023-03-19 16:22:04] [INFO ] Deduced a trap composed of 20 places in 326 ms of which 2 ms to minimize.
[2023-03-19 16:22:05] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 1 ms to minimize.
[2023-03-19 16:22:05] [INFO ] Deduced a trap composed of 44 places in 265 ms of which 1 ms to minimize.
[2023-03-19 16:22:05] [INFO ] Deduced a trap composed of 26 places in 286 ms of which 1 ms to minimize.
[2023-03-19 16:22:06] [INFO ] Deduced a trap composed of 30 places in 292 ms of which 1 ms to minimize.
[2023-03-19 16:22:06] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 2 ms to minimize.
[2023-03-19 16:22:06] [INFO ] Deduced a trap composed of 25 places in 320 ms of which 1 ms to minimize.
[2023-03-19 16:22:07] [INFO ] Deduced a trap composed of 42 places in 307 ms of which 1 ms to minimize.
[2023-03-19 16:22:07] [INFO ] Deduced a trap composed of 31 places in 312 ms of which 1 ms to minimize.
[2023-03-19 16:22:08] [INFO ] Deduced a trap composed of 33 places in 340 ms of which 1 ms to minimize.
[2023-03-19 16:22:08] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 1 ms to minimize.
[2023-03-19 16:22:08] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 1 ms to minimize.
[2023-03-19 16:22:09] [INFO ] Deduced a trap composed of 50 places in 281 ms of which 2 ms to minimize.
[2023-03-19 16:22:09] [INFO ] Deduced a trap composed of 50 places in 245 ms of which 1 ms to minimize.
[2023-03-19 16:22:09] [INFO ] Deduced a trap composed of 62 places in 236 ms of which 0 ms to minimize.
[2023-03-19 16:22:09] [INFO ] Deduced a trap composed of 44 places in 257 ms of which 0 ms to minimize.
[2023-03-19 16:22:10] [INFO ] Deduced a trap composed of 48 places in 242 ms of which 0 ms to minimize.
[2023-03-19 16:22:10] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 0 ms to minimize.
[2023-03-19 16:22:10] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 1 ms to minimize.
[2023-03-19 16:22:11] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 0 ms to minimize.
[2023-03-19 16:22:11] [INFO ] Deduced a trap composed of 52 places in 225 ms of which 1 ms to minimize.
[2023-03-19 16:22:11] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 1 ms to minimize.
[2023-03-19 16:22:11] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 1 ms to minimize.
[2023-03-19 16:22:12] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 1 ms to minimize.
[2023-03-19 16:22:12] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 1 ms to minimize.
[2023-03-19 16:22:12] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 1 ms to minimize.
[2023-03-19 16:22:13] [INFO ] Deduced a trap composed of 52 places in 244 ms of which 1 ms to minimize.
[2023-03-19 16:22:13] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 5 ms to minimize.
[2023-03-19 16:22:13] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 1 ms to minimize.
[2023-03-19 16:22:14] [INFO ] Deduced a trap composed of 51 places in 265 ms of which 1 ms to minimize.
[2023-03-19 16:22:14] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 1 ms to minimize.
[2023-03-19 16:22:14] [INFO ] Deduced a trap composed of 22 places in 295 ms of which 0 ms to minimize.
[2023-03-19 16:22:15] [INFO ] Deduced a trap composed of 38 places in 268 ms of which 0 ms to minimize.
[2023-03-19 16:22:15] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 1 ms to minimize.
[2023-03-19 16:22:15] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 0 ms to minimize.
[2023-03-19 16:22:15] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 0 ms to minimize.
[2023-03-19 16:22:16] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 0 ms to minimize.
[2023-03-19 16:22:16] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 0 ms to minimize.
[2023-03-19 16:22:16] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2023-03-19 16:22:17] [INFO ] Deduced a trap composed of 60 places in 193 ms of which 1 ms to minimize.
[2023-03-19 16:22:17] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 1 ms to minimize.
[2023-03-19 16:22:17] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 0 ms to minimize.
[2023-03-19 16:22:17] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 0 ms to minimize.
[2023-03-19 16:22:18] [INFO ] Deduced a trap composed of 56 places in 226 ms of which 0 ms to minimize.
[2023-03-19 16:22:18] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 2 ms to minimize.
[2023-03-19 16:22:18] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 1 ms to minimize.
[2023-03-19 16:22:19] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 1 ms to minimize.
[2023-03-19 16:22:19] [INFO ] Deduced a trap composed of 67 places in 239 ms of which 1 ms to minimize.
[2023-03-19 16:22:19] [INFO ] Deduced a trap composed of 64 places in 190 ms of which 0 ms to minimize.
[2023-03-19 16:22:19] [INFO ] Deduced a trap composed of 63 places in 218 ms of which 3 ms to minimize.
[2023-03-19 16:22:20] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 1 ms to minimize.
[2023-03-19 16:22:20] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 18166 ms
[2023-03-19 16:22:20] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 1 ms to minimize.
[2023-03-19 16:22:21] [INFO ] Deduced a trap composed of 39 places in 303 ms of which 1 ms to minimize.
[2023-03-19 16:22:21] [INFO ] Deduced a trap composed of 35 places in 298 ms of which 1 ms to minimize.
[2023-03-19 16:22:21] [INFO ] Deduced a trap composed of 29 places in 305 ms of which 0 ms to minimize.
[2023-03-19 16:22:22] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 1 ms to minimize.
[2023-03-19 16:22:22] [INFO ] Deduced a trap composed of 39 places in 273 ms of which 0 ms to minimize.
[2023-03-19 16:22:22] [INFO ] Deduced a trap composed of 55 places in 312 ms of which 1 ms to minimize.
[2023-03-19 16:22:23] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 3 ms to minimize.
[2023-03-19 16:22:23] [INFO ] Deduced a trap composed of 62 places in 272 ms of which 1 ms to minimize.
[2023-03-19 16:22:23] [INFO ] Deduced a trap composed of 51 places in 273 ms of which 3 ms to minimize.
[2023-03-19 16:22:24] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 3 ms to minimize.
[2023-03-19 16:22:24] [INFO ] Deduced a trap composed of 59 places in 256 ms of which 2 ms to minimize.
[2023-03-19 16:22:24] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 0 ms to minimize.
[2023-03-19 16:22:24] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4489 ms
[2023-03-19 16:22:25] [INFO ] Deduced a trap composed of 34 places in 350 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 16:22:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 16:22:25] [INFO ] After 25226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 299 ms.
Support contains 11 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 1330 transition count 1370
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 320 place count 1170 transition count 1370
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 320 place count 1170 transition count 1169
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 722 place count 969 transition count 1169
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 727 place count 964 transition count 1164
Iterating global reduction 2 with 5 rules applied. Total rules applied 732 place count 964 transition count 1164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 732 place count 964 transition count 1162
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 736 place count 962 transition count 1162
Performed 393 Post agglomeration using F-continuation condition.Transition count delta: 393
Deduced a syphon composed of 393 places in 13 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1522 place count 569 transition count 769
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 1601 place count 569 transition count 769
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1602 place count 568 transition count 768
Applied a total of 1602 rules in 402 ms. Remains 568 /1330 variables (removed 762) and now considering 768/1530 (removed 762) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 568/1330 places, 768/1530 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 768 rows 568 cols
[2023-03-19 16:22:26] [INFO ] Computed 161 place invariants in 9 ms
[2023-03-19 16:22:26] [INFO ] [Real]Absence check using 161 positive place invariants in 24 ms returned sat
[2023-03-19 16:22:26] [INFO ] After 384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:22:26] [INFO ] [Nat]Absence check using 161 positive place invariants in 16 ms returned sat
[2023-03-19 16:22:26] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:22:27] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2023-03-19 16:22:27] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2023-03-19 16:22:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2023-03-19 16:22:27] [INFO ] After 297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-19 16:22:27] [INFO ] After 394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 768/768 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 563 transition count 763
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 563 transition count 763
Applied a total of 12 rules in 60 ms. Remains 563 /568 variables (removed 5) and now considering 763/768 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 563/568 places, 763/768 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 232631 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232631 steps, saw 123267 distinct states, run finished after 3002 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 763 rows 563 cols
[2023-03-19 16:22:30] [INFO ] Computed 161 place invariants in 11 ms
[2023-03-19 16:22:30] [INFO ] [Real]Absence check using 161 positive place invariants in 58 ms returned sat
[2023-03-19 16:22:30] [INFO ] After 518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:22:30] [INFO ] [Nat]Absence check using 161 positive place invariants in 26 ms returned sat
[2023-03-19 16:22:31] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:22:31] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-19 16:22:31] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:22:31] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2023-03-19 16:22:31] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2023-03-19 16:22:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 350 ms
[2023-03-19 16:22:31] [INFO ] After 611ms 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 16:22:31] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 23 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 563/563 places, 763/763 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 22 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-19 16:22:31] [INFO ] Invariant cache hit.
[2023-03-19 16:22:31] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-19 16:22:31] [INFO ] Invariant cache hit.
[2023-03-19 16:22:32] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
[2023-03-19 16:22:32] [INFO ] Redundant transitions in 167 ms returned []
[2023-03-19 16:22:32] [INFO ] Invariant cache hit.
[2023-03-19 16:22:33] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1468 ms. Remains : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 22 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 16:22:33] [INFO ] Invariant cache hit.
[2023-03-19 16:22:33] [INFO ] [Real]Absence check using 161 positive place invariants in 29 ms returned sat
[2023-03-19 16:22:33] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:22:33] [INFO ] [Nat]Absence check using 161 positive place invariants in 18 ms returned sat
[2023-03-19 16:22:33] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:22:33] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2023-03-19 16:22:33] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2023-03-19 16:22:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 160 ms
[2023-03-19 16:22:33] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-19 16:22:33] [INFO ] After 455ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 323 stabilizing places and 323 stable transitions
FORMULA ShieldRVs-PT-040B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))&&X(F(p2))))'
Support contains 4 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1322 transition count 1522
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1322 transition count 1522
Applied a total of 16 rules in 65 ms. Remains 1322 /1330 variables (removed 8) and now considering 1522/1530 (removed 8) transitions.
// Phase 1: matrix 1522 rows 1322 cols
[2023-03-19 16:22:34] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-19 16:22:34] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-19 16:22:34] [INFO ] Invariant cache hit.
[2023-03-19 16:22:35] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1515 ms to find 0 implicit places.
[2023-03-19 16:22:35] [INFO ] Invariant cache hit.
[2023-03-19 16:22:36] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1322/1330 places, 1522/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2318 ms. Remains : 1322/1330 places, 1522/1530 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s28 1), p0:(NEQ s1127 1), p2:(AND (EQ s40 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24070 steps with 27 reset in 172 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-00 finished in 2828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1329 transition count 1368
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1168 transition count 1368
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1168 transition count 1168
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 968 transition count 1168
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 730 place count 960 transition count 1160
Iterating global reduction 2 with 8 rules applied. Total rules applied 738 place count 960 transition count 1160
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 738 place count 960 transition count 1158
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 742 place count 958 transition count 1158
Performed 395 Post agglomeration using F-continuation condition.Transition count delta: 395
Deduced a syphon composed of 395 places in 1 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 1532 place count 563 transition count 763
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1534 place count 561 transition count 761
Applied a total of 1534 rules in 144 ms. Remains 561 /1330 variables (removed 769) and now considering 761/1530 (removed 769) transitions.
// Phase 1: matrix 761 rows 561 cols
[2023-03-19 16:22:37] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-19 16:22:37] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-19 16:22:37] [INFO ] Invariant cache hit.
[2023-03-19 16:22:38] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2023-03-19 16:22:38] [INFO ] Redundant transitions in 105 ms returned [760]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 760 rows 561 cols
[2023-03-19 16:22:38] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-19 16:22:38] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/1330 places, 760/1530 transitions.
Applied a total of 0 rules in 17 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1465 ms. Remains : 561/1330 places, 760/1530 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-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:(EQ s25 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 187 reset in 413 ms.
Product exploration explored 100000 steps with 187 reset in 481 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 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 464 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=154 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 1 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 760/760 transitions.
Applied a total of 0 rules in 22 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
[2023-03-19 16:22:39] [INFO ] Invariant cache hit.
[2023-03-19 16:22:40] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-19 16:22:40] [INFO ] Invariant cache hit.
[2023-03-19 16:22:40] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2023-03-19 16:22:40] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-19 16:22:40] [INFO ] Invariant cache hit.
[2023-03-19 16:22:41] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1308 ms. Remains : 561/561 places, 760/760 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 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Finished random walk after 496 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=124 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 186 reset in 396 ms.
Product exploration explored 100000 steps with 187 reset in 615 ms.
Support contains 1 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 760/760 transitions.
Applied a total of 0 rules in 19 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
[2023-03-19 16:22:42] [INFO ] Invariant cache hit.
[2023-03-19 16:22:42] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-19 16:22:42] [INFO ] Invariant cache hit.
[2023-03-19 16:22:43] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2023-03-19 16:22:43] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-19 16:22:43] [INFO ] Invariant cache hit.
[2023-03-19 16:22:43] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1287 ms. Remains : 561/561 places, 760/760 transitions.
Treatment of property ShieldRVs-PT-040B-LTLFireability-01 finished in 6811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1 U (p2||G(p1)))))))'
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1323 transition count 1523
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1323 transition count 1523
Applied a total of 14 rules in 92 ms. Remains 1323 /1330 variables (removed 7) and now considering 1523/1530 (removed 7) transitions.
// Phase 1: matrix 1523 rows 1323 cols
[2023-03-19 16:22:43] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-19 16:22:44] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-19 16:22:44] [INFO ] Invariant cache hit.
[2023-03-19 16:22:45] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2023-03-19 16:22:45] [INFO ] Invariant cache hit.
[2023-03-19 16:22:45] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 1523/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2032 ms. Remains : 1323/1330 places, 1523/1530 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (NEQ s38 1) (NEQ s440 1)), p1:(NEQ s440 1), p0:(EQ s38 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1169 steps with 0 reset in 5 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-03 finished in 2148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G((p1&&F((!p2 U (p3||G(!p2))))))))))'
Support contains 6 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1322 transition count 1522
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1322 transition count 1522
Applied a total of 16 rules in 68 ms. Remains 1322 /1330 variables (removed 8) and now considering 1522/1530 (removed 8) transitions.
// Phase 1: matrix 1522 rows 1322 cols
[2023-03-19 16:22:46] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-19 16:22:46] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-19 16:22:46] [INFO ] Invariant cache hit.
[2023-03-19 16:22:47] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
[2023-03-19 16:22:47] [INFO ] Invariant cache hit.
[2023-03-19 16:22:48] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1322/1330 places, 1522/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2024 ms. Remains : 1322/1330 places, 1522/1530 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p3) p2), (OR (NOT p1) (AND p2 (NOT p3)))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s563 1), p1:(NEQ s1214 1), p3:(AND (NEQ s1189 1) (NOT (AND (EQ s145 1) (EQ s179 1) (EQ s200 1)))), p2:(AND (EQ s145 1) (EQ s179 1) (EQ s200 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 52930 steps with 30 reset in 224 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-04 finished in 2408 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&&X((!p0 U (p1||X(p1)||G(!p0))))))))'
Support contains 4 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1323 transition count 1523
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1323 transition count 1523
Applied a total of 14 rules in 64 ms. Remains 1323 /1330 variables (removed 7) and now considering 1523/1530 (removed 7) transitions.
// Phase 1: matrix 1523 rows 1323 cols
[2023-03-19 16:22:48] [INFO ] Computed 161 place invariants in 6 ms
[2023-03-19 16:22:48] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-19 16:22:48] [INFO ] Invariant cache hit.
[2023-03-19 16:22:50] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
[2023-03-19 16:22:50] [INFO ] Invariant cache hit.
[2023-03-19 16:22:50] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 1523/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2310 ms. Remains : 1323/1330 places, 1523/1530 transitions.
Stuttering acceptance computed with spot in 163 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(AND (EQ s126 1) (EQ s135 1) (EQ s156 1)), p1:(EQ s584 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 58 reset in 429 ms.
Product exploration explored 100000 steps with 58 reset in 461 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 240 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 140697 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140697 steps, saw 118701 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 16:22:55] [INFO ] Invariant cache hit.
[2023-03-19 16:22:55] [INFO ] [Real]Absence check using 161 positive place invariants in 39 ms returned sat
[2023-03-19 16:22:56] [INFO ] After 937ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:22:56] [INFO ] [Nat]Absence check using 161 positive place invariants in 88 ms returned sat
[2023-03-19 16:22:57] [INFO ] After 943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:22:58] [INFO ] Deduced a trap composed of 21 places in 350 ms of which 1 ms to minimize.
[2023-03-19 16:22:58] [INFO ] Deduced a trap composed of 52 places in 315 ms of which 1 ms to minimize.
[2023-03-19 16:22:58] [INFO ] Deduced a trap composed of 21 places in 288 ms of which 0 ms to minimize.
[2023-03-19 16:22:59] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 1 ms to minimize.
[2023-03-19 16:22:59] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 1 ms to minimize.
[2023-03-19 16:22:59] [INFO ] Deduced a trap composed of 18 places in 248 ms of which 1 ms to minimize.
[2023-03-19 16:23:00] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 1 ms to minimize.
[2023-03-19 16:23:00] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 1 ms to minimize.
[2023-03-19 16:23:00] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 1 ms to minimize.
[2023-03-19 16:23:01] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 1 ms to minimize.
[2023-03-19 16:23:01] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 1 ms to minimize.
[2023-03-19 16:23:01] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 0 ms to minimize.
[2023-03-19 16:23:02] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 1 ms to minimize.
[2023-03-19 16:23:02] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 1 ms to minimize.
[2023-03-19 16:23:02] [INFO ] Deduced a trap composed of 30 places in 316 ms of which 0 ms to minimize.
[2023-03-19 16:23:03] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 1 ms to minimize.
[2023-03-19 16:23:03] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 1 ms to minimize.
[2023-03-19 16:23:03] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 1 ms to minimize.
[2023-03-19 16:23:04] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 0 ms to minimize.
[2023-03-19 16:23:04] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 1 ms to minimize.
[2023-03-19 16:23:04] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 1 ms to minimize.
[2023-03-19 16:23:04] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 1 ms to minimize.
[2023-03-19 16:23:05] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 0 ms to minimize.
[2023-03-19 16:23:05] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 0 ms to minimize.
[2023-03-19 16:23:05] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 0 ms to minimize.
[2023-03-19 16:23:05] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 0 ms to minimize.
[2023-03-19 16:23:06] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 0 ms to minimize.
[2023-03-19 16:23:06] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 0 ms to minimize.
[2023-03-19 16:23:06] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 0 ms to minimize.
[2023-03-19 16:23:07] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 1 ms to minimize.
[2023-03-19 16:23:07] [INFO ] Deduced a trap composed of 58 places in 221 ms of which 0 ms to minimize.
[2023-03-19 16:23:07] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 0 ms to minimize.
[2023-03-19 16:23:07] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 1 ms to minimize.
[2023-03-19 16:23:08] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 1 ms to minimize.
[2023-03-19 16:23:08] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 0 ms to minimize.
[2023-03-19 16:23:08] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 0 ms to minimize.
[2023-03-19 16:23:08] [INFO ] Deduced a trap composed of 56 places in 182 ms of which 1 ms to minimize.
[2023-03-19 16:23:09] [INFO ] Deduced a trap composed of 53 places in 177 ms of which 0 ms to minimize.
[2023-03-19 16:23:09] [INFO ] Deduced a trap composed of 83 places in 165 ms of which 1 ms to minimize.
[2023-03-19 16:23:09] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2023-03-19 16:23:09] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 0 ms to minimize.
[2023-03-19 16:23:09] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 11809 ms
[2023-03-19 16:23:09] [INFO ] Deduced a trap composed of 74 places in 204 ms of which 13 ms to minimize.
[2023-03-19 16:23:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2023-03-19 16:23:10] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 0 ms to minimize.
[2023-03-19 16:23:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-19 16:23:10] [INFO ] After 13542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 202 ms.
[2023-03-19 16:23:10] [INFO ] After 14118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 121 ms.
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1323 transition count 1362
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1162 transition count 1362
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1162 transition count 1162
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 962 transition count 1162
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 1 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1518 place count 564 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 1599 place count 564 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1600 place count 563 transition count 763
Applied a total of 1600 rules in 157 ms. Remains 563 /1323 variables (removed 760) and now considering 763/1523 (removed 760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 563/1323 places, 763/1523 transitions.
Finished random walk after 3414 steps, including 6 resets, run visited all 3 properties in 37 ms. (steps per millisecond=92 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 601 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Applied a total of 0 rules in 50 ms. Remains 1323 /1323 variables (removed 0) and now considering 1523/1523 (removed 0) transitions.
[2023-03-19 16:23:11] [INFO ] Invariant cache hit.
[2023-03-19 16:23:12] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-19 16:23:12] [INFO ] Invariant cache hit.
[2023-03-19 16:23:13] [INFO ] Implicit Places using invariants and state equation in 1292 ms returned []
Implicit Place search using SMT with State Equation took 1740 ms to find 0 implicit places.
[2023-03-19 16:23:13] [INFO ] Invariant cache hit.
[2023-03-19 16:23:14] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2396 ms. Remains : 1323/1323 places, 1523/1523 transitions.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 227 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 189220 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189220 steps, saw 127903 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 16:23:18] [INFO ] Invariant cache hit.
[2023-03-19 16:23:18] [INFO ] [Real]Absence check using 161 positive place invariants in 36 ms returned sat
[2023-03-19 16:23:18] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:23:18] [INFO ] [Nat]Absence check using 161 positive place invariants in 36 ms returned sat
[2023-03-19 16:23:19] [INFO ] After 991ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:23:19] [INFO ] Deduced a trap composed of 27 places in 353 ms of which 1 ms to minimize.
[2023-03-19 16:23:20] [INFO ] Deduced a trap composed of 30 places in 316 ms of which 1 ms to minimize.
[2023-03-19 16:23:20] [INFO ] Deduced a trap composed of 22 places in 363 ms of which 0 ms to minimize.
[2023-03-19 16:23:21] [INFO ] Deduced a trap composed of 29 places in 389 ms of which 1 ms to minimize.
[2023-03-19 16:23:21] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 1 ms to minimize.
[2023-03-19 16:23:21] [INFO ] Deduced a trap composed of 30 places in 276 ms of which 1 ms to minimize.
[2023-03-19 16:23:22] [INFO ] Deduced a trap composed of 24 places in 316 ms of which 0 ms to minimize.
[2023-03-19 16:23:22] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 1 ms to minimize.
[2023-03-19 16:23:22] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 1 ms to minimize.
[2023-03-19 16:23:23] [INFO ] Deduced a trap composed of 21 places in 312 ms of which 1 ms to minimize.
[2023-03-19 16:23:23] [INFO ] Deduced a trap composed of 29 places in 341 ms of which 1 ms to minimize.
[2023-03-19 16:23:24] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 1 ms to minimize.
[2023-03-19 16:23:24] [INFO ] Deduced a trap composed of 22 places in 358 ms of which 1 ms to minimize.
[2023-03-19 16:23:24] [INFO ] Deduced a trap composed of 43 places in 293 ms of which 0 ms to minimize.
[2023-03-19 16:23:25] [INFO ] Deduced a trap composed of 35 places in 301 ms of which 1 ms to minimize.
[2023-03-19 16:23:25] [INFO ] Deduced a trap composed of 30 places in 327 ms of which 1 ms to minimize.
[2023-03-19 16:23:25] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 1 ms to minimize.
[2023-03-19 16:23:26] [INFO ] Deduced a trap composed of 41 places in 336 ms of which 1 ms to minimize.
[2023-03-19 16:23:26] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 0 ms to minimize.
[2023-03-19 16:23:26] [INFO ] Deduced a trap composed of 35 places in 315 ms of which 1 ms to minimize.
[2023-03-19 16:23:27] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 1 ms to minimize.
[2023-03-19 16:23:27] [INFO ] Deduced a trap composed of 29 places in 253 ms of which 1 ms to minimize.
[2023-03-19 16:23:27] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 0 ms to minimize.
[2023-03-19 16:23:28] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 1 ms to minimize.
[2023-03-19 16:23:28] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 0 ms to minimize.
[2023-03-19 16:23:28] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 1 ms to minimize.
[2023-03-19 16:23:28] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 1 ms to minimize.
[2023-03-19 16:23:29] [INFO ] Deduced a trap composed of 38 places in 221 ms of which 0 ms to minimize.
[2023-03-19 16:23:29] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 1 ms to minimize.
[2023-03-19 16:23:29] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 0 ms to minimize.
[2023-03-19 16:23:29] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 1 ms to minimize.
[2023-03-19 16:23:30] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 0 ms to minimize.
[2023-03-19 16:23:30] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 1 ms to minimize.
[2023-03-19 16:23:30] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 1 ms to minimize.
[2023-03-19 16:23:30] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 0 ms to minimize.
[2023-03-19 16:23:31] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 1 ms to minimize.
[2023-03-19 16:23:31] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 1 ms to minimize.
[2023-03-19 16:23:31] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 1 ms to minimize.
[2023-03-19 16:23:31] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 1 ms to minimize.
[2023-03-19 16:23:31] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 0 ms to minimize.
[2023-03-19 16:23:32] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 0 ms to minimize.
[2023-03-19 16:23:32] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 0 ms to minimize.
[2023-03-19 16:23:32] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 1 ms to minimize.
[2023-03-19 16:23:32] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 1 ms to minimize.
[2023-03-19 16:23:33] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 0 ms to minimize.
[2023-03-19 16:23:33] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 0 ms to minimize.
[2023-03-19 16:23:33] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 0 ms to minimize.
[2023-03-19 16:23:33] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 1 ms to minimize.
[2023-03-19 16:23:34] [INFO ] Deduced a trap composed of 57 places in 166 ms of which 0 ms to minimize.
[2023-03-19 16:23:34] [INFO ] Deduced a trap composed of 53 places in 216 ms of which 1 ms to minimize.
[2023-03-19 16:23:34] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 1 ms to minimize.
[2023-03-19 16:23:34] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 0 ms to minimize.
[2023-03-19 16:23:34] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 1 ms to minimize.
[2023-03-19 16:23:35] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 0 ms to minimize.
[2023-03-19 16:23:35] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 1 ms to minimize.
[2023-03-19 16:23:35] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 0 ms to minimize.
[2023-03-19 16:23:35] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 0 ms to minimize.
[2023-03-19 16:23:35] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 0 ms to minimize.
[2023-03-19 16:23:36] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 1 ms to minimize.
[2023-03-19 16:23:36] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 0 ms to minimize.
[2023-03-19 16:23:36] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 16794 ms
[2023-03-19 16:23:36] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 1 ms to minimize.
[2023-03-19 16:23:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-19 16:23:36] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 0 ms to minimize.
[2023-03-19 16:23:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-03-19 16:23:36] [INFO ] After 18293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-19 16:23:36] [INFO ] After 18622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 124 ms.
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1323 transition count 1362
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1162 transition count 1362
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1162 transition count 1162
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 962 transition count 1162
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 1 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1518 place count 564 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 1599 place count 564 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1600 place count 563 transition count 763
Applied a total of 1600 rules in 115 ms. Remains 563 /1323 variables (removed 760) and now considering 763/1523 (removed 760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 563/1323 places, 763/1523 transitions.
Finished random walk after 4194 steps, including 8 resets, run visited all 3 properties in 48 ms. (steps per millisecond=87 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 304 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 58 reset in 463 ms.
Product exploration explored 100000 steps with 59 reset in 584 ms.
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Applied a total of 0 rules in 31 ms. Remains 1323 /1323 variables (removed 0) and now considering 1523/1523 (removed 0) transitions.
[2023-03-19 16:23:39] [INFO ] Invariant cache hit.
[2023-03-19 16:23:39] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-19 16:23:39] [INFO ] Invariant cache hit.
[2023-03-19 16:23:40] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
[2023-03-19 16:23:40] [INFO ] Invariant cache hit.
[2023-03-19 16:23:41] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2283 ms. Remains : 1323/1323 places, 1523/1523 transitions.
Treatment of property ShieldRVs-PT-040B-LTLFireability-05 finished in 52959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 1329 transition count 1369
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 320 place count 1169 transition count 1369
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 320 place count 1169 transition count 1170
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 718 place count 970 transition count 1170
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 726 place count 962 transition count 1162
Iterating global reduction 2 with 8 rules applied. Total rules applied 734 place count 962 transition count 1162
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 734 place count 962 transition count 1160
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 738 place count 960 transition count 1160
Performed 395 Post agglomeration using F-continuation condition.Transition count delta: 395
Deduced a syphon composed of 395 places in 1 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 1528 place count 565 transition count 765
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1530 place count 563 transition count 763
Applied a total of 1530 rules in 135 ms. Remains 563 /1330 variables (removed 767) and now considering 763/1530 (removed 767) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-19 16:23:41] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-19 16:23:41] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-19 16:23:41] [INFO ] Invariant cache hit.
[2023-03-19 16:23:42] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2023-03-19 16:23:42] [INFO ] Redundant transitions in 97 ms returned [762]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 762 rows 563 cols
[2023-03-19 16:23:42] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-19 16:23:42] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 563/1330 places, 762/1530 transitions.
Applied a total of 0 rules in 13 ms. Remains 563 /563 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1395 ms. Remains : 563/1330 places, 762/1530 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s493 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 537 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-06 finished in 1450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(!p0&&F(p1)&&F(!p2)))))'
Support contains 7 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1322 transition count 1522
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1322 transition count 1522
Applied a total of 16 rules in 63 ms. Remains 1322 /1330 variables (removed 8) and now considering 1522/1530 (removed 8) transitions.
// Phase 1: matrix 1522 rows 1322 cols
[2023-03-19 16:23:42] [INFO ] Computed 161 place invariants in 9 ms
[2023-03-19 16:23:43] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-19 16:23:43] [INFO ] Invariant cache hit.
[2023-03-19 16:23:44] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
[2023-03-19 16:23:44] [INFO ] Invariant cache hit.
[2023-03-19 16:23:44] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1322/1330 places, 1522/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1952 ms. Remains : 1322/1330 places, 1522/1530 transitions.
Stuttering acceptance computed with spot in 161 ms :[p0, p0, true, (AND (NOT p1) p0), (AND p2 p0), (NOT p1), p2]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s981 1) (EQ s984 1) (EQ s991 1)), p1:(NEQ s1132 1), p2:(AND (EQ s926 1) (EQ s935 1) (EQ s956 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 864 ms.
Product exploration explored 100000 steps with 50000 reset in 873 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Detected a total of 319/1322 stabilizing places and 319/1522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 10 factoid took 160 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-040B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-040B-LTLFireability-08 finished in 4044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F((G(p2)&&p1)))))'
Support contains 8 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 1329 transition count 1371
Reduce places removed 158 places and 0 transitions.
Iterating post reduction 1 with 158 rules applied. Total rules applied 316 place count 1171 transition count 1371
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 316 place count 1171 transition count 1171
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 716 place count 971 transition count 1171
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 722 place count 965 transition count 1165
Iterating global reduction 2 with 6 rules applied. Total rules applied 728 place count 965 transition count 1165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 728 place count 965 transition count 1164
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 730 place count 964 transition count 1164
Performed 395 Post agglomeration using F-continuation condition.Transition count delta: 395
Deduced a syphon composed of 395 places in 1 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 1520 place count 569 transition count 769
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1522 place count 567 transition count 767
Applied a total of 1522 rules in 141 ms. Remains 567 /1330 variables (removed 763) and now considering 767/1530 (removed 763) transitions.
// Phase 1: matrix 767 rows 567 cols
[2023-03-19 16:23:47] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-19 16:23:47] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-19 16:23:47] [INFO ] Invariant cache hit.
[2023-03-19 16:23:47] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2023-03-19 16:23:48] [INFO ] Redundant transitions in 190 ms returned [766]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 766 rows 567 cols
[2023-03-19 16:23:48] [INFO ] Computed 161 place invariants in 1 ms
[2023-03-19 16:23:48] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 567/1330 places, 766/1530 transitions.
Applied a total of 0 rules in 13 ms. Remains 567 /567 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1625 ms. Remains : 567/1330 places, 766/1530 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s272 1), p1:(AND (EQ s496 1) (EQ s513 1) (EQ s525 1)), p2:(AND (EQ s500 1) (EQ s502 1) (EQ s506 1) (EQ s209 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 531 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-09 finished in 1723 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(p1)))))'
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1324 transition count 1524
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1324 transition count 1524
Applied a total of 12 rules in 65 ms. Remains 1324 /1330 variables (removed 6) and now considering 1524/1530 (removed 6) transitions.
// Phase 1: matrix 1524 rows 1324 cols
[2023-03-19 16:23:48] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-19 16:23:48] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-19 16:23:48] [INFO ] Invariant cache hit.
[2023-03-19 16:23:50] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1358 ms to find 0 implicit places.
[2023-03-19 16:23:50] [INFO ] Invariant cache hit.
[2023-03-19 16:23:50] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1324/1330 places, 1524/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2047 ms. Remains : 1324/1330 places, 1524/1530 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s536 1), p0:(EQ s952 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 31232 steps with 24 reset in 113 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-11 finished in 2254 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&&(p1||F(p2))))))'
Support contains 5 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1324 transition count 1524
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1324 transition count 1524
Applied a total of 12 rules in 74 ms. Remains 1324 /1330 variables (removed 6) and now considering 1524/1530 (removed 6) transitions.
// Phase 1: matrix 1524 rows 1324 cols
[2023-03-19 16:23:50] [INFO ] Computed 161 place invariants in 6 ms
[2023-03-19 16:23:51] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-19 16:23:51] [INFO ] Invariant cache hit.
[2023-03-19 16:23:52] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
[2023-03-19 16:23:52] [INFO ] Invariant cache hit.
[2023-03-19 16:23:53] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1324/1330 places, 1524/1530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2194 ms. Remains : 1324/1330 places, 1524/1530 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s242 1), p1:(AND (EQ s1216 1) (EQ s1225 1) (EQ s1246 1)), p2:(EQ s967 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1756 steps with 0 reset in 7 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-12 finished in 2314 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 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 1530/1530 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 1329 transition count 1370
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 1 with 159 rules applied. Total rules applied 318 place count 1170 transition count 1370
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 318 place count 1170 transition count 1170
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 718 place count 970 transition count 1170
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 726 place count 962 transition count 1162
Iterating global reduction 2 with 8 rules applied. Total rules applied 734 place count 962 transition count 1162
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 734 place count 962 transition count 1160
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 738 place count 960 transition count 1160
Performed 394 Post agglomeration using F-continuation condition.Transition count delta: 394
Deduced a syphon composed of 394 places in 1 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 1526 place count 566 transition count 766
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1528 place count 564 transition count 764
Applied a total of 1528 rules in 120 ms. Remains 564 /1330 variables (removed 766) and now considering 764/1530 (removed 766) transitions.
// Phase 1: matrix 764 rows 564 cols
[2023-03-19 16:23:53] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-19 16:23:53] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-19 16:23:53] [INFO ] Invariant cache hit.
[2023-03-19 16:23:54] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2023-03-19 16:23:54] [INFO ] Redundant transitions in 494 ms returned [763]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 763 rows 564 cols
[2023-03-19 16:23:54] [INFO ] Computed 161 place invariants in 1 ms
[2023-03-19 16:23:54] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 564/1330 places, 763/1530 transitions.
Applied a total of 0 rules in 12 ms. Remains 564 /564 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1699 ms. Remains : 564/1330 places, 763/1530 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s129 1) (EQ s147 1) (EQ s158 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]]
Stuttering criterion allowed to conclude after 558 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-15 finished in 1754 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)))'
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&&X((!p0 U (p1||X(p1)||G(!p0))))))))'
[2023-03-19 16:23:55] [INFO ] Flatten gal took : 116 ms
[2023-03-19 16:23:55] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 16:23:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1330 places, 1530 transitions and 5214 arcs took 14 ms.
Total runtime 121695 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-040B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
LTLFireability

BK_STOP 1679243150882

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/LTLFireability.xml
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 # 1 (type EXCL) for 0 ShieldRVs-PT-040B-LTLFireability-01
lola: time limit : 1799 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/1799 7/32 ShieldRVs-PT-040B-LTLFireability-01 540312 m, 108062 m/sec, 1654574 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/1799 14/32 ShieldRVs-PT-040B-LTLFireability-01 1106276 m, 113192 m/sec, 3490350 t fired, .

Time elapsed: 10 secs. Pages in use: 14
# 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/1799 21/32 ShieldRVs-PT-040B-LTLFireability-01 1669177 m, 112580 m/sec, 5139093 t fired, .

Time elapsed: 15 secs. Pages in use: 21
# 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/1799 28/32 ShieldRVs-PT-040B-LTLFireability-01 2216922 m, 109549 m/sec, 6702334 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldRVs-PT-040B-LTLFireability-05
lola: time limit : 3575 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3575 3/32 ShieldRVs-PT-040B-LTLFireability-05 132819 m, 26563 m/sec, 705386 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3575 5/32 ShieldRVs-PT-040B-LTLFireability-05 245844 m, 22605 m/sec, 1434043 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3575 6/32 ShieldRVs-PT-040B-LTLFireability-05 353348 m, 21500 m/sec, 2150766 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3575 8/32 ShieldRVs-PT-040B-LTLFireability-05 467868 m, 22904 m/sec, 2865340 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3575 10/32 ShieldRVs-PT-040B-LTLFireability-05 573801 m, 21186 m/sec, 3566899 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3575 11/32 ShieldRVs-PT-040B-LTLFireability-05 682447 m, 21729 m/sec, 4358175 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3575 13/32 ShieldRVs-PT-040B-LTLFireability-05 794551 m, 22420 m/sec, 5155814 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3575 15/32 ShieldRVs-PT-040B-LTLFireability-05 905777 m, 22245 m/sec, 5999588 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3575 17/32 ShieldRVs-PT-040B-LTLFireability-05 1031252 m, 25095 m/sec, 6817252 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3575 19/32 ShieldRVs-PT-040B-LTLFireability-05 1149837 m, 23717 m/sec, 7655255 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3575 21/32 ShieldRVs-PT-040B-LTLFireability-05 1270110 m, 24054 m/sec, 8479827 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/3575 23/32 ShieldRVs-PT-040B-LTLFireability-05 1387182 m, 23414 m/sec, 9264514 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/3575 25/32 ShieldRVs-PT-040B-LTLFireability-05 1511584 m, 24880 m/sec, 10058933 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/3575 27/32 ShieldRVs-PT-040B-LTLFireability-05 1631740 m, 24031 m/sec, 10850440 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/3575 28/32 ShieldRVs-PT-040B-LTLFireability-05 1749551 m, 23562 m/sec, 11691810 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/3575 30/32 ShieldRVs-PT-040B-LTLFireability-05 1859302 m, 21950 m/sec, 12487452 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
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/3575 32/32 ShieldRVs-PT-040B-LTLFireability-05 1970622 m, 22264 m/sec, 13326667 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for ShieldRVs-PT-040B-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-040B-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 115 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
ShieldRVs-PT-040B-LTLFireability-01: LTL unknown AGGR
ShieldRVs-PT-040B-LTLFireability-05: LTL unknown AGGR


Time elapsed: 115 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="ShieldRVs-PT-040B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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