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-167905976300155.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-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976300155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 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.5K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 625K 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-050B-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679243141932

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:25:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 16:25:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:25:44] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-19 16:25:44] [INFO ] Transformed 2003 places.
[2023-03-19 16:25:44] [INFO ] Transformed 2253 transitions.
[2023-03-19 16:25:44] [INFO ] Found NUPN structural information;
[2023-03-19 16:25:44] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldRVs-PT-050B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 334 places :
Symmetric choice reduction at 0 with 334 rule applications. Total rules 334 place count 1669 transition count 1919
Iterating global reduction 0 with 334 rules applied. Total rules applied 668 place count 1669 transition count 1919
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 669 place count 1668 transition count 1918
Iterating global reduction 0 with 1 rules applied. Total rules applied 670 place count 1668 transition count 1918
Applied a total of 670 rules in 403 ms. Remains 1668 /2003 variables (removed 335) and now considering 1918/2253 (removed 335) transitions.
// Phase 1: matrix 1918 rows 1668 cols
[2023-03-19 16:25:44] [INFO ] Computed 201 place invariants in 27 ms
[2023-03-19 16:25:45] [INFO ] Implicit Places using invariants in 680 ms returned []
[2023-03-19 16:25:45] [INFO ] Invariant cache hit.
[2023-03-19 16:25:47] [INFO ] Implicit Places using invariants and state equation in 1947 ms returned []
Implicit Place search using SMT with State Equation took 2678 ms to find 0 implicit places.
[2023-03-19 16:25:47] [INFO ] Invariant cache hit.
[2023-03-19 16:25:48] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1668/2003 places, 1918/2253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3988 ms. Remains : 1668/2003 places, 1918/2253 transitions.
Support contains 33 out of 1668 places after structural reductions.
[2023-03-19 16:25:48] [INFO ] Flatten gal took : 156 ms
[2023-03-19 16:25:48] [INFO ] Flatten gal took : 77 ms
[2023-03-19 16:25:48] [INFO ] Input system was already deterministic with 1918 transitions.
Support contains 32 out of 1668 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-19 16:25:49] [INFO ] Invariant cache hit.
[2023-03-19 16:25:50] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 16:25:50] [INFO ] [Nat]Absence check using 201 positive place invariants in 142 ms returned sat
[2023-03-19 16:25:51] [INFO ] After 1010ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 16:25:52] [INFO ] Deduced a trap composed of 43 places in 411 ms of which 8 ms to minimize.
[2023-03-19 16:25:52] [INFO ] Deduced a trap composed of 40 places in 565 ms of which 2 ms to minimize.
[2023-03-19 16:25:53] [INFO ] Deduced a trap composed of 36 places in 532 ms of which 7 ms to minimize.
[2023-03-19 16:25:53] [INFO ] Deduced a trap composed of 36 places in 331 ms of which 3 ms to minimize.
[2023-03-19 16:25:54] [INFO ] Deduced a trap composed of 26 places in 404 ms of which 2 ms to minimize.
[2023-03-19 16:25:54] [INFO ] Deduced a trap composed of 43 places in 395 ms of which 1 ms to minimize.
[2023-03-19 16:25:55] [INFO ] Deduced a trap composed of 28 places in 354 ms of which 1 ms to minimize.
[2023-03-19 16:25:55] [INFO ] Deduced a trap composed of 19 places in 408 ms of which 1 ms to minimize.
[2023-03-19 16:25:56] [INFO ] Deduced a trap composed of 23 places in 430 ms of which 0 ms to minimize.
[2023-03-19 16:25:56] [INFO ] Deduced a trap composed of 51 places in 328 ms of which 1 ms to minimize.
[2023-03-19 16:25:56] [INFO ] Deduced a trap composed of 35 places in 304 ms of which 1 ms to minimize.
[2023-03-19 16:25:57] [INFO ] Deduced a trap composed of 50 places in 407 ms of which 1 ms to minimize.
[2023-03-19 16:25:57] [INFO ] Deduced a trap composed of 27 places in 315 ms of which 1 ms to minimize.
[2023-03-19 16:25:58] [INFO ] Deduced a trap composed of 32 places in 510 ms of which 1 ms to minimize.
[2023-03-19 16:25:58] [INFO ] Deduced a trap composed of 29 places in 403 ms of which 1 ms to minimize.
[2023-03-19 16:25:59] [INFO ] Deduced a trap composed of 35 places in 396 ms of which 1 ms to minimize.
[2023-03-19 16:25:59] [INFO ] Deduced a trap composed of 26 places in 392 ms of which 0 ms to minimize.
[2023-03-19 16:26:00] [INFO ] Deduced a trap composed of 34 places in 336 ms of which 1 ms to minimize.
[2023-03-19 16:26:00] [INFO ] Deduced a trap composed of 36 places in 295 ms of which 1 ms to minimize.
[2023-03-19 16:26:00] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 0 ms to minimize.
[2023-03-19 16:26:01] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 1 ms to minimize.
[2023-03-19 16:26:01] [INFO ] Deduced a trap composed of 50 places in 333 ms of which 1 ms to minimize.
[2023-03-19 16:26:01] [INFO ] Deduced a trap composed of 31 places in 290 ms of which 1 ms to minimize.
[2023-03-19 16:26:02] [INFO ] Deduced a trap composed of 44 places in 337 ms of which 1 ms to minimize.
[2023-03-19 16:26:02] [INFO ] Deduced a trap composed of 41 places in 259 ms of which 1 ms to minimize.
[2023-03-19 16:26:02] [INFO ] Deduced a trap composed of 58 places in 302 ms of which 2 ms to minimize.
[2023-03-19 16:26:03] [INFO ] Deduced a trap composed of 57 places in 309 ms of which 1 ms to minimize.
[2023-03-19 16:26:03] [INFO ] Deduced a trap composed of 62 places in 281 ms of which 1 ms to minimize.
[2023-03-19 16:26:03] [INFO ] Deduced a trap composed of 48 places in 295 ms of which 1 ms to minimize.
[2023-03-19 16:26:04] [INFO ] Deduced a trap composed of 57 places in 251 ms of which 1 ms to minimize.
[2023-03-19 16:26:04] [INFO ] Deduced a trap composed of 63 places in 286 ms of which 1 ms to minimize.
[2023-03-19 16:26:05] [INFO ] Deduced a trap composed of 60 places in 310 ms of which 1 ms to minimize.
[2023-03-19 16:26:05] [INFO ] Deduced a trap composed of 79 places in 324 ms of which 1 ms to minimize.
[2023-03-19 16:26:05] [INFO ] Deduced a trap composed of 58 places in 371 ms of which 3 ms to minimize.
[2023-03-19 16:26:06] [INFO ] Deduced a trap composed of 82 places in 309 ms of which 1 ms to minimize.
[2023-03-19 16:26:06] [INFO ] Deduced a trap composed of 57 places in 282 ms of which 1 ms to minimize.
[2023-03-19 16:26:07] [INFO ] Deduced a trap composed of 52 places in 306 ms of which 1 ms to minimize.
[2023-03-19 16:26:07] [INFO ] Deduced a trap composed of 56 places in 265 ms of which 1 ms to minimize.
[2023-03-19 16:26:07] [INFO ] Deduced a trap composed of 75 places in 288 ms of which 1 ms to minimize.
[2023-03-19 16:26:08] [INFO ] Deduced a trap composed of 57 places in 306 ms of which 1 ms to minimize.
[2023-03-19 16:26:08] [INFO ] Deduced a trap composed of 68 places in 230 ms of which 0 ms to minimize.
[2023-03-19 16:26:08] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 16730 ms
[2023-03-19 16:26:08] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 0 ms to minimize.
[2023-03-19 16:26:09] [INFO ] Deduced a trap composed of 54 places in 185 ms of which 1 ms to minimize.
[2023-03-19 16:26:09] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 0 ms to minimize.
[2023-03-19 16:26:09] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 1 ms to minimize.
[2023-03-19 16:26:09] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 1 ms to minimize.
[2023-03-19 16:26:10] [INFO ] Deduced a trap composed of 58 places in 253 ms of which 1 ms to minimize.
[2023-03-19 16:26:10] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 2 ms to minimize.
[2023-03-19 16:26:10] [INFO ] Deduced a trap composed of 54 places in 226 ms of which 0 ms to minimize.
[2023-03-19 16:26:10] [INFO ] Deduced a trap composed of 56 places in 289 ms of which 1 ms to minimize.
[2023-03-19 16:26:11] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 2 ms to minimize.
[2023-03-19 16:26:11] [INFO ] Deduced a trap composed of 67 places in 289 ms of which 1 ms to minimize.
[2023-03-19 16:26:12] [INFO ] Deduced a trap composed of 66 places in 297 ms of which 1 ms to minimize.
[2023-03-19 16:26:12] [INFO ] Deduced a trap composed of 55 places in 277 ms of which 1 ms to minimize.
[2023-03-19 16:26:12] [INFO ] Deduced a trap composed of 56 places in 248 ms of which 0 ms to minimize.
[2023-03-19 16:26:13] [INFO ] Deduced a trap composed of 63 places in 246 ms of which 1 ms to minimize.
[2023-03-19 16:26:13] [INFO ] Deduced a trap composed of 56 places in 244 ms of which 1 ms to minimize.
[2023-03-19 16:26:13] [INFO ] Deduced a trap composed of 55 places in 226 ms of which 1 ms to minimize.
[2023-03-19 16:26:13] [INFO ] Deduced a trap composed of 56 places in 285 ms of which 1 ms to minimize.
[2023-03-19 16:26:14] [INFO ] Deduced a trap composed of 55 places in 223 ms of which 1 ms to minimize.
[2023-03-19 16:26:14] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 1 ms to minimize.
[2023-03-19 16:26:14] [INFO ] Deduced a trap composed of 59 places in 172 ms of which 1 ms to minimize.
[2023-03-19 16:26:14] [INFO ] Deduced a trap composed of 78 places in 210 ms of which 0 ms to minimize.
[2023-03-19 16:26:15] [INFO ] Deduced a trap composed of 66 places in 227 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:26:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 16:26:15] [INFO ] After 25134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 383 ms.
Support contains 10 out of 1668 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1668 transition count 1720
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1470 transition count 1720
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 396 place count 1470 transition count 1471
Deduced a syphon composed of 249 places in 3 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 894 place count 1221 transition count 1471
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 903 place count 1212 transition count 1462
Iterating global reduction 2 with 9 rules applied. Total rules applied 912 place count 1212 transition count 1462
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 912 place count 1212 transition count 1458
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 920 place count 1208 transition count 1458
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 19 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 2 with 990 rules applied. Total rules applied 1910 place count 713 transition count 963
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 2012 place count 713 transition count 963
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2013 place count 712 transition count 962
Applied a total of 2013 rules in 636 ms. Remains 712 /1668 variables (removed 956) and now considering 962/1918 (removed 956) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 712/1668 places, 962/1918 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 962 rows 712 cols
[2023-03-19 16:26:16] [INFO ] Computed 201 place invariants in 9 ms
[2023-03-19 16:26:16] [INFO ] [Real]Absence check using 201 positive place invariants in 57 ms returned sat
[2023-03-19 16:26:16] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:26:16] [INFO ] [Nat]Absence check using 201 positive place invariants in 33 ms returned sat
[2023-03-19 16:26:17] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:26:17] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2023-03-19 16:26:17] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2023-03-19 16:26:17] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 3 ms to minimize.
[2023-03-19 16:26:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 297 ms
[2023-03-19 16:26:17] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 22 ms to minimize.
[2023-03-19 16:26:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-19 16:26:17] [INFO ] After 862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-19 16:26:17] [INFO ] After 1143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 27 ms.
Support contains 6 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 962/962 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 712 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 711 transition count 961
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 711 transition count 959
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 6 place count 709 transition count 959
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 10 place count 707 transition count 957
Applied a total of 10 rules in 152 ms. Remains 707 /712 variables (removed 5) and now considering 957/962 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 707/712 places, 957/962 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 957 rows 707 cols
[2023-03-19 16:26:18] [INFO ] Computed 201 place invariants in 10 ms
[2023-03-19 16:26:18] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:26:18] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-19 16:26:19] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:26:19] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2023-03-19 16:26:19] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2023-03-19 16:26:19] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2023-03-19 16:26:19] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2023-03-19 16:26:19] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2023-03-19 16:26:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 440 ms
[2023-03-19 16:26:19] [INFO ] After 811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-19 16:26:19] [INFO ] After 1032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 707 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 707/707 places, 957/957 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 705 transition count 955
Applied a total of 4 rules in 94 ms. Remains 705 /707 variables (removed 2) and now considering 955/957 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 705/707 places, 955/957 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 170265 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170265 steps, saw 59752 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 955 rows 705 cols
[2023-03-19 16:26:22] [INFO ] Computed 201 place invariants in 9 ms
[2023-03-19 16:26:23] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:26:23] [INFO ] [Nat]Absence check using 201 positive place invariants in 39 ms returned sat
[2023-03-19 16:26:23] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:26:23] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2023-03-19 16:26:23] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2023-03-19 16:26:23] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2023-03-19 16:26:23] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2023-03-19 16:26:23] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2023-03-19 16:26:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 337 ms
[2023-03-19 16:26:23] [INFO ] After 690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-19 16:26:24] [INFO ] After 914ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 46 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 705/705 places, 955/955 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 52 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
[2023-03-19 16:26:24] [INFO ] Invariant cache hit.
[2023-03-19 16:26:24] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-19 16:26:24] [INFO ] Invariant cache hit.
[2023-03-19 16:26:25] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
[2023-03-19 16:26:25] [INFO ] Redundant transitions in 245 ms returned []
[2023-03-19 16:26:25] [INFO ] Invariant cache hit.
[2023-03-19 16:26:26] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2109 ms. Remains : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 25 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 16:26:26] [INFO ] Invariant cache hit.
[2023-03-19 16:26:26] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:26:26] [INFO ] [Nat]Absence check using 201 positive place invariants in 23 ms returned sat
[2023-03-19 16:26:26] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:26:26] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:26:26] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 832 ms
[2023-03-19 16:26:27] [INFO ] After 1056ms 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:26:27] [INFO ] After 1214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldRVs-PT-050B-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldRVs-PT-050B-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 406 stabilizing places and 406 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(!p0) U !(p0 U p1))))))'
Support contains 4 out of 1668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1654 transition count 1904
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1654 transition count 1904
Applied a total of 28 rules in 97 ms. Remains 1654 /1668 variables (removed 14) and now considering 1904/1918 (removed 14) transitions.
// Phase 1: matrix 1904 rows 1654 cols
[2023-03-19 16:26:28] [INFO ] Computed 201 place invariants in 15 ms
[2023-03-19 16:26:28] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-19 16:26:28] [INFO ] Invariant cache hit.
[2023-03-19 16:26:30] [INFO ] Implicit Places using invariants and state equation in 2006 ms returned []
Implicit Place search using SMT with State Equation took 2450 ms to find 0 implicit places.
[2023-03-19 16:26:30] [INFO ] Invariant cache hit.
[2023-03-19 16:26:31] [INFO ] Dead Transitions using invariants and state equation in 937 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1654/1668 places, 1904/1918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3486 ms. Remains : 1654/1668 places, 1904/1918 transitions.
Stuttering acceptance computed with spot in 546 ms :[true, (OR p1 p0), p1, p1, p1, p1, p1, p1]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p0:(OR (EQ s781 0) (EQ s577 1)), p1:(OR (EQ s1036 0) (EQ s989 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-050B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLCardinality-00 finished in 4144 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(((p1 U p2) U (p1&&F(p3)))))))'
Support contains 8 out of 1668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1667 transition count 1719
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1469 transition count 1719
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 396 place count 1469 transition count 1470
Deduced a syphon composed of 249 places in 3 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 894 place count 1220 transition count 1470
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 908 place count 1206 transition count 1456
Iterating global reduction 2 with 14 rules applied. Total rules applied 922 place count 1206 transition count 1456
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 922 place count 1206 transition count 1452
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 930 place count 1202 transition count 1452
Performed 492 Post agglomeration using F-continuation condition.Transition count delta: 492
Deduced a syphon composed of 492 places in 2 ms
Reduce places removed 492 places and 0 transitions.
Iterating global reduction 2 with 984 rules applied. Total rules applied 1914 place count 710 transition count 960
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 1916 place count 708 transition count 958
Applied a total of 1916 rules in 350 ms. Remains 708 /1668 variables (removed 960) and now considering 958/1918 (removed 960) transitions.
// Phase 1: matrix 958 rows 708 cols
[2023-03-19 16:26:32] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-19 16:26:32] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-19 16:26:32] [INFO ] Invariant cache hit.
[2023-03-19 16:26:33] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2023-03-19 16:26:33] [INFO ] Redundant transitions in 146 ms returned [957]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 957 rows 708 cols
[2023-03-19 16:26:33] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-19 16:26:33] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 708/1668 places, 957/1918 transitions.
Applied a total of 0 rules in 22 ms. Remains 708 /708 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1943 ms. Remains : 708/1668 places, 957/1918 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s409 0) (EQ s656 1)), p1:(OR (EQ s312 0) (EQ s226 1)), p2:(OR (EQ s32 0) (EQ s680 1)), p3:(OR (EQ s179 0) (EQ s534 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 318 reset in 601 ms.
Product exploration explored 100000 steps with 303 reset in 639 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND p1 (NOT p3)))), (X p3), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 11 factoid took 739 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 16:26:36] [INFO ] Invariant cache hit.
[2023-03-19 16:26:37] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:26:37] [INFO ] [Nat]Absence check using 201 positive place invariants in 33 ms returned sat
[2023-03-19 16:26:37] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:26:37] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2023-03-19 16:26:37] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2023-03-19 16:26:37] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-19 16:26:38] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-19 16:26:38] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-19 16:26:38] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2023-03-19 16:26:38] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2023-03-19 16:26:38] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2023-03-19 16:26:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1022 ms
[2023-03-19 16:26:38] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2023-03-19 16:26:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-19 16:26:38] [INFO ] After 1612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-19 16:26:38] [INFO ] After 1876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 957/957 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 708 transition count 956
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 707 transition count 956
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 706 transition count 955
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 2 with 101 rules applied. Total rules applied 105 place count 706 transition count 955
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 704 transition count 953
Applied a total of 107 rules in 104 ms. Remains 704 /708 variables (removed 4) and now considering 953/957 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 704/708 places, 953/957 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 144952 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144952 steps, saw 142205 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 953 rows 704 cols
[2023-03-19 16:26:42] [INFO ] Computed 201 place invariants in 8 ms
[2023-03-19 16:26:42] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:26:42] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-19 16:26:43] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:26:43] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2023-03-19 16:26:43] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-19 16:26:43] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2023-03-19 16:26:43] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2023-03-19 16:26:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 607 ms
[2023-03-19 16:26:43] [INFO ] After 1075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-19 16:26:43] [INFO ] After 1341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 30 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 704/704 places, 953/953 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 28 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-19 16:26:43] [INFO ] Invariant cache hit.
[2023-03-19 16:26:44] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-19 16:26:44] [INFO ] Invariant cache hit.
[2023-03-19 16:26:45] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2023-03-19 16:26:45] [INFO ] Redundant transitions in 157 ms returned []
[2023-03-19 16:26:45] [INFO ] Invariant cache hit.
[2023-03-19 16:26:45] [INFO ] Dead Transitions using invariants and state equation in 580 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1951 ms. Remains : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 32 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 16:26:45] [INFO ] Invariant cache hit.
[2023-03-19 16:26:46] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:26:46] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-19 16:26:46] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:26:46] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2023-03-19 16:26:47] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2023-03-19 16:26:47] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-19 16:26:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 492 ms
[2023-03-19 16:26:47] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2023-03-19 16:26:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-19 16:26:47] [INFO ] After 1057ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-19 16:26:47] [INFO ] After 1323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND p1 (NOT p3)))), (X p3), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT p3)), (F (AND (NOT p3) p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 11 factoid took 531 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Support contains 6 out of 708 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 708/708 places, 957/957 transitions.
Applied a total of 0 rules in 27 ms. Remains 708 /708 variables (removed 0) and now considering 957/957 (removed 0) transitions.
// Phase 1: matrix 957 rows 708 cols
[2023-03-19 16:26:48] [INFO ] Computed 201 place invariants in 7 ms
[2023-03-19 16:26:48] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-19 16:26:48] [INFO ] Invariant cache hit.
[2023-03-19 16:26:49] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2023-03-19 16:26:49] [INFO ] Redundant transitions in 156 ms returned []
[2023-03-19 16:26:49] [INFO ] Invariant cache hit.
[2023-03-19 16:26:50] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1765 ms. Remains : 708/708 places, 957/957 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p2 p3), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 8 factoid took 298 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 16:26:50] [INFO ] Invariant cache hit.
[2023-03-19 16:26:50] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:26:51] [INFO ] [Nat]Absence check using 201 positive place invariants in 33 ms returned sat
[2023-03-19 16:26:51] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:26:51] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2023-03-19 16:26:51] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2023-03-19 16:26:51] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2023-03-19 16:26:51] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2023-03-19 16:26:52] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-03-19 16:26:52] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:26:52] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2023-03-19 16:26:52] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:26:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 847 ms
[2023-03-19 16:26:52] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2023-03-19 16:26:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-19 16:26:52] [INFO ] After 1372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-19 16:26:52] [INFO ] After 1614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 957/957 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 708 transition count 956
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 707 transition count 956
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 706 transition count 955
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 2 with 101 rules applied. Total rules applied 105 place count 706 transition count 955
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 704 transition count 953
Applied a total of 107 rules in 100 ms. Remains 704 /708 variables (removed 4) and now considering 953/957 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 704/708 places, 953/957 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 205002 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205002 steps, saw 201167 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 953 rows 704 cols
[2023-03-19 16:26:56] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-19 16:26:56] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:26:56] [INFO ] [Nat]Absence check using 201 positive place invariants in 23 ms returned sat
[2023-03-19 16:26:56] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 304 ms
[2023-03-19 16:26:56] [INFO ] After 647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-19 16:26:56] [INFO ] After 868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 28 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 704/704 places, 953/953 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 27 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-19 16:26:57] [INFO ] Invariant cache hit.
[2023-03-19 16:26:57] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-19 16:26:57] [INFO ] Invariant cache hit.
[2023-03-19 16:26:58] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
[2023-03-19 16:26:58] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-19 16:26:58] [INFO ] Invariant cache hit.
[2023-03-19 16:26:58] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1479 ms. Remains : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 18 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 16:26:58] [INFO ] Invariant cache hit.
[2023-03-19 16:26:58] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:26:58] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-19 16:26:59] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:26:59] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-19 16:26:59] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2023-03-19 16:26:59] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2023-03-19 16:26:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2023-03-19 16:26:59] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-19 16:26:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-19 16:26:59] [INFO ] After 713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-19 16:26:59] [INFO ] After 940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p2 p3), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT p3)), (F (AND (NOT p3) p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 8 factoid took 385 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 341 reset in 748 ms.
Product exploration explored 100000 steps with 319 reset in 769 ms.
Support contains 6 out of 708 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 708/708 places, 957/957 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 706 transition count 955
Applied a total of 1 rules in 33 ms. Remains 706 /708 variables (removed 2) and now considering 955/957 (removed 2) transitions.
// Phase 1: matrix 955 rows 706 cols
[2023-03-19 16:27:01] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-19 16:27:02] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-19 16:27:02] [INFO ] Invariant cache hit.
[2023-03-19 16:27:02] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2023-03-19 16:27:03] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-19 16:27:03] [INFO ] Invariant cache hit.
[2023-03-19 16:27:03] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 706/708 places, 955/957 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1589 ms. Remains : 706/708 places, 955/957 transitions.
Treatment of property ShieldRVs-PT-050B-LTLCardinality-04 finished in 31536 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)) U (G(((p1 U p2) U p3)) U X(p2))))'
Support contains 8 out of 1668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1655 transition count 1905
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1655 transition count 1905
Applied a total of 26 rules in 113 ms. Remains 1655 /1668 variables (removed 13) and now considering 1905/1918 (removed 13) transitions.
// Phase 1: matrix 1905 rows 1655 cols
[2023-03-19 16:27:03] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-19 16:27:04] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-19 16:27:04] [INFO ] Invariant cache hit.
[2023-03-19 16:27:05] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 1956 ms to find 0 implicit places.
[2023-03-19 16:27:05] [INFO ] Invariant cache hit.
[2023-03-19 16:27:06] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1655/1668 places, 1905/1918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3042 ms. Remains : 1655/1668 places, 1905/1918 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 4}, { cond=(OR p3 p2 p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(NOT p2), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(OR (AND p3 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(OR (AND p3 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={} source=9 dest: 8}, { cond=(OR p3 p2 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(OR (EQ s791 0) (EQ s1525 1)), p2:(OR (EQ s231 0) (EQ s596 1)), p1:(OR (EQ s1122 0) (EQ s1080 1)), p0:(OR (EQ s1225 0) (EQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 763 ms.
Product exploration explored 100000 steps with 50000 reset in 760 ms.
Computed a total of 400 stabilizing places and 400 stable transitions
Computed a total of 400 stabilizing places and 400 stable transitions
Detected a total of 400/1655 stabilizing places and 400/1905 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 p2 p1 p0), (X p2), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1))))), (X (X (OR p3 p2 p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 28 factoid took 461 ms. Reduced automaton from 10 states, 34 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-050B-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050B-LTLCardinality-05 finished in 5401 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((G(!p0)||(!p0&&F(!p1))))))'
Support contains 4 out of 1668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1667 transition count 1717
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1467 transition count 1717
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 400 place count 1467 transition count 1469
Deduced a syphon composed of 248 places in 3 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 896 place count 1219 transition count 1469
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 910 place count 1205 transition count 1455
Iterating global reduction 2 with 14 rules applied. Total rules applied 924 place count 1205 transition count 1455
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 924 place count 1205 transition count 1451
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 932 place count 1201 transition count 1451
Performed 493 Post agglomeration using F-continuation condition.Transition count delta: 493
Deduced a syphon composed of 493 places in 2 ms
Reduce places removed 493 places and 0 transitions.
Iterating global reduction 2 with 986 rules applied. Total rules applied 1918 place count 708 transition count 958
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 1920 place count 706 transition count 956
Applied a total of 1920 rules in 324 ms. Remains 706 /1668 variables (removed 962) and now considering 956/1918 (removed 962) transitions.
// Phase 1: matrix 956 rows 706 cols
[2023-03-19 16:27:09] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-19 16:27:09] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-19 16:27:09] [INFO ] Invariant cache hit.
[2023-03-19 16:27:10] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
[2023-03-19 16:27:10] [INFO ] Redundant transitions in 171 ms returned [955]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 955 rows 706 cols
[2023-03-19 16:27:10] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-19 16:27:11] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 706/1668 places, 955/1918 transitions.
Applied a total of 0 rules in 21 ms. Remains 706 /706 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2264 ms. Remains : 706/1668 places, 955/1918 transitions.
Stuttering acceptance computed with spot in 88 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s600 0) (EQ s365 1)), p0:(OR (EQ s358 0) (EQ s355 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 681 steps with 3 reset in 4 ms.
FORMULA ShieldRVs-PT-050B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLCardinality-09 finished in 2378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1667 transition count 1716
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1466 transition count 1716
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1466 transition count 1466
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1216 transition count 1466
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 916 place count 1202 transition count 1452
Iterating global reduction 2 with 14 rules applied. Total rules applied 930 place count 1202 transition count 1452
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 930 place count 1202 transition count 1447
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 940 place count 1197 transition count 1447
Performed 492 Post agglomeration using F-continuation condition.Transition count delta: 492
Deduced a syphon composed of 492 places in 1 ms
Reduce places removed 492 places and 0 transitions.
Iterating global reduction 2 with 984 rules applied. Total rules applied 1924 place count 705 transition count 955
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 1926 place count 703 transition count 953
Applied a total of 1926 rules in 231 ms. Remains 703 /1668 variables (removed 965) and now considering 953/1918 (removed 965) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-19 16:27:11] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-19 16:27:11] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-19 16:27:11] [INFO ] Invariant cache hit.
[2023-03-19 16:27:12] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
[2023-03-19 16:27:12] [INFO ] Redundant transitions in 149 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2023-03-19 16:27:12] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-19 16:27:13] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1668 places, 952/1918 transitions.
Applied a total of 0 rules in 18 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1709 ms. Remains : 703/1668 places, 952/1918 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s417 0) (EQ s495 1) (EQ s323 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 609 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-050B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLCardinality-14 finished in 1769 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(((p1 U p2) U (p1&&F(p3)))))))'
[2023-03-19 16:27:13] [INFO ] Flatten gal took : 68 ms
[2023-03-19 16:27:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 16:27:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1668 places, 1918 transitions and 6530 arcs took 11 ms.
Total runtime 89585 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-050B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1679243259182

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:535
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 # 5 (type EXCL) for 0 ShieldRVs-PT-050B-LTLCardinality-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/1799 6/32 ShieldRVs-PT-050B-LTLCardinality-04 532399 m, 106479 m/sec, 1218037 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/1799 13/32 ShieldRVs-PT-050B-LTLCardinality-04 1124995 m, 118519 m/sec, 2534900 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/1799 21/32 ShieldRVs-PT-050B-LTLCardinality-04 1747757 m, 124552 m/sec, 3898576 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLCardinality-04: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 20/1799 29/32 ShieldRVs-PT-050B-LTLCardinality-04 2401650 m, 130778 m/sec, 5182379 t fired, .

Time elapsed: 21 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 5 (type EXCL) for ShieldRVs-PT-050B-LTLCardinality-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLCardinality-04: CONJ 0 1 0 0 2 0 1 0

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

Time elapsed: 26 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: LAUNCH task # 7 (type EXCL) for 0 ShieldRVs-PT-050B-LTLCardinality-04
lola: time limit : 3574 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ShieldRVs-PT-050B-LTLCardinality-04
lola: result : false
lola: markings : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-050B-LTLCardinality-04: CONJ unknown CONJ


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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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