Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715100287.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldIIPt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715100287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 338K 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 ShieldIIPt-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679271577399

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:19:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 00:19:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:19:39] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-20 00:19:39] [INFO ] Transformed 1403 places.
[2023-03-20 00:19:39] [INFO ] Transformed 1303 transitions.
[2023-03-20 00:19:39] [INFO ] Found NUPN structural information;
[2023-03-20 00:19:39] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 16) seen :10
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1303 rows 1403 cols
[2023-03-20 00:19:40] [INFO ] Computed 181 place invariants in 24 ms
[2023-03-20 00:19:41] [INFO ] After 845ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 00:19:42] [INFO ] [Nat]Absence check using 181 positive place invariants in 67 ms returned sat
[2023-03-20 00:19:44] [INFO ] After 2016ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 00:19:44] [INFO ] Deduced a trap composed of 26 places in 418 ms of which 5 ms to minimize.
[2023-03-20 00:19:45] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 1 ms to minimize.
[2023-03-20 00:19:45] [INFO ] Deduced a trap composed of 19 places in 325 ms of which 3 ms to minimize.
[2023-03-20 00:19:45] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 1 ms to minimize.
[2023-03-20 00:19:46] [INFO ] Deduced a trap composed of 25 places in 377 ms of which 1 ms to minimize.
[2023-03-20 00:19:46] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 1 ms to minimize.
[2023-03-20 00:19:46] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 10 ms to minimize.
[2023-03-20 00:19:47] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 0 ms to minimize.
[2023-03-20 00:19:47] [INFO ] Deduced a trap composed of 37 places in 266 ms of which 0 ms to minimize.
[2023-03-20 00:19:47] [INFO ] Deduced a trap composed of 30 places in 343 ms of which 0 ms to minimize.
[2023-03-20 00:19:48] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 1 ms to minimize.
[2023-03-20 00:19:48] [INFO ] Deduced a trap composed of 20 places in 364 ms of which 1 ms to minimize.
[2023-03-20 00:19:49] [INFO ] Deduced a trap composed of 19 places in 485 ms of which 1 ms to minimize.
[2023-03-20 00:19:49] [INFO ] Deduced a trap composed of 21 places in 392 ms of which 1 ms to minimize.
[2023-03-20 00:19:49] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 2 ms to minimize.
[2023-03-20 00:19:50] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 0 ms to minimize.
[2023-03-20 00:19:50] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2023-03-20 00:19:50] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 1 ms to minimize.
[2023-03-20 00:19:51] [INFO ] Deduced a trap composed of 29 places in 204 ms of which 1 ms to minimize.
[2023-03-20 00:19:51] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 1 ms to minimize.
[2023-03-20 00:19:51] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 1 ms to minimize.
[2023-03-20 00:19:52] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 13 ms to minimize.
[2023-03-20 00:19:52] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 1 ms to minimize.
[2023-03-20 00:19:52] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 1 ms to minimize.
[2023-03-20 00:19:52] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 1 ms to minimize.
[2023-03-20 00:19:53] [INFO ] Deduced a trap composed of 34 places in 296 ms of which 2 ms to minimize.
[2023-03-20 00:19:53] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 0 ms to minimize.
[2023-03-20 00:19:53] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 0 ms to minimize.
[2023-03-20 00:19:53] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 1 ms to minimize.
[2023-03-20 00:19:54] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 1 ms to minimize.
[2023-03-20 00:19:54] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 0 ms to minimize.
[2023-03-20 00:19:54] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 1 ms to minimize.
[2023-03-20 00:19:54] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 1 ms to minimize.
[2023-03-20 00:19:54] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 10726 ms
[2023-03-20 00:19:55] [INFO ] Deduced a trap composed of 19 places in 342 ms of which 1 ms to minimize.
[2023-03-20 00:19:56] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 1 ms to minimize.
[2023-03-20 00:19:56] [INFO ] Deduced a trap composed of 18 places in 368 ms of which 1 ms to minimize.
[2023-03-20 00:19:56] [INFO ] Deduced a trap composed of 19 places in 452 ms of which 1 ms to minimize.
[2023-03-20 00:19:57] [INFO ] Deduced a trap composed of 18 places in 291 ms of which 1 ms to minimize.
[2023-03-20 00:19:57] [INFO ] Deduced a trap composed of 33 places in 323 ms of which 1 ms to minimize.
[2023-03-20 00:19:58] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 1 ms to minimize.
[2023-03-20 00:19:58] [INFO ] Deduced a trap composed of 26 places in 317 ms of which 1 ms to minimize.
[2023-03-20 00:19:58] [INFO ] Deduced a trap composed of 35 places in 246 ms of which 0 ms to minimize.
[2023-03-20 00:19:59] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 1 ms to minimize.
[2023-03-20 00:19:59] [INFO ] Deduced a trap composed of 14 places in 299 ms of which 2 ms to minimize.
[2023-03-20 00:19:59] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 6 ms to minimize.
[2023-03-20 00:20:00] [INFO ] Deduced a trap composed of 38 places in 262 ms of which 0 ms to minimize.
[2023-03-20 00:20:00] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 1 ms to minimize.
[2023-03-20 00:20:00] [INFO ] Deduced a trap composed of 27 places in 283 ms of which 1 ms to minimize.
[2023-03-20 00:20:01] [INFO ] Deduced a trap composed of 31 places in 369 ms of which 1 ms to minimize.
[2023-03-20 00:20:01] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 2 ms to minimize.
[2023-03-20 00:20:02] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 1 ms to minimize.
[2023-03-20 00:20:02] [INFO ] Deduced a trap composed of 26 places in 306 ms of which 0 ms to minimize.
[2023-03-20 00:20:02] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 1 ms to minimize.
[2023-03-20 00:20:02] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 1 ms to minimize.
[2023-03-20 00:20:03] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 1 ms to minimize.
[2023-03-20 00:20:03] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 0 ms to minimize.
[2023-03-20 00:20:04] [INFO ] Deduced a trap composed of 25 places in 406 ms of which 1 ms to minimize.
[2023-03-20 00:20:04] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 1 ms to minimize.
[2023-03-20 00:20:04] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 1 ms to minimize.
[2023-03-20 00:20:06] [INFO ] Deduced a trap composed of 18 places in 426 ms of which 0 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.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:20:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:20:06] [INFO ] After 25273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 194 ms.
Support contains 124 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1403 transition count 1063
Reduce places removed 240 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 482 place count 1163 transition count 1061
Reduce places removed 1 places and 0 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 2 with 39 rules applied. Total rules applied 521 place count 1162 transition count 1023
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 559 place count 1124 transition count 1023
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 91 Pre rules applied. Total rules applied 559 place count 1124 transition count 932
Deduced a syphon composed of 91 places in 2 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 741 place count 1033 transition count 932
Discarding 127 places :
Symmetric choice reduction at 4 with 127 rule applications. Total rules 868 place count 906 transition count 805
Iterating global reduction 4 with 127 rules applied. Total rules applied 995 place count 906 transition count 805
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 995 place count 906 transition count 764
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1077 place count 865 transition count 764
Performed 274 Post agglomeration using F-continuation condition.Transition count delta: 274
Deduced a syphon composed of 274 places in 1 ms
Reduce places removed 274 places and 0 transitions.
Iterating global reduction 4 with 548 rules applied. Total rules applied 1625 place count 591 transition count 490
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1703 place count 552 transition count 503
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 1708 place count 552 transition count 498
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1713 place count 547 transition count 498
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 1727 place count 547 transition count 498
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1728 place count 547 transition count 498
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1729 place count 546 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1730 place count 545 transition count 497
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1730 place count 545 transition count 496
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1732 place count 544 transition count 496
Applied a total of 1732 rules in 500 ms. Remains 544 /1403 variables (removed 859) and now considering 496/1303 (removed 807) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 502 ms. Remains : 544/1403 places, 496/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 6) seen :1
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 496 rows 544 cols
[2023-03-20 00:20:07] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-20 00:20:08] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:20:08] [INFO ] [Nat]Absence check using 180 positive place invariants in 41 ms returned sat
[2023-03-20 00:20:09] [INFO ] After 982ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:20:09] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-03-20 00:20:10] [INFO ] After 395ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:20:11] [INFO ] Deduced a trap composed of 11 places in 1118 ms of which 21 ms to minimize.
[2023-03-20 00:20:11] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2023-03-20 00:20:11] [INFO ] Deduced a trap composed of 13 places in 360 ms of which 0 ms to minimize.
[2023-03-20 00:20:12] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 14 ms to minimize.
[2023-03-20 00:20:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1830 ms
[2023-03-20 00:20:12] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2023-03-20 00:20:12] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 10 ms to minimize.
[2023-03-20 00:20:12] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 15 ms to minimize.
[2023-03-20 00:20:12] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2023-03-20 00:20:12] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2023-03-20 00:20:13] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 14 ms to minimize.
[2023-03-20 00:20:13] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2023-03-20 00:20:13] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2023-03-20 00:20:13] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-20 00:20:13] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2023-03-20 00:20:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1393 ms
[2023-03-20 00:20:13] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2023-03-20 00:20:13] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-20 00:20:14] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2023-03-20 00:20:14] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2023-03-20 00:20:14] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-20 00:20:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 596 ms
[2023-03-20 00:20:14] [INFO ] After 4586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 468 ms.
[2023-03-20 00:20:14] [INFO ] After 6528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 80 ms.
Support contains 77 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 496/496 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 544 transition count 486
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 534 transition count 486
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 20 place count 534 transition count 474
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 44 place count 522 transition count 474
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 520 transition count 472
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 520 transition count 472
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 129 place count 479 transition count 432
Renaming transitions due to excessive name length > 1024 char.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 137 place count 475 transition count 436
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 475 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 474 transition count 435
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 142 place count 474 transition count 435
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 473 transition count 434
Applied a total of 143 rules in 150 ms. Remains 473 /544 variables (removed 71) and now considering 434/496 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 473/544 places, 434/496 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 434 rows 473 cols
[2023-03-20 00:20:15] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:20:15] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 00:20:15] [INFO ] [Nat]Absence check using 179 positive place invariants in 24 ms returned sat
[2023-03-20 00:20:16] [INFO ] After 935ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 00:20:16] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-20 00:20:16] [INFO ] After 402ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 00:20:17] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2023-03-20 00:20:17] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2023-03-20 00:20:17] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2023-03-20 00:20:17] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2023-03-20 00:20:17] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2023-03-20 00:20:18] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2023-03-20 00:20:18] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2023-03-20 00:20:18] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2023-03-20 00:20:18] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2023-03-20 00:20:18] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2023-03-20 00:20:18] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2023-03-20 00:20:18] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2023-03-20 00:20:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1651 ms
[2023-03-20 00:20:19] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2023-03-20 00:20:19] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-20 00:20:19] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-20 00:20:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 413 ms
[2023-03-20 00:20:19] [INFO ] After 2880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 411 ms.
[2023-03-20 00:20:19] [INFO ] After 4404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 121 ms.
Support contains 74 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 434/434 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 473 transition count 433
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 472 transition count 433
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 0 with 2 rules applied. Total rules applied 4 place count 471 transition count 432
Applied a total of 4 rules in 21 ms. Remains 471 /473 variables (removed 2) and now considering 432/434 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 471/473 places, 432/434 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 432 rows 471 cols
[2023-03-20 00:20:20] [INFO ] Computed 179 place invariants in 4 ms
[2023-03-20 00:20:20] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:20:20] [INFO ] [Nat]Absence check using 179 positive place invariants in 150 ms returned sat
[2023-03-20 00:20:20] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:20] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-03-20 00:20:20] [INFO ] After 121ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:20] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2023-03-20 00:20:20] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2023-03-20 00:20:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2023-03-20 00:20:21] [INFO ] After 442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-20 00:20:21] [INFO ] After 1002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 24 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 432/432 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 471 transition count 422
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 22 place count 461 transition count 420
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 459 transition count 420
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 24 place count 459 transition count 408
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 48 place count 447 transition count 408
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 100 place count 421 transition count 382
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 120 place count 411 transition count 388
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 411 transition count 387
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 411 transition count 385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 409 transition count 385
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 133 place count 409 transition count 385
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 135 place count 407 transition count 383
Applied a total of 135 rules in 108 ms. Remains 407 /471 variables (removed 64) and now considering 383/432 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 407/471 places, 383/432 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 478995 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 478995 steps, saw 365963 distinct states, run finished after 3002 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 383 rows 407 cols
[2023-03-20 00:20:24] [INFO ] Computed 179 place invariants in 4 ms
[2023-03-20 00:20:24] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:20:24] [INFO ] [Nat]Absence check using 179 positive place invariants in 53 ms returned sat
[2023-03-20 00:20:24] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:24] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-20 00:20:24] [INFO ] After 41ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:25] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-20 00:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-20 00:20:25] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-20 00:20:25] [INFO ] After 658ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 24 out of 407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 383/383 transitions.
Applied a total of 0 rules in 18 ms. Remains 407 /407 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 407/407 places, 383/383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 383/383 transitions.
Applied a total of 0 rules in 13 ms. Remains 407 /407 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 00:20:25] [INFO ] Invariant cache hit.
[2023-03-20 00:20:25] [INFO ] Implicit Places using invariants in 395 ms returned [396]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 396 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 406/407 places, 383/383 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 405 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 405 transition count 382
Applied a total of 2 rules in 11 ms. Remains 405 /406 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 405 cols
[2023-03-20 00:20:25] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-20 00:20:25] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-20 00:20:25] [INFO ] Invariant cache hit.
[2023-03-20 00:20:26] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-20 00:20:26] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 405/407 places, 382/383 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1217 ms. Remains : 405/407 places, 382/383 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 577106 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{}
Probabilistic random walk after 577106 steps, saw 438903 distinct states, run finished after 3002 ms. (steps per millisecond=192 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:20:29] [INFO ] Invariant cache hit.
[2023-03-20 00:20:29] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:20:29] [INFO ] [Nat]Absence check using 178 positive place invariants in 24 ms returned sat
[2023-03-20 00:20:29] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:29] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-20 00:20:29] [INFO ] After 37ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:30] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2023-03-20 00:20:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-20 00:20:30] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-20 00:20:30] [INFO ] After 635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 24 out of 405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 382/382 transitions.
Applied a total of 0 rules in 18 ms. Remains 405 /405 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 405/405 places, 382/382 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 382/382 transitions.
Applied a total of 0 rules in 14 ms. Remains 405 /405 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-20 00:20:30] [INFO ] Invariant cache hit.
[2023-03-20 00:20:30] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-20 00:20:30] [INFO ] Invariant cache hit.
[2023-03-20 00:20:30] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-20 00:20:30] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2023-03-20 00:20:30] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-20 00:20:30] [INFO ] Invariant cache hit.
[2023-03-20 00:20:31] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1022 ms. Remains : 405/405 places, 382/382 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 405 transition count 382
Applied a total of 40 rules in 16 ms. Remains 405 /405 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 382 rows 405 cols
[2023-03-20 00:20:31] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:20:31] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:20:31] [INFO ] [Nat]Absence check using 178 positive place invariants in 29 ms returned sat
[2023-03-20 00:20:31] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:31] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-20 00:20:31] [INFO ] After 56ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:31] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-20 00:20:31] [INFO ] After 576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-20 00:20:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 405 places, 382 transitions and 1765 arcs took 9 ms.
[2023-03-20 00:20:32] [INFO ] Flatten gal took : 78 ms
Total runtime 52809 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-020B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
ReachabilityFireability

FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679271632860

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 ShieldIIPt-PT-020B-ReachabilityFireability-11
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 ShieldIIPt-PT-020B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 ShieldIIPt-PT-020B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 6 (type SRCH) for 0 ShieldIIPt-PT-020B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 6 (type SRCH) for ShieldIIPt-PT-020B-ReachabilityFireability-11
lola: result : true
lola: markings : 906
lola: fired transitions : 916
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for ShieldIIPt-PT-020B-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 4 (type EQUN) for ShieldIIPt-PT-020B-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 7 (type EXCL) for ShieldIIPt-PT-020B-ReachabilityFireability-11 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-020B-ReachabilityFireability-11: EF true tandem / insertion


Time elapsed: 0 secs. Pages in use: 2

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="ShieldIIPt-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPt-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715100287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020B.tgz
mv ShieldIIPt-PT-020B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;