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.r395-oct2-167903718600287.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 smartxred
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 r395-oct2-167903718600287
=====================================================================

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

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 08:37:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 08:37:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:37:26] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-23 08:37:26] [INFO ] Transformed 1403 places.
[2023-03-23 08:37:26] [INFO ] Transformed 1303 transitions.
[2023-03-23 08:37:26] [INFO ] Found NUPN structural information;
[2023-03-23 08:37:26] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 191 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 426 ms. (steps per millisecond=23 ) 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 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1303 rows 1403 cols
[2023-03-23 08:37:27] [INFO ] Computed 181 place invariants in 34 ms
[2023-03-23 08:37:28] [INFO ] After 688ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 08:37:28] [INFO ] [Nat]Absence check using 181 positive place invariants in 64 ms returned sat
[2023-03-23 08:37:30] [INFO ] After 1859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 08:37:31] [INFO ] Deduced a trap composed of 26 places in 352 ms of which 7 ms to minimize.
[2023-03-23 08:37:31] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 1 ms to minimize.
[2023-03-23 08:37:31] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 1 ms to minimize.
[2023-03-23 08:37:31] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 13 ms to minimize.
[2023-03-23 08:37:32] [INFO ] Deduced a trap composed of 25 places in 310 ms of which 18 ms to minimize.
[2023-03-23 08:37:32] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 2 ms to minimize.
[2023-03-23 08:37:32] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 1 ms to minimize.
[2023-03-23 08:37:33] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 0 ms to minimize.
[2023-03-23 08:37:33] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 1 ms to minimize.
[2023-03-23 08:37:33] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 1 ms to minimize.
[2023-03-23 08:37:34] [INFO ] Deduced a trap composed of 21 places in 297 ms of which 1 ms to minimize.
[2023-03-23 08:37:34] [INFO ] Deduced a trap composed of 20 places in 449 ms of which 1 ms to minimize.
[2023-03-23 08:37:34] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 2 ms to minimize.
[2023-03-23 08:37:35] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 1 ms to minimize.
[2023-03-23 08:37:35] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 1 ms to minimize.
[2023-03-23 08:37:35] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 1 ms to minimize.
[2023-03-23 08:37:36] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2023-03-23 08:37:36] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 1 ms to minimize.
[2023-03-23 08:37:36] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 1 ms to minimize.
[2023-03-23 08:37:37] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 1 ms to minimize.
[2023-03-23 08:37:37] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 0 ms to minimize.
[2023-03-23 08:37:37] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 4 ms to minimize.
[2023-03-23 08:37:37] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 1 ms to minimize.
[2023-03-23 08:37:38] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 0 ms to minimize.
[2023-03-23 08:37:38] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 4 ms to minimize.
[2023-03-23 08:37:38] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 0 ms to minimize.
[2023-03-23 08:37:38] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 0 ms to minimize.
[2023-03-23 08:37:39] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 1 ms to minimize.
[2023-03-23 08:37:39] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 1 ms to minimize.
[2023-03-23 08:37:39] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 0 ms to minimize.
[2023-03-23 08:37:39] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 0 ms to minimize.
[2023-03-23 08:37:39] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 1 ms to minimize.
[2023-03-23 08:37:40] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 1 ms to minimize.
[2023-03-23 08:37:40] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 9562 ms
[2023-03-23 08:37:40] [INFO ] Deduced a trap composed of 19 places in 342 ms of which 0 ms to minimize.
[2023-03-23 08:37:41] [INFO ] Deduced a trap composed of 12 places in 392 ms of which 1 ms to minimize.
[2023-03-23 08:37:41] [INFO ] Deduced a trap composed of 18 places in 352 ms of which 1 ms to minimize.
[2023-03-23 08:37:42] [INFO ] Deduced a trap composed of 19 places in 312 ms of which 1 ms to minimize.
[2023-03-23 08:37:42] [INFO ] Deduced a trap composed of 18 places in 417 ms of which 3 ms to minimize.
[2023-03-23 08:37:43] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 1 ms to minimize.
[2023-03-23 08:37:43] [INFO ] Deduced a trap composed of 20 places in 432 ms of which 2 ms to minimize.
[2023-03-23 08:37:43] [INFO ] Deduced a trap composed of 26 places in 328 ms of which 1 ms to minimize.
[2023-03-23 08:37:44] [INFO ] Deduced a trap composed of 35 places in 283 ms of which 1 ms to minimize.
[2023-03-23 08:37:44] [INFO ] Deduced a trap composed of 18 places in 319 ms of which 2 ms to minimize.
[2023-03-23 08:37:45] [INFO ] Deduced a trap composed of 14 places in 296 ms of which 0 ms to minimize.
[2023-03-23 08:37:45] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 1 ms to minimize.
[2023-03-23 08:37:45] [INFO ] Deduced a trap composed of 38 places in 262 ms of which 0 ms to minimize.
[2023-03-23 08:37:46] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 1 ms to minimize.
[2023-03-23 08:37:46] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 1 ms to minimize.
[2023-03-23 08:37:46] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 0 ms to minimize.
[2023-03-23 08:37:47] [INFO ] Deduced a trap composed of 19 places in 291 ms of which 1 ms to minimize.
[2023-03-23 08:37:47] [INFO ] Deduced a trap composed of 22 places in 294 ms of which 18 ms to minimize.
[2023-03-23 08:37:47] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 2 ms to minimize.
[2023-03-23 08:37:48] [INFO ] Deduced a trap composed of 25 places in 311 ms of which 1 ms to minimize.
[2023-03-23 08:37:48] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 0 ms to minimize.
[2023-03-23 08:37:48] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 1 ms to minimize.
[2023-03-23 08:37:49] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 1 ms to minimize.
[2023-03-23 08:37:49] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 1 ms to minimize.
[2023-03-23 08:37:49] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 0 ms to minimize.
[2023-03-23 08:37:50] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 0 ms to minimize.
[2023-03-23 08:37:52] [INFO ] Deduced a trap composed of 18 places in 391 ms of which 1 ms to minimize.
[2023-03-23 08:37:52] [INFO ] Deduced a trap composed of 17 places in 297 ms of which 1 ms to minimize.
[2023-03-23 08:37:53] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 0 ms to minimize.
[2023-03-23 08:37:53] [INFO ] Deduced a trap composed of 23 places in 278 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.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-23 08:37:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 08:37:53] [INFO ] After 25312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 220 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 2 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 3 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 440 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 441 ms. Remains : 544/1403 places, 496/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :1
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) 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 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 57 ms. (steps per millisecond=175 ) properties (out of 4) 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 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-23 08:37:54] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-23 08:37:54] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 08:37:54] [INFO ] [Nat]Absence check using 180 positive place invariants in 51 ms returned sat
[2023-03-23 08:37:55] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 08:37:55] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-03-23 08:37:55] [INFO ] After 376ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 08:37:55] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-23 08:37:55] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2023-03-23 08:37:56] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 14 ms to minimize.
[2023-03-23 08:37:56] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2023-03-23 08:37:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 633 ms
[2023-03-23 08:37:56] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 2 ms to minimize.
[2023-03-23 08:37:56] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2023-03-23 08:37:57] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 0 ms to minimize.
[2023-03-23 08:37:57] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2023-03-23 08:37:57] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 0 ms to minimize.
[2023-03-23 08:37:57] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-23 08:37:57] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 0 ms to minimize.
[2023-03-23 08:37:57] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2023-03-23 08:37:58] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-23 08:37:58] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2023-03-23 08:37:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1697 ms
[2023-03-23 08:37:58] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2023-03-23 08:37:58] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-23 08:37:58] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2023-03-23 08:37:58] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2023-03-23 08:37:58] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-23 08:37:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 664 ms
[2023-03-23 08:37:58] [INFO ] After 3713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 437 ms.
[2023-03-23 08:37:59] [INFO ] After 4770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 121 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 98 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 100 ms. Remains : 473/544 places, 434/496 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) 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 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 434 rows 473 cols
[2023-03-23 08:37:59] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-23 08:37:59] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:38:00] [INFO ] [Nat]Absence check using 179 positive place invariants in 40 ms returned sat
[2023-03-23 08:38:00] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:38:00] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-23 08:38:01] [INFO ] After 435ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:38:01] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2023-03-23 08:38:01] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2023-03-23 08:38:01] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2023-03-23 08:38:01] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2023-03-23 08:38:01] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2023-03-23 08:38:02] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2023-03-23 08:38:02] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2023-03-23 08:38:02] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2023-03-23 08:38:02] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 4 ms to minimize.
[2023-03-23 08:38:02] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2023-03-23 08:38:02] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2023-03-23 08:38:03] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2023-03-23 08:38:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1944 ms
[2023-03-23 08:38:03] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
[2023-03-23 08:38:03] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-23 08:38:03] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 1 ms to minimize.
[2023-03-23 08:38:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 593 ms
[2023-03-23 08:38:03] [INFO ] After 3354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 413 ms.
[2023-03-23 08:38:04] [INFO ] After 4420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 170 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 0 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 30 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 30 ms. Remains : 471/473 places, 432/434 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 201447 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 201447 steps, saw 135897 distinct states, run finished after 3002 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 432 rows 471 cols
[2023-03-23 08:38:07] [INFO ] Computed 179 place invariants in 3 ms
[2023-03-23 08:38:07] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:38:08] [INFO ] [Nat]Absence check using 179 positive place invariants in 25 ms returned sat
[2023-03-23 08:38:08] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:38:08] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-03-23 08:38:08] [INFO ] After 490ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:38:09] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-23 08:38:09] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2023-03-23 08:38:09] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2023-03-23 08:38:09] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2023-03-23 08:38:09] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2023-03-23 08:38:09] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2023-03-23 08:38:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 753 ms
[2023-03-23 08:38:10] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2023-03-23 08:38:10] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2023-03-23 08:38:10] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2023-03-23 08:38:10] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2023-03-23 08:38:10] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-23 08:38:10] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2023-03-23 08:38:10] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-23 08:38:10] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2023-03-23 08:38:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 834 ms
[2023-03-23 08:38:11] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2023-03-23 08:38:11] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2023-03-23 08:38:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2023-03-23 08:38:11] [INFO ] After 2742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 361 ms.
[2023-03-23 08:38:11] [INFO ] After 3567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 71 ms.
Support contains 74 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 432/432 transitions.
Applied a total of 0 rules in 14 ms. Remains 471 /471 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 471/471 places, 432/432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 432/432 transitions.
Applied a total of 0 rules in 14 ms. Remains 471 /471 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2023-03-23 08:38:11] [INFO ] Invariant cache hit.
[2023-03-23 08:38:11] [INFO ] Implicit Places using invariants in 315 ms returned [457]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 326 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 470/471 places, 432/432 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 469 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 431
Applied a total of 2 rules in 19 ms. Remains 469 /470 variables (removed 1) and now considering 431/432 (removed 1) transitions.
// Phase 1: matrix 431 rows 469 cols
[2023-03-23 08:38:11] [INFO ] Computed 178 place invariants in 15 ms
[2023-03-23 08:38:12] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-23 08:38:12] [INFO ] Invariant cache hit.
[2023-03-23 08:38:12] [INFO ] State equation strengthened by 109 read => feed constraints.
[2023-03-23 08:38:13] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 469/471 places, 431/432 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1885 ms. Remains : 469/471 places, 431/432 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 210951 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 210951 steps, saw 143035 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 08:38:16] [INFO ] Invariant cache hit.
[2023-03-23 08:38:16] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:38:17] [INFO ] [Nat]Absence check using 178 positive place invariants in 31 ms returned sat
[2023-03-23 08:38:17] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:38:17] [INFO ] State equation strengthened by 109 read => feed constraints.
[2023-03-23 08:38:17] [INFO ] After 426ms SMT Verify possible using 109 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:38:18] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2023-03-23 08:38:18] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-23 08:38:18] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2023-03-23 08:38:18] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2023-03-23 08:38:19] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2023-03-23 08:38:19] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-23 08:38:19] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 13 ms to minimize.
[2023-03-23 08:38:19] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2023-03-23 08:38:19] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2023-03-23 08:38:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1303 ms
[2023-03-23 08:38:19] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2023-03-23 08:38:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-23 08:38:20] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2023-03-23 08:38:20] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2023-03-23 08:38:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-03-23 08:38:20] [INFO ] After 2619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 280 ms.
[2023-03-23 08:38:20] [INFO ] After 3572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 95 ms.
Support contains 74 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 431/431 transitions.
Applied a total of 0 rules in 8 ms. Remains 469 /469 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 469/469 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 431/431 transitions.
Applied a total of 0 rules in 8 ms. Remains 469 /469 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2023-03-23 08:38:20] [INFO ] Invariant cache hit.
[2023-03-23 08:38:20] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-23 08:38:20] [INFO ] Invariant cache hit.
[2023-03-23 08:38:21] [INFO ] State equation strengthened by 109 read => feed constraints.
[2023-03-23 08:38:21] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
[2023-03-23 08:38:21] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-23 08:38:21] [INFO ] Invariant cache hit.
[2023-03-23 08:38:22] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1590 ms. Remains : 469/469 places, 431/431 transitions.
Partial Free-agglomeration rule applied 55 times.
Drop transitions removed 55 transitions
Iterating global reduction 0 with 55 rules applied. Total rules applied 55 place count 469 transition count 431
Applied a total of 55 rules in 15 ms. Remains 469 /469 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 431 rows 469 cols
[2023-03-23 08:38:22] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-23 08:38:22] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:38:22] [INFO ] [Nat]Absence check using 178 positive place invariants in 93 ms returned sat
[2023-03-23 08:38:22] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:38:22] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-23 08:38:23] [INFO ] After 455ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:38:23] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-03-23 08:38:23] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2023-03-23 08:38:23] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2023-03-23 08:38:23] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2023-03-23 08:38:24] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2023-03-23 08:38:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 739 ms
[2023-03-23 08:38:24] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2023-03-23 08:38:24] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2023-03-23 08:38:24] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 0 ms to minimize.
[2023-03-23 08:38:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 316 ms
[2023-03-23 08:38:24] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2023-03-23 08:38:24] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2023-03-23 08:38:24] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2023-03-23 08:38:24] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2023-03-23 08:38:24] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-23 08:38:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 421 ms
[2023-03-23 08:38:25] [INFO ] After 2160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 355 ms.
[2023-03-23 08:38:25] [INFO ] After 3121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:38:25] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 20 ms.
[2023-03-23 08:38:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 469 places, 431 transitions and 1881 arcs took 3 ms.
[2023-03-23 08:38:25] [INFO ] Flatten gal took : 64 ms
Total runtime 59475 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 020B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 469 places, 431 transitions, 1881 arcs.
Final Score: 20375.184
Took : 17 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679560723511

--------------------
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
ERROR in file model.sm near line 2802:
syntax error

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="smartxred"
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 smartxred"
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 r395-oct2-167903718600287"
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 ;