fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LTSMin+red for ShieldPPPt-PT-040B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6877.911 3600000.00 14104252.00 43.80 ??T???T?TT??TTF? normal

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.r393-oct2-167903717300671.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 ltsminxred
Input is ShieldPPPt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300671
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:46 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.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 762K 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 ShieldPPPt-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679468240713

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 06:57:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:57:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:57:23] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2023-03-22 06:57:23] [INFO ] Transformed 3123 places.
[2023-03-22 06:57:23] [INFO ] Transformed 2843 transitions.
[2023-03-22 06:57:23] [INFO ] Found NUPN structural information;
[2023-03-22 06:57:23] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 386 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 16) seen :6
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2843 rows 3123 cols
[2023-03-22 06:57:24] [INFO ] Computed 441 place invariants in 66 ms
[2023-03-22 06:57:26] [INFO ] After 1800ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 06:57:28] [INFO ] [Nat]Absence check using 441 positive place invariants in 409 ms returned sat
[2023-03-22 06:57:39] [INFO ] After 10291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 06:57:40] [INFO ] Deduced a trap composed of 20 places in 880 ms of which 9 ms to minimize.
[2023-03-22 06:57:41] [INFO ] Deduced a trap composed of 25 places in 1015 ms of which 2 ms to minimize.
[2023-03-22 06:57:42] [INFO ] Deduced a trap composed of 18 places in 997 ms of which 3 ms to minimize.
[2023-03-22 06:57:43] [INFO ] Deduced a trap composed of 22 places in 987 ms of which 5 ms to minimize.
[2023-03-22 06:57:44] [INFO ] Deduced a trap composed of 26 places in 987 ms of which 3 ms to minimize.
[2023-03-22 06:57:46] [INFO ] Deduced a trap composed of 24 places in 877 ms of which 1 ms to minimize.
[2023-03-22 06:57:47] [INFO ] Deduced a trap composed of 35 places in 961 ms of which 3 ms to minimize.
[2023-03-22 06:57:48] [INFO ] Deduced a trap composed of 32 places in 1168 ms of which 2 ms to minimize.
[2023-03-22 06:57:49] [INFO ] Deduced a trap composed of 28 places in 913 ms of which 3 ms to minimize.
[2023-03-22 06:57:50] [INFO ] Deduced a trap composed of 31 places in 956 ms of which 1 ms to minimize.
[2023-03-22 06:57:51] [INFO ] Deduced a trap composed of 24 places in 1007 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-22 06:57:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 06:57:51] [INFO ] After 25097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1352 ms.
Support contains 207 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 3123 transition count 2258
Reduce places removed 585 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 587 rules applied. Total rules applied 1172 place count 2538 transition count 2256
Reduce places removed 1 places and 0 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Iterating post reduction 2 with 70 rules applied. Total rules applied 1242 place count 2537 transition count 2187
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 3 with 69 rules applied. Total rules applied 1311 place count 2468 transition count 2187
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 170 Pre rules applied. Total rules applied 1311 place count 2468 transition count 2017
Deduced a syphon composed of 170 places in 5 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 1651 place count 2298 transition count 2017
Discarding 265 places :
Symmetric choice reduction at 4 with 265 rule applications. Total rules 1916 place count 2033 transition count 1752
Iterating global reduction 4 with 265 rules applied. Total rules applied 2181 place count 2033 transition count 1752
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 84 Pre rules applied. Total rules applied 2181 place count 2033 transition count 1668
Deduced a syphon composed of 84 places in 10 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 2349 place count 1949 transition count 1668
Performed 606 Post agglomeration using F-continuation condition.Transition count delta: 606
Deduced a syphon composed of 606 places in 3 ms
Reduce places removed 606 places and 0 transitions.
Iterating global reduction 4 with 1212 rules applied. Total rules applied 3561 place count 1343 transition count 1062
Renaming transitions due to excessive name length > 1024 char.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 3705 place count 1271 transition count 1062
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3713 place count 1271 transition count 1054
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 3721 place count 1263 transition count 1054
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 5 with 97 rules applied. Total rules applied 3818 place count 1263 transition count 1054
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3819 place count 1262 transition count 1053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3820 place count 1261 transition count 1053
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 3820 place count 1261 transition count 1051
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3824 place count 1259 transition count 1051
Applied a total of 3824 rules in 1106 ms. Remains 1259 /3123 variables (removed 1864) and now considering 1051/2843 (removed 1792) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1107 ms. Remains : 1259/3123 places, 1051/2843 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 79703 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79703 steps, saw 58263 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1051 rows 1259 cols
[2023-03-22 06:57:58] [INFO ] Computed 440 place invariants in 4 ms
[2023-03-22 06:57:59] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 06:57:59] [INFO ] [Nat]Absence check using 440 positive place invariants in 91 ms returned sat
[2023-03-22 06:58:01] [INFO ] After 1543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 06:58:01] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-22 06:58:03] [INFO ] After 1621ms SMT Verify possible using 117 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 06:58:03] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2023-03-22 06:58:03] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 1 ms to minimize.
[2023-03-22 06:58:03] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-03-22 06:58:04] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 0 ms to minimize.
[2023-03-22 06:58:04] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 16 ms to minimize.
[2023-03-22 06:58:04] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 0 ms to minimize.
[2023-03-22 06:58:04] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 1 ms to minimize.
[2023-03-22 06:58:05] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 0 ms to minimize.
[2023-03-22 06:58:05] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 2 ms to minimize.
[2023-03-22 06:58:05] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-22 06:58:05] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-22 06:58:06] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 0 ms to minimize.
[2023-03-22 06:58:06] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-22 06:58:06] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 1 ms to minimize.
[2023-03-22 06:58:06] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2023-03-22 06:58:07] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 1 ms to minimize.
[2023-03-22 06:58:07] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2023-03-22 06:58:07] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2023-03-22 06:58:07] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-22 06:58:07] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2023-03-22 06:58:09] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 0 ms to minimize.
[2023-03-22 06:58:09] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 0 ms to minimize.
[2023-03-22 06:58:10] [INFO ] Deduced a trap composed of 13 places in 474 ms of which 18 ms to minimize.
[2023-03-22 06:58:10] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 0 ms to minimize.
[2023-03-22 06:58:11] [INFO ] Deduced a trap composed of 11 places in 1036 ms of which 2 ms to minimize.
[2023-03-22 06:58:11] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 8494 ms
[2023-03-22 06:58:12] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 1 ms to minimize.
[2023-03-22 06:58:12] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2023-03-22 06:58:12] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 0 ms to minimize.
[2023-03-22 06:58:13] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 3 ms to minimize.
[2023-03-22 06:58:13] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 0 ms to minimize.
[2023-03-22 06:58:13] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 1 ms to minimize.
[2023-03-22 06:58:14] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 13 ms to minimize.
[2023-03-22 06:58:14] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2023-03-22 06:58:14] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2023-03-22 06:58:14] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 0 ms to minimize.
[2023-03-22 06:58:14] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 1 ms to minimize.
[2023-03-22 06:58:15] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2854 ms
[2023-03-22 06:58:15] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2023-03-22 06:58:15] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 1 ms to minimize.
[2023-03-22 06:58:15] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2023-03-22 06:58:16] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2023-03-22 06:58:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1150 ms
[2023-03-22 06:58:16] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 0 ms to minimize.
[2023-03-22 06:58:16] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2023-03-22 06:58:17] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 1 ms to minimize.
[2023-03-22 06:58:17] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 0 ms to minimize.
[2023-03-22 06:58:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1092 ms
[2023-03-22 06:58:18] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 0 ms to minimize.
[2023-03-22 06:58:18] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2023-03-22 06:58:18] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 0 ms to minimize.
[2023-03-22 06:58:18] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-22 06:58:19] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-22 06:58:19] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2023-03-22 06:58:19] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 0 ms to minimize.
[2023-03-22 06:58:19] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 1 ms to minimize.
[2023-03-22 06:58:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2022 ms
[2023-03-22 06:58:20] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 0 ms to minimize.
[2023-03-22 06:58:20] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 2 ms to minimize.
[2023-03-22 06:58:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 551 ms
[2023-03-22 06:58:21] [INFO ] After 19639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1466 ms.
[2023-03-22 06:58:22] [INFO ] After 23174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 241 ms.
Support contains 207 out of 1259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 1051/1051 transitions.
Applied a total of 0 rules in 84 ms. Remains 1259 /1259 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1259/1259 places, 1051/1051 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 1051/1051 transitions.
Applied a total of 0 rules in 61 ms. Remains 1259 /1259 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
[2023-03-22 06:58:22] [INFO ] Invariant cache hit.
[2023-03-22 06:58:23] [INFO ] Implicit Places using invariants in 591 ms returned [1240, 1244]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 595 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1257/1259 places, 1051/1051 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1255 transition count 1049
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1255 transition count 1049
Applied a total of 4 rules in 77 ms. Remains 1255 /1257 variables (removed 2) and now considering 1049/1051 (removed 2) transitions.
// Phase 1: matrix 1049 rows 1255 cols
[2023-03-22 06:58:23] [INFO ] Computed 438 place invariants in 4 ms
[2023-03-22 06:58:24] [INFO ] Implicit Places using invariants in 646 ms returned []
[2023-03-22 06:58:24] [INFO ] Invariant cache hit.
[2023-03-22 06:58:25] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-22 06:58:27] [INFO ] Implicit Places using invariants and state equation in 2876 ms returned []
Implicit Place search using SMT with State Equation took 3527 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1255/1259 places, 1049/1051 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4260 ms. Remains : 1255/1259 places, 1049/1051 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 86642 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86642 steps, saw 61825 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-22 06:58:31] [INFO ] Invariant cache hit.
[2023-03-22 06:58:31] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 06:58:31] [INFO ] [Nat]Absence check using 438 positive place invariants in 170 ms returned sat
[2023-03-22 06:58:33] [INFO ] After 1695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 06:58:33] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-22 06:58:35] [INFO ] After 1492ms SMT Verify possible using 115 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 06:58:36] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 0 ms to minimize.
[2023-03-22 06:58:36] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 16 ms to minimize.
[2023-03-22 06:58:36] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2023-03-22 06:58:36] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2023-03-22 06:58:36] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2023-03-22 06:58:37] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2023-03-22 06:58:37] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2023-03-22 06:58:37] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-22 06:58:37] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2023-03-22 06:58:37] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 0 ms to minimize.
[2023-03-22 06:58:38] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2023-03-22 06:58:38] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2023-03-22 06:58:38] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2023-03-22 06:58:38] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2023-03-22 06:58:39] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2023-03-22 06:58:39] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 1 ms to minimize.
[2023-03-22 06:58:39] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 1 ms to minimize.
[2023-03-22 06:58:39] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2023-03-22 06:58:40] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2023-03-22 06:58:40] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 1 ms to minimize.
[2023-03-22 06:58:40] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 0 ms to minimize.
[2023-03-22 06:58:40] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 1 ms to minimize.
[2023-03-22 06:58:40] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5140 ms
[2023-03-22 06:58:41] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 1 ms to minimize.
[2023-03-22 06:58:42] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 0 ms to minimize.
[2023-03-22 06:58:42] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2023-03-22 06:58:42] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 1 ms to minimize.
[2023-03-22 06:58:43] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 1 ms to minimize.
[2023-03-22 06:58:43] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2023-03-22 06:58:43] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2023-03-22 06:58:43] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 4 ms to minimize.
[2023-03-22 06:58:43] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-22 06:58:44] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2023-03-22 06:58:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2639 ms
[2023-03-22 06:58:44] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 1 ms to minimize.
[2023-03-22 06:58:44] [INFO ] Deduced a trap composed of 8 places in 228 ms of which 0 ms to minimize.
[2023-03-22 06:58:45] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2023-03-22 06:58:45] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2023-03-22 06:58:45] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 0 ms to minimize.
[2023-03-22 06:58:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1371 ms
[2023-03-22 06:58:45] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 1 ms to minimize.
[2023-03-22 06:58:46] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 1 ms to minimize.
[2023-03-22 06:58:46] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 1 ms to minimize.
[2023-03-22 06:58:46] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2023-03-22 06:58:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 878 ms
[2023-03-22 06:58:47] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 1 ms to minimize.
[2023-03-22 06:58:47] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 0 ms to minimize.
[2023-03-22 06:58:47] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-22 06:58:47] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-22 06:58:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 903 ms
[2023-03-22 06:58:48] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2023-03-22 06:58:48] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2023-03-22 06:58:48] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 1 ms to minimize.
[2023-03-22 06:58:48] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 0 ms to minimize.
[2023-03-22 06:58:49] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 3 ms to minimize.
[2023-03-22 06:58:49] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 1 ms to minimize.
[2023-03-22 06:58:49] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-22 06:58:49] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 0 ms to minimize.
[2023-03-22 06:58:50] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 1 ms to minimize.
[2023-03-22 06:58:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2305 ms
[2023-03-22 06:58:50] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 1 ms to minimize.
[2023-03-22 06:58:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
[2023-03-22 06:58:50] [INFO ] After 16811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1229 ms.
[2023-03-22 06:58:51] [INFO ] After 20574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 236 ms.
Support contains 207 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1049/1049 transitions.
Applied a total of 0 rules in 31 ms. Remains 1255 /1255 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 1255/1255 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1049/1049 transitions.
Applied a total of 0 rules in 27 ms. Remains 1255 /1255 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2023-03-22 06:58:52] [INFO ] Invariant cache hit.
[2023-03-22 06:58:52] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-22 06:58:52] [INFO ] Invariant cache hit.
[2023-03-22 06:58:53] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-22 06:58:55] [INFO ] Implicit Places using invariants and state equation in 2707 ms returned []
Implicit Place search using SMT with State Equation took 3360 ms to find 0 implicit places.
[2023-03-22 06:58:55] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-22 06:58:55] [INFO ] Invariant cache hit.
[2023-03-22 06:58:56] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4142 ms. Remains : 1255/1255 places, 1049/1049 transitions.
Partial Free-agglomeration rule applied 128 times.
Drop transitions removed 128 transitions
Iterating global reduction 0 with 128 rules applied. Total rules applied 128 place count 1255 transition count 1049
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 129 place count 1255 transition count 1048
Applied a total of 129 rules in 78 ms. Remains 1255 /1255 variables (removed 0) and now considering 1048/1049 (removed 1) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 1048 rows 1255 cols
[2023-03-22 06:58:56] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-22 06:58:56] [INFO ] After 472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 06:58:57] [INFO ] [Nat]Absence check using 438 positive place invariants in 88 ms returned sat
[2023-03-22 06:58:59] [INFO ] After 1711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 06:58:59] [INFO ] State equation strengthened by 101 read => feed constraints.
[2023-03-22 06:59:01] [INFO ] After 2459ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 06:59:02] [INFO ] Deduced a trap composed of 3 places in 285 ms of which 13 ms to minimize.
[2023-03-22 06:59:02] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2023-03-22 06:59:03] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 1 ms to minimize.
[2023-03-22 06:59:03] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 0 ms to minimize.
[2023-03-22 06:59:03] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 0 ms to minimize.
[2023-03-22 06:59:04] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 3 ms to minimize.
[2023-03-22 06:59:04] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 1 ms to minimize.
[2023-03-22 06:59:04] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 1 ms to minimize.
[2023-03-22 06:59:05] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 1 ms to minimize.
[2023-03-22 06:59:05] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 1 ms to minimize.
[2023-03-22 06:59:05] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 1 ms to minimize.
[2023-03-22 06:59:05] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2023-03-22 06:59:06] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 1 ms to minimize.
[2023-03-22 06:59:06] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 0 ms to minimize.
[2023-03-22 06:59:06] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 1 ms to minimize.
[2023-03-22 06:59:07] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 1 ms to minimize.
[2023-03-22 06:59:07] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 0 ms to minimize.
[2023-03-22 06:59:07] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4970 ms
[2023-03-22 06:59:07] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 0 ms to minimize.
[2023-03-22 06:59:08] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 0 ms to minimize.
[2023-03-22 06:59:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 596 ms
[2023-03-22 06:59:08] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 1 ms to minimize.
[2023-03-22 06:59:08] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 0 ms to minimize.
[2023-03-22 06:59:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 703 ms
[2023-03-22 06:59:09] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 1 ms to minimize.
[2023-03-22 06:59:09] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 0 ms to minimize.
[2023-03-22 06:59:10] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2023-03-22 06:59:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 912 ms
[2023-03-22 06:59:10] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2023-03-22 06:59:10] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2023-03-22 06:59:11] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2023-03-22 06:59:11] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-22 06:59:11] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 1 ms to minimize.
[2023-03-22 06:59:11] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2023-03-22 06:59:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1237 ms
[2023-03-22 06:59:12] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 0 ms to minimize.
[2023-03-22 06:59:12] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 1 ms to minimize.
[2023-03-22 06:59:12] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 0 ms to minimize.
[2023-03-22 06:59:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 789 ms
[2023-03-22 06:59:13] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 0 ms to minimize.
[2023-03-22 06:59:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-22 06:59:13] [INFO ] After 14001ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1582 ms.
[2023-03-22 06:59:14] [INFO ] After 17985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-22 06:59:14] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-22 06:59:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1255 places, 1049 transitions and 4082 arcs took 7 ms.
[2023-03-22 06:59:15] [INFO ] Flatten gal took : 129 ms
Total runtime 112153 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/998/inv_0_ --invariant=/tmp/998/inv_1_ --invariant=/tmp/998/inv_2_ --invariant=/tmp/998/inv_3_ --invariant=/tmp/998/inv_4_ --invariant=/tmp/998/inv_5_ --invariant=/tmp/998/inv_6_ --invariant=/tmp/998/inv_7_ --invariant=/tmp/998/inv_8_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9269680 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098208 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2023

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="ShieldPPPt-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPt-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 r393-oct2-167903717300671"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-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 ;