fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r427-tajo-167905979300143
Last Updated
May 14, 2023

About the Execution of Smart+red for ShieldRVs-PT-040B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
523.651 146611.00 177192.00 101.10 FTF?T?FTT?FT?TFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r427-tajo-167905979300143.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979300143
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679380171942

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=ShieldRVs-PT-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 06:29:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 06:29:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 06:29:33] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-21 06:29:33] [INFO ] Transformed 1603 places.
[2023-03-21 06:29:33] [INFO ] Transformed 1803 transitions.
[2023-03-21 06:29:33] [INFO ] Found NUPN structural information;
[2023-03-21 06:29:33] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 16) seen :8
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1803 rows 1603 cols
[2023-03-21 06:29:34] [INFO ] Computed 161 place invariants in 28 ms
[2023-03-21 06:29:35] [INFO ] After 560ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 06:29:35] [INFO ] [Nat]Absence check using 161 positive place invariants in 62 ms returned sat
[2023-03-21 06:29:39] [INFO ] After 3801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 06:29:41] [INFO ] Deduced a trap composed of 24 places in 691 ms of which 10 ms to minimize.
[2023-03-21 06:29:41] [INFO ] Deduced a trap composed of 39 places in 617 ms of which 2 ms to minimize.
[2023-03-21 06:29:42] [INFO ] Deduced a trap composed of 26 places in 584 ms of which 2 ms to minimize.
[2023-03-21 06:29:43] [INFO ] Deduced a trap composed of 23 places in 552 ms of which 2 ms to minimize.
[2023-03-21 06:29:43] [INFO ] Deduced a trap composed of 37 places in 581 ms of which 2 ms to minimize.
[2023-03-21 06:29:44] [INFO ] Deduced a trap composed of 32 places in 545 ms of which 1 ms to minimize.
[2023-03-21 06:29:45] [INFO ] Deduced a trap composed of 32 places in 500 ms of which 2 ms to minimize.
[2023-03-21 06:29:45] [INFO ] Deduced a trap composed of 34 places in 544 ms of which 1 ms to minimize.
[2023-03-21 06:29:46] [INFO ] Deduced a trap composed of 39 places in 539 ms of which 1 ms to minimize.
[2023-03-21 06:29:46] [INFO ] Deduced a trap composed of 24 places in 514 ms of which 2 ms to minimize.
[2023-03-21 06:29:47] [INFO ] Deduced a trap composed of 25 places in 498 ms of which 1 ms to minimize.
[2023-03-21 06:29:48] [INFO ] Deduced a trap composed of 37 places in 527 ms of which 1 ms to minimize.
[2023-03-21 06:29:48] [INFO ] Deduced a trap composed of 51 places in 458 ms of which 1 ms to minimize.
[2023-03-21 06:29:49] [INFO ] Deduced a trap composed of 45 places in 483 ms of which 2 ms to minimize.
[2023-03-21 06:29:49] [INFO ] Deduced a trap composed of 36 places in 464 ms of which 1 ms to minimize.
[2023-03-21 06:29:50] [INFO ] Deduced a trap composed of 22 places in 340 ms of which 1 ms to minimize.
[2023-03-21 06:29:50] [INFO ] Deduced a trap composed of 26 places in 431 ms of which 1 ms to minimize.
[2023-03-21 06:29:51] [INFO ] Deduced a trap composed of 38 places in 441 ms of which 1 ms to minimize.
[2023-03-21 06:29:51] [INFO ] Deduced a trap composed of 37 places in 443 ms of which 1 ms to minimize.
[2023-03-21 06:29:52] [INFO ] Deduced a trap composed of 32 places in 450 ms of which 1 ms to minimize.
[2023-03-21 06:29:52] [INFO ] Deduced a trap composed of 34 places in 458 ms of which 1 ms to minimize.
[2023-03-21 06:29:53] [INFO ] Deduced a trap composed of 37 places in 432 ms of which 2 ms to minimize.
[2023-03-21 06:29:53] [INFO ] Deduced a trap composed of 61 places in 426 ms of which 1 ms to minimize.
[2023-03-21 06:29:54] [INFO ] Deduced a trap composed of 47 places in 439 ms of which 2 ms to minimize.
[2023-03-21 06:29:54] [INFO ] Deduced a trap composed of 36 places in 453 ms of which 1 ms to minimize.
[2023-03-21 06:29:55] [INFO ] Deduced a trap composed of 49 places in 455 ms of which 3 ms to minimize.
[2023-03-21 06:29:55] [INFO ] Deduced a trap composed of 40 places in 427 ms of which 1 ms to minimize.
[2023-03-21 06:29:56] [INFO ] Deduced a trap composed of 59 places in 429 ms of which 1 ms to minimize.
[2023-03-21 06:29:56] [INFO ] Deduced a trap composed of 32 places in 427 ms of which 1 ms to minimize.
[2023-03-21 06:29:57] [INFO ] Deduced a trap composed of 29 places in 432 ms of which 1 ms to minimize.
[2023-03-21 06:29:57] [INFO ] Deduced a trap composed of 39 places in 425 ms of which 1 ms to minimize.
[2023-03-21 06:29:58] [INFO ] Deduced a trap composed of 45 places in 438 ms of which 1 ms to minimize.
[2023-03-21 06:29:58] [INFO ] Deduced a trap composed of 31 places in 407 ms of which 1 ms to minimize.
[2023-03-21 06:29:59] [INFO ] Deduced a trap composed of 40 places in 419 ms of which 3 ms to minimize.
[2023-03-21 06:29:59] [INFO ] Deduced a trap composed of 37 places in 422 ms of which 1 ms to minimize.
[2023-03-21 06:30:00] [INFO ] Deduced a trap composed of 28 places in 423 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-21 06:30:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 06:30:00] [INFO ] After 25212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 610 ms.
Support contains 157 out of 1603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 1603 transition count 1673
Reduce places removed 130 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 134 rules applied. Total rules applied 264 place count 1473 transition count 1669
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 268 place count 1469 transition count 1669
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 191 Pre rules applied. Total rules applied 268 place count 1469 transition count 1478
Deduced a syphon composed of 191 places in 5 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 3 with 382 rules applied. Total rules applied 650 place count 1278 transition count 1478
Discarding 243 places :
Symmetric choice reduction at 3 with 243 rule applications. Total rules 893 place count 1035 transition count 1235
Iterating global reduction 3 with 243 rules applied. Total rules applied 1136 place count 1035 transition count 1235
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 1136 place count 1035 transition count 1162
Deduced a syphon composed of 73 places in 3 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 1282 place count 962 transition count 1162
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Deduced a syphon composed of 252 places in 4 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 504 rules applied. Total rules applied 1786 place count 710 transition count 910
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 3 with 70 rules applied. Total rules applied 1856 place count 710 transition count 910
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1857 place count 709 transition count 909
Applied a total of 1857 rules in 527 ms. Remains 709 /1603 variables (removed 894) and now considering 909/1803 (removed 894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 528 ms. Remains : 709/1603 places, 909/1803 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 7) seen :2
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 909 rows 709 cols
[2023-03-21 06:30:01] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-21 06:30:02] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 06:30:02] [INFO ] [Nat]Absence check using 161 positive place invariants in 21 ms returned sat
[2023-03-21 06:30:03] [INFO ] After 929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 06:30:03] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 0 ms to minimize.
[2023-03-21 06:30:03] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2023-03-21 06:30:04] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2023-03-21 06:30:04] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 2 ms to minimize.
[2023-03-21 06:30:04] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 0 ms to minimize.
[2023-03-21 06:30:04] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 0 ms to minimize.
[2023-03-21 06:30:04] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 0 ms to minimize.
[2023-03-21 06:30:05] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
[2023-03-21 06:30:05] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 0 ms to minimize.
[2023-03-21 06:30:05] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 0 ms to minimize.
[2023-03-21 06:30:05] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 0 ms to minimize.
[2023-03-21 06:30:06] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 0 ms to minimize.
[2023-03-21 06:30:06] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2023-03-21 06:30:06] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 0 ms to minimize.
[2023-03-21 06:30:06] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 1 ms to minimize.
[2023-03-21 06:30:06] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2023-03-21 06:30:07] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2023-03-21 06:30:07] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2023-03-21 06:30:07] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2023-03-21 06:30:07] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2023-03-21 06:30:07] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2023-03-21 06:30:08] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2023-03-21 06:30:08] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2023-03-21 06:30:08] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2023-03-21 06:30:08] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2023-03-21 06:30:08] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2023-03-21 06:30:09] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2023-03-21 06:30:09] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-21 06:30:09] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2023-03-21 06:30:09] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2023-03-21 06:30:09] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2023-03-21 06:30:09] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
[2023-03-21 06:30:10] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2023-03-21 06:30:10] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-21 06:30:10] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 0 ms to minimize.
[2023-03-21 06:30:10] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 7078 ms
[2023-03-21 06:30:10] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 0 ms to minimize.
[2023-03-21 06:30:10] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2023-03-21 06:30:11] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2023-03-21 06:30:11] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
[2023-03-21 06:30:11] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2023-03-21 06:30:11] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2023-03-21 06:30:11] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 0 ms to minimize.
[2023-03-21 06:30:11] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2023-03-21 06:30:12] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-21 06:30:12] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2023-03-21 06:30:12] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2023-03-21 06:30:12] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2023-03-21 06:30:12] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2083 ms
[2023-03-21 06:30:13] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2023-03-21 06:30:13] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 0 ms to minimize.
[2023-03-21 06:30:13] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2023-03-21 06:30:13] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2023-03-21 06:30:13] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 0 ms to minimize.
[2023-03-21 06:30:13] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2023-03-21 06:30:14] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2023-03-21 06:30:14] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2023-03-21 06:30:14] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-21 06:30:14] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-21 06:30:14] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-21 06:30:14] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-03-21 06:30:14] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2023-03-21 06:30:14] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2023-03-21 06:30:15] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2023-03-21 06:30:15] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2023-03-21 06:30:15] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2399 ms
[2023-03-21 06:30:15] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 0 ms to minimize.
[2023-03-21 06:30:15] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 0 ms to minimize.
[2023-03-21 06:30:16] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2023-03-21 06:30:16] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2023-03-21 06:30:16] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-21 06:30:16] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2023-03-21 06:30:16] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2023-03-21 06:30:17] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2023-03-21 06:30:17] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 0 ms to minimize.
[2023-03-21 06:30:17] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2023-03-21 06:30:17] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2023-03-21 06:30:17] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2023-03-21 06:30:17] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2023-03-21 06:30:18] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2023-03-21 06:30:18] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2023-03-21 06:30:18] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2023-03-21 06:30:18] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2023-03-21 06:30:18] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2023-03-21 06:30:18] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2023-03-21 06:30:18] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-21 06:30:19] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3538 ms
[2023-03-21 06:30:19] [INFO ] After 16840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 743 ms.
[2023-03-21 06:30:19] [INFO ] After 17749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 148 ms.
Support contains 152 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 909/909 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 709 transition count 907
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 707 transition count 907
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 707 transition count 906
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 706 transition count 906
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 702 transition count 902
Applied a total of 14 rules in 89 ms. Remains 702 /709 variables (removed 7) and now considering 902/909 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 702/709 places, 902/909 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 5) seen :1
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) 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 4) 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 4) seen :0
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
Running SMT prover for 4 properties.
// Phase 1: matrix 902 rows 702 cols
[2023-03-21 06:30:20] [INFO ] Computed 161 place invariants in 16 ms
[2023-03-21 06:30:20] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 06:30:20] [INFO ] [Nat]Absence check using 161 positive place invariants in 29 ms returned sat
[2023-03-21 06:30:21] [INFO ] After 866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 06:30:22] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 0 ms to minimize.
[2023-03-21 06:30:22] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 1 ms to minimize.
[2023-03-21 06:30:22] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 0 ms to minimize.
[2023-03-21 06:30:22] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2023-03-21 06:30:23] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 1 ms to minimize.
[2023-03-21 06:30:23] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2023-03-21 06:30:23] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2023-03-21 06:30:23] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2023-03-21 06:30:23] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2023-03-21 06:30:24] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-21 06:30:24] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2023-03-21 06:30:24] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 0 ms to minimize.
[2023-03-21 06:30:24] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 0 ms to minimize.
[2023-03-21 06:30:24] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2023-03-21 06:30:24] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2023-03-21 06:30:25] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2023-03-21 06:30:25] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2023-03-21 06:30:25] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 0 ms to minimize.
[2023-03-21 06:30:25] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-21 06:30:25] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2023-03-21 06:30:26] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 0 ms to minimize.
[2023-03-21 06:30:26] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
[2023-03-21 06:30:26] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2023-03-21 06:30:26] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2023-03-21 06:30:26] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2023-03-21 06:30:27] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-21 06:30:27] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2023-03-21 06:30:27] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2023-03-21 06:30:27] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2023-03-21 06:30:27] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2023-03-21 06:30:27] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-21 06:30:28] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2023-03-21 06:30:28] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2023-03-21 06:30:28] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2023-03-21 06:30:28] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2023-03-21 06:30:28] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2023-03-21 06:30:28] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 6705 ms
[2023-03-21 06:30:28] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2023-03-21 06:30:29] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 0 ms to minimize.
[2023-03-21 06:30:29] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2023-03-21 06:30:29] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2023-03-21 06:30:29] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 0 ms to minimize.
[2023-03-21 06:30:29] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2023-03-21 06:30:29] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2023-03-21 06:30:29] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2023-03-21 06:30:29] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2023-03-21 06:30:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1167 ms
[2023-03-21 06:30:30] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2023-03-21 06:30:30] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-21 06:30:30] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2023-03-21 06:30:30] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2023-03-21 06:30:30] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-21 06:30:31] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2023-03-21 06:30:31] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2023-03-21 06:30:31] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-21 06:30:31] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2023-03-21 06:30:31] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2023-03-21 06:30:31] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2023-03-21 06:30:31] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2023-03-21 06:30:32] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2023-03-21 06:30:32] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2023-03-21 06:30:32] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-03-21 06:30:32] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2023-03-21 06:30:32] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2023-03-21 06:30:32] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2023-03-21 06:30:32] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2023-03-21 06:30:33] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2861 ms
[2023-03-21 06:30:33] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 0 ms to minimize.
[2023-03-21 06:30:33] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 1 ms to minimize.
[2023-03-21 06:30:33] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-21 06:30:34] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 1 ms to minimize.
[2023-03-21 06:30:34] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2023-03-21 06:30:34] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2023-03-21 06:30:34] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2023-03-21 06:30:34] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2023-03-21 06:30:34] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2023-03-21 06:30:34] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-03-21 06:30:35] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2023-03-21 06:30:35] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2023-03-21 06:30:35] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2023-03-21 06:30:35] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2023-03-21 06:30:35] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-21 06:30:35] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-21 06:30:35] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2023-03-21 06:30:35] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2023-03-21 06:30:35] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2769 ms
[2023-03-21 06:30:35] [INFO ] After 14980ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 772 ms.
[2023-03-21 06:30:36] [INFO ] After 15985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 135 ms.
Support contains 151 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 902/902 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 701 transition count 901
Applied a total of 2 rules in 48 ms. Remains 701 /702 variables (removed 1) and now considering 901/902 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 701/702 places, 901/902 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 199859 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199859 steps, saw 51270 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 901 rows 701 cols
[2023-03-21 06:30:40] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-21 06:30:40] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 06:30:40] [INFO ] [Nat]Absence check using 161 positive place invariants in 19 ms returned sat
[2023-03-21 06:30:41] [INFO ] After 676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 06:30:41] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-21 06:30:41] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-21 06:30:42] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-21 06:30:42] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-21 06:30:42] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 1 ms to minimize.
[2023-03-21 06:30:42] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2023-03-21 06:30:42] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2023-03-21 06:30:42] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2023-03-21 06:30:43] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2023-03-21 06:30:43] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 1 ms to minimize.
[2023-03-21 06:30:43] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2023-03-21 06:30:43] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2023-03-21 06:30:43] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2023-03-21 06:30:43] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2023-03-21 06:30:44] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2023-03-21 06:30:44] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2023-03-21 06:30:44] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2023-03-21 06:30:44] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-21 06:30:44] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2023-03-21 06:30:44] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2023-03-21 06:30:44] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2023-03-21 06:30:45] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2023-03-21 06:30:45] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2023-03-21 06:30:45] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2023-03-21 06:30:45] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2023-03-21 06:30:45] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2023-03-21 06:30:45] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2023-03-21 06:30:45] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2023-03-21 06:30:46] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2023-03-21 06:30:46] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-03-21 06:30:46] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2023-03-21 06:30:46] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2023-03-21 06:30:46] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2023-03-21 06:30:46] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2023-03-21 06:30:46] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2023-03-21 06:30:46] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5284 ms
[2023-03-21 06:30:47] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2023-03-21 06:30:47] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2023-03-21 06:30:47] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-21 06:30:47] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2023-03-21 06:30:47] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2023-03-21 06:30:47] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2023-03-21 06:30:47] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2023-03-21 06:30:48] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-21 06:30:48] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2023-03-21 06:30:48] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2023-03-21 06:30:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1483 ms
[2023-03-21 06:30:48] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2023-03-21 06:30:48] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2023-03-21 06:30:48] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2023-03-21 06:30:49] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2023-03-21 06:30:49] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2023-03-21 06:30:49] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2023-03-21 06:30:49] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2023-03-21 06:30:49] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2023-03-21 06:30:49] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2023-03-21 06:30:49] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-21 06:30:50] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2023-03-21 06:30:50] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2023-03-21 06:30:50] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2023-03-21 06:30:50] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2023-03-21 06:30:50] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2008 ms
[2023-03-21 06:30:50] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 1 ms to minimize.
[2023-03-21 06:30:51] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2023-03-21 06:30:51] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2023-03-21 06:30:51] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2023-03-21 06:30:51] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2023-03-21 06:30:51] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2023-03-21 06:30:51] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2023-03-21 06:30:51] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-21 06:30:52] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 0 ms to minimize.
[2023-03-21 06:30:52] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2023-03-21 06:30:52] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2023-03-21 06:30:52] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2023-03-21 06:30:52] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-21 06:30:52] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2023-03-21 06:30:52] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2023-03-21 06:30:52] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2023-03-21 06:30:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2318 ms
[2023-03-21 06:30:53] [INFO ] After 12312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 712 ms.
[2023-03-21 06:30:53] [INFO ] After 13154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 111 ms.
Support contains 151 out of 701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 901/901 transitions.
Applied a total of 0 rules in 25 ms. Remains 701 /701 variables (removed 0) and now considering 901/901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 701/701 places, 901/901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 901/901 transitions.
Applied a total of 0 rules in 22 ms. Remains 701 /701 variables (removed 0) and now considering 901/901 (removed 0) transitions.
[2023-03-21 06:30:53] [INFO ] Invariant cache hit.
[2023-03-21 06:30:54] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-21 06:30:54] [INFO ] Invariant cache hit.
[2023-03-21 06:30:55] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
[2023-03-21 06:30:55] [INFO ] Redundant transitions in 149 ms returned []
[2023-03-21 06:30:55] [INFO ] Invariant cache hit.
[2023-03-21 06:30:55] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1715 ms. Remains : 701/701 places, 901/901 transitions.
Applied a total of 0 rules in 22 ms. Remains 701 /701 variables (removed 0) and now considering 901/901 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-21 06:30:55] [INFO ] Invariant cache hit.
[2023-03-21 06:30:55] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 06:30:55] [INFO ] [Nat]Absence check using 161 positive place invariants in 26 ms returned sat
[2023-03-21 06:30:56] [INFO ] After 714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 06:30:56] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2023-03-21 06:30:57] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2023-03-21 06:30:57] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2023-03-21 06:30:57] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2023-03-21 06:30:57] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2023-03-21 06:30:57] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 0 ms to minimize.
[2023-03-21 06:30:58] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-21 06:30:58] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
[2023-03-21 06:30:58] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 0 ms to minimize.
[2023-03-21 06:30:58] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2023-03-21 06:30:58] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2023-03-21 06:30:58] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2023-03-21 06:30:58] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2023-03-21 06:30:59] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2023-03-21 06:30:59] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-21 06:30:59] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2023-03-21 06:30:59] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2023-03-21 06:30:59] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2023-03-21 06:30:59] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2023-03-21 06:30:59] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2023-03-21 06:31:00] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2023-03-21 06:31:00] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2023-03-21 06:31:00] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2023-03-21 06:31:00] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2023-03-21 06:31:00] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3810 ms
[2023-03-21 06:31:00] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-21 06:31:00] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2023-03-21 06:31:01] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2023-03-21 06:31:01] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2023-03-21 06:31:01] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2023-03-21 06:31:01] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2023-03-21 06:31:01] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2023-03-21 06:31:01] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-21 06:31:01] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2023-03-21 06:31:01] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-21 06:31:02] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2023-03-21 06:31:02] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2023-03-21 06:31:02] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2023-03-21 06:31:02] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-21 06:31:02] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2023-03-21 06:31:02] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1827 ms
[2023-03-21 06:31:02] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-21 06:31:02] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-21 06:31:03] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2023-03-21 06:31:03] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2023-03-21 06:31:03] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2023-03-21 06:31:03] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-03-21 06:31:03] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2023-03-21 06:31:03] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2023-03-21 06:31:04] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2023-03-21 06:31:04] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
[2023-03-21 06:31:04] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2023-03-21 06:31:04] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-03-21 06:31:04] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-21 06:31:04] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2023-03-21 06:31:04] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-21 06:31:04] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2023-03-21 06:31:04] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2023-03-21 06:31:05] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2023-03-21 06:31:05] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2459 ms
[2023-03-21 06:31:05] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2023-03-21 06:31:05] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2023-03-21 06:31:05] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-21 06:31:05] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 0 ms to minimize.
[2023-03-21 06:31:06] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2023-03-21 06:31:06] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2023-03-21 06:31:06] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-21 06:31:06] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-21 06:31:06] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-21 06:31:06] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-21 06:31:06] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2023-03-21 06:31:07] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-21 06:31:07] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2023-03-21 06:31:07] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 0 ms to minimize.
[2023-03-21 06:31:07] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2023-03-21 06:31:07] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2023-03-21 06:31:07] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-21 06:31:07] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2023-03-21 06:31:07] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2503 ms
[2023-03-21 06:31:07] [INFO ] After 11929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 704 ms.
[2023-03-21 06:31:08] [INFO ] After 12805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-21 06:31:08] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-21 06:31:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 701 places, 901 transitions and 4078 arcs took 4 ms.
[2023-03-21 06:31:08] [INFO ] Flatten gal took : 107 ms
Total runtime 95419 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVs (PT), instance 040B
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: 701 places, 901 transitions, 4078 arcs.
Final Score: 41884.591
Took : 49 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679380318553

--------------------
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 5705:
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="ShieldRVs-PT-040B"
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 ShieldRVs-PT-040B, 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 r427-tajo-167905979300143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040B.tgz
mv ShieldRVs-PT-040B execution
cd execution
if [ "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 ;