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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1330.920 163498.00 220472.00 69.60 ?TFT?TFTTFTFTTTT 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.r395-oct2-167903718800495.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldPPPs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718800495
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 708K 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 ShieldPPPs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679570444612

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=ShieldPPPs-PT-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 11:20:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 11:20:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 11:20:47] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2023-03-23 11:20:47] [INFO ] Transformed 2723 places.
[2023-03-23 11:20:47] [INFO ] Transformed 2523 transitions.
[2023-03-23 11:20:47] [INFO ] Found NUPN structural information;
[2023-03-23 11:20:47] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 344 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 2 resets, run finished after 508 ms. (steps per millisecond=19 ) properties (out of 16) seen :7
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) 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 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2523 rows 2723 cols
[2023-03-23 11:20:48] [INFO ] Computed 441 place invariants in 28 ms
[2023-03-23 11:20:50] [INFO ] After 1375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 11:20:51] [INFO ] [Nat]Absence check using 441 positive place invariants in 305 ms returned sat
[2023-03-23 11:20:58] [INFO ] After 6259ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-23 11:21:00] [INFO ] Deduced a trap composed of 31 places in 1027 ms of which 11 ms to minimize.
[2023-03-23 11:21:01] [INFO ] Deduced a trap composed of 15 places in 872 ms of which 2 ms to minimize.
[2023-03-23 11:21:03] [INFO ] Deduced a trap composed of 27 places in 1318 ms of which 10 ms to minimize.
[2023-03-23 11:21:04] [INFO ] Deduced a trap composed of 22 places in 1212 ms of which 3 ms to minimize.
[2023-03-23 11:21:05] [INFO ] Deduced a trap composed of 32 places in 658 ms of which 1 ms to minimize.
[2023-03-23 11:21:06] [INFO ] Deduced a trap composed of 30 places in 938 ms of which 1 ms to minimize.
[2023-03-23 11:21:07] [INFO ] Deduced a trap composed of 35 places in 627 ms of which 1 ms to minimize.
[2023-03-23 11:21:07] [INFO ] Deduced a trap composed of 31 places in 618 ms of which 1 ms to minimize.
[2023-03-23 11:21:08] [INFO ] Deduced a trap composed of 26 places in 679 ms of which 1 ms to minimize.
[2023-03-23 11:21:09] [INFO ] Deduced a trap composed of 14 places in 808 ms of which 1 ms to minimize.
[2023-03-23 11:21:10] [INFO ] Deduced a trap composed of 29 places in 656 ms of which 2 ms to minimize.
[2023-03-23 11:21:11] [INFO ] Deduced a trap composed of 27 places in 890 ms of which 1 ms to minimize.
[2023-03-23 11:21:12] [INFO ] Deduced a trap composed of 22 places in 564 ms of which 1 ms to minimize.
[2023-03-23 11:21:12] [INFO ] Deduced a trap composed of 41 places in 559 ms of which 1 ms to minimize.
[2023-03-23 11:21:13] [INFO ] Deduced a trap composed of 44 places in 796 ms of which 1 ms to minimize.
[2023-03-23 11:21:14] [INFO ] Deduced a trap composed of 43 places in 506 ms of which 1 ms to minimize.
[2023-03-23 11:21:15] [INFO ] Deduced a trap composed of 31 places in 688 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 11:21:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:21:15] [INFO ] After 25293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 713 ms.
Support contains 180 out of 2723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 2723 transition count 2288
Reduce places removed 235 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 251 rules applied. Total rules applied 486 place count 2488 transition count 2272
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 502 place count 2472 transition count 2272
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 196 Pre rules applied. Total rules applied 502 place count 2472 transition count 2076
Deduced a syphon composed of 196 places in 7 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 3 with 392 rules applied. Total rules applied 894 place count 2276 transition count 2076
Discarding 244 places :
Symmetric choice reduction at 3 with 244 rule applications. Total rules 1138 place count 2032 transition count 1832
Iterating global reduction 3 with 244 rules applied. Total rules applied 1382 place count 2032 transition count 1832
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 1382 place count 2032 transition count 1748
Deduced a syphon composed of 84 places in 10 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 1550 place count 1948 transition count 1748
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 3 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 3 with 1070 rules applied. Total rules applied 2620 place count 1413 transition count 1213
Partial Free-agglomeration rule applied 309 times.
Drop transitions removed 309 transitions
Iterating global reduction 3 with 309 rules applied. Total rules applied 2929 place count 1413 transition count 1213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2930 place count 1412 transition count 1212
Applied a total of 2930 rules in 922 ms. Remains 1412 /2723 variables (removed 1311) and now considering 1212/2523 (removed 1311) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 927 ms. Remains : 1412/2723 places, 1212/2523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 7) seen :5
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1212 rows 1412 cols
[2023-03-23 11:21:17] [INFO ] Computed 441 place invariants in 29 ms
[2023-03-23 11:21:18] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:21:18] [INFO ] [Nat]Absence check using 422 positive place invariants in 177 ms returned sat
[2023-03-23 11:21:18] [INFO ] [Nat]Absence check using 422 positive and 19 generalized place invariants in 120 ms returned sat
[2023-03-23 11:21:20] [INFO ] After 1981ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:21:21] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 0 ms to minimize.
[2023-03-23 11:21:21] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 0 ms to minimize.
[2023-03-23 11:21:22] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2023-03-23 11:21:22] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2023-03-23 11:21:22] [INFO ] Deduced a trap composed of 6 places in 384 ms of which 14 ms to minimize.
[2023-03-23 11:21:23] [INFO ] Deduced a trap composed of 6 places in 349 ms of which 1 ms to minimize.
[2023-03-23 11:21:23] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2023-03-23 11:21:23] [INFO ] Deduced a trap composed of 6 places in 370 ms of which 1 ms to minimize.
[2023-03-23 11:21:24] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 0 ms to minimize.
[2023-03-23 11:21:24] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2023-03-23 11:21:24] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 0 ms to minimize.
[2023-03-23 11:21:24] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2023-03-23 11:21:25] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2023-03-23 11:21:25] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 0 ms to minimize.
[2023-03-23 11:21:25] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2023-03-23 11:21:25] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2023-03-23 11:21:26] [INFO ] Deduced a trap composed of 9 places in 329 ms of which 1 ms to minimize.
[2023-03-23 11:21:26] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2023-03-23 11:21:26] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2023-03-23 11:21:27] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 0 ms to minimize.
[2023-03-23 11:21:27] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 2 ms to minimize.
[2023-03-23 11:21:27] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 0 ms to minimize.
[2023-03-23 11:21:28] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 1 ms to minimize.
[2023-03-23 11:21:28] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 1 ms to minimize.
[2023-03-23 11:21:28] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 0 ms to minimize.
[2023-03-23 11:21:28] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 22 ms to minimize.
[2023-03-23 11:21:29] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 1 ms to minimize.
[2023-03-23 11:21:29] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2023-03-23 11:21:29] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 1 ms to minimize.
[2023-03-23 11:21:30] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2023-03-23 11:21:30] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2023-03-23 11:21:30] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2023-03-23 11:21:30] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 0 ms to minimize.
[2023-03-23 11:21:31] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 10010 ms
[2023-03-23 11:21:31] [INFO ] Deduced a trap composed of 7 places in 379 ms of which 42 ms to minimize.
[2023-03-23 11:21:31] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2023-03-23 11:21:32] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 0 ms to minimize.
[2023-03-23 11:21:32] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 0 ms to minimize.
[2023-03-23 11:21:33] [INFO ] Deduced a trap composed of 8 places in 600 ms of which 1 ms to minimize.
[2023-03-23 11:21:33] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 26 ms to minimize.
[2023-03-23 11:21:33] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 1 ms to minimize.
[2023-03-23 11:21:34] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 0 ms to minimize.
[2023-03-23 11:21:34] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
[2023-03-23 11:21:34] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 0 ms to minimize.
[2023-03-23 11:21:35] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 1 ms to minimize.
[2023-03-23 11:21:35] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2023-03-23 11:21:35] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 1 ms to minimize.
[2023-03-23 11:21:36] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 3 ms to minimize.
[2023-03-23 11:21:36] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 1 ms to minimize.
[2023-03-23 11:21:37] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 18 ms to minimize.
[2023-03-23 11:21:37] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2023-03-23 11:21:37] [INFO ] Deduced a trap composed of 6 places in 415 ms of which 1 ms to minimize.
[2023-03-23 11:21:38] [INFO ] Deduced a trap composed of 7 places in 399 ms of which 23 ms to minimize.
[2023-03-23 11:21:38] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 13 ms to minimize.
[2023-03-23 11:21:38] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 1 ms to minimize.
[2023-03-23 11:21:39] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2023-03-23 11:21:39] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 1 ms to minimize.
[2023-03-23 11:21:39] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 0 ms to minimize.
[2023-03-23 11:21:39] [INFO ] Deduced a trap composed of 31 places in 305 ms of which 1 ms to minimize.
[2023-03-23 11:21:40] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 1 ms to minimize.
[2023-03-23 11:21:40] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2023-03-23 11:21:40] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2023-03-23 11:21:40] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 0 ms to minimize.
[2023-03-23 11:21:41] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2023-03-23 11:21:41] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2023-03-23 11:21:41] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2023-03-23 11:21:41] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 0 ms to minimize.
[2023-03-23 11:21:42] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 0 ms to minimize.
[2023-03-23 11:21:42] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 10945 ms
[2023-03-23 11:21:42] [INFO ] After 23497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 778 ms.
[2023-03-23 11:21:43] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 106 ms.
Support contains 77 out of 1412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1412/1412 places, 1212/1212 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1412 transition count 1199
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 1399 transition count 1198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 1398 transition count 1198
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 28 place count 1398 transition count 1183
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 58 place count 1383 transition count 1183
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 61 place count 1380 transition count 1180
Iterating global reduction 3 with 3 rules applied. Total rules applied 64 place count 1380 transition count 1180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 1380 transition count 1179
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 1379 transition count 1179
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 204 place count 1310 transition count 1110
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 227 place count 1310 transition count 1110
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 231 place count 1306 transition count 1106
Applied a total of 231 rules in 308 ms. Remains 1306 /1412 variables (removed 106) and now considering 1106/1212 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 1306/1412 places, 1106/1212 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 111538 steps, run timeout after 3021 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 111538 steps, saw 105804 distinct states, run finished after 3022 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1106 rows 1306 cols
[2023-03-23 11:21:46] [INFO ] Computed 441 place invariants in 25 ms
[2023-03-23 11:21:47] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:21:47] [INFO ] [Nat]Absence check using 420 positive place invariants in 156 ms returned sat
[2023-03-23 11:21:47] [INFO ] [Nat]Absence check using 420 positive and 21 generalized place invariants in 18 ms returned sat
[2023-03-23 11:21:49] [INFO ] After 1602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:21:51] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 1 ms to minimize.
[2023-03-23 11:21:51] [INFO ] Deduced a trap composed of 5 places in 400 ms of which 1 ms to minimize.
[2023-03-23 11:21:51] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-23 11:21:52] [INFO ] Deduced a trap composed of 7 places in 410 ms of which 1 ms to minimize.
[2023-03-23 11:21:53] [INFO ] Deduced a trap composed of 10 places in 513 ms of which 1 ms to minimize.
[2023-03-23 11:21:53] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2023-03-23 11:21:53] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 0 ms to minimize.
[2023-03-23 11:21:54] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2023-03-23 11:21:54] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 1 ms to minimize.
[2023-03-23 11:21:54] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2023-03-23 11:21:54] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2023-03-23 11:21:55] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2023-03-23 11:21:55] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 0 ms to minimize.
[2023-03-23 11:21:55] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-23 11:21:56] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2023-03-23 11:21:56] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2023-03-23 11:21:56] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2023-03-23 11:21:56] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2023-03-23 11:21:57] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-23 11:21:57] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2023-03-23 11:21:57] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 1 ms to minimize.
[2023-03-23 11:21:58] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-23 11:21:58] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 1 ms to minimize.
[2023-03-23 11:21:58] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 0 ms to minimize.
[2023-03-23 11:21:58] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 0 ms to minimize.
[2023-03-23 11:21:59] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2023-03-23 11:21:59] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2023-03-23 11:21:59] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2023-03-23 11:21:59] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2023-03-23 11:22:00] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 9372 ms
[2023-03-23 11:22:00] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 0 ms to minimize.
[2023-03-23 11:22:00] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2023-03-23 11:22:01] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 0 ms to minimize.
[2023-03-23 11:22:01] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 1 ms to minimize.
[2023-03-23 11:22:01] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 1 ms to minimize.
[2023-03-23 11:22:02] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 0 ms to minimize.
[2023-03-23 11:22:02] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 1 ms to minimize.
[2023-03-23 11:22:02] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 0 ms to minimize.
[2023-03-23 11:22:03] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2023-03-23 11:22:03] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 1 ms to minimize.
[2023-03-23 11:22:03] [INFO ] Deduced a trap composed of 6 places in 391 ms of which 2 ms to minimize.
[2023-03-23 11:22:04] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2023-03-23 11:22:04] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 6 ms to minimize.
[2023-03-23 11:22:04] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 0 ms to minimize.
[2023-03-23 11:22:04] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 0 ms to minimize.
[2023-03-23 11:22:05] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2023-03-23 11:22:05] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2023-03-23 11:22:05] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2023-03-23 11:22:06] [INFO ] Deduced a trap composed of 8 places in 392 ms of which 1 ms to minimize.
[2023-03-23 11:22:06] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 0 ms to minimize.
[2023-03-23 11:22:06] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2023-03-23 11:22:06] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2023-03-23 11:22:06] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2023-03-23 11:22:07] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 0 ms to minimize.
[2023-03-23 11:22:07] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-23 11:22:07] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 2 ms to minimize.
[2023-03-23 11:22:07] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-23 11:22:08] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2023-03-23 11:22:08] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8016 ms
[2023-03-23 11:22:08] [INFO ] After 20762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1141 ms.
[2023-03-23 11:22:09] [INFO ] After 22403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 124 ms.
Support contains 77 out of 1306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 44 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1306/1306 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 57 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-23 11:22:09] [INFO ] Invariant cache hit.
[2023-03-23 11:22:10] [INFO ] Implicit Places using invariants in 845 ms returned []
[2023-03-23 11:22:10] [INFO ] Invariant cache hit.
[2023-03-23 11:22:13] [INFO ] Implicit Places using invariants and state equation in 2636 ms returned []
Implicit Place search using SMT with State Equation took 3508 ms to find 0 implicit places.
[2023-03-23 11:22:13] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-23 11:22:13] [INFO ] Invariant cache hit.
[2023-03-23 11:22:14] [INFO ] Dead Transitions using invariants and state equation in 1180 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4843 ms. Remains : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 53 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-23 11:22:14] [INFO ] Invariant cache hit.
[2023-03-23 11:22:14] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:22:15] [INFO ] [Nat]Absence check using 420 positive place invariants in 71 ms returned sat
[2023-03-23 11:22:15] [INFO ] [Nat]Absence check using 420 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-23 11:22:16] [INFO ] After 1570ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:22:17] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 1 ms to minimize.
[2023-03-23 11:22:18] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 1 ms to minimize.
[2023-03-23 11:22:18] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 0 ms to minimize.
[2023-03-23 11:22:18] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 0 ms to minimize.
[2023-03-23 11:22:19] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2023-03-23 11:22:19] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 1 ms to minimize.
[2023-03-23 11:22:19] [INFO ] Deduced a trap composed of 5 places in 332 ms of which 0 ms to minimize.
[2023-03-23 11:22:20] [INFO ] Deduced a trap composed of 6 places in 341 ms of which 1 ms to minimize.
[2023-03-23 11:22:20] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2023-03-23 11:22:20] [INFO ] Deduced a trap composed of 7 places in 314 ms of which 0 ms to minimize.
[2023-03-23 11:22:21] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2023-03-23 11:22:21] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2023-03-23 11:22:21] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2023-03-23 11:22:22] [INFO ] Deduced a trap composed of 8 places in 295 ms of which 1 ms to minimize.
[2023-03-23 11:22:22] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2023-03-23 11:22:22] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 0 ms to minimize.
[2023-03-23 11:22:23] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2023-03-23 11:22:23] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2023-03-23 11:22:23] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2023-03-23 11:22:23] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 0 ms to minimize.
[2023-03-23 11:22:24] [INFO ] Deduced a trap composed of 6 places in 477 ms of which 0 ms to minimize.
[2023-03-23 11:22:24] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2023-03-23 11:22:25] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 1 ms to minimize.
[2023-03-23 11:22:25] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 1 ms to minimize.
[2023-03-23 11:22:25] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-23 11:22:25] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 0 ms to minimize.
[2023-03-23 11:22:26] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2023-03-23 11:22:26] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 1 ms to minimize.
[2023-03-23 11:22:26] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2023-03-23 11:22:26] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 9215 ms
[2023-03-23 11:22:27] [INFO ] Deduced a trap composed of 6 places in 423 ms of which 1 ms to minimize.
[2023-03-23 11:22:27] [INFO ] Deduced a trap composed of 7 places in 301 ms of which 1 ms to minimize.
[2023-03-23 11:22:28] [INFO ] Deduced a trap composed of 8 places in 302 ms of which 1 ms to minimize.
[2023-03-23 11:22:28] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 0 ms to minimize.
[2023-03-23 11:22:28] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 1 ms to minimize.
[2023-03-23 11:22:28] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 0 ms to minimize.
[2023-03-23 11:22:29] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 1 ms to minimize.
[2023-03-23 11:22:29] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 1 ms to minimize.
[2023-03-23 11:22:29] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 3 ms to minimize.
[2023-03-23 11:22:30] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2023-03-23 11:22:30] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2023-03-23 11:22:30] [INFO ] Deduced a trap composed of 10 places in 529 ms of which 1 ms to minimize.
[2023-03-23 11:22:31] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 1 ms to minimize.
[2023-03-23 11:22:31] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 1 ms to minimize.
[2023-03-23 11:22:31] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4782 ms
[2023-03-23 11:22:31] [INFO ] After 16424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1201 ms.
[2023-03-23 11:22:32] [INFO ] After 18078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:22:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-23 11:22:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1306 places, 1106 transitions and 4841 arcs took 6 ms.
[2023-03-23 11:22:33] [INFO ] Flatten gal took : 192 ms
Total runtime 106037 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPs (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: 1306 places, 1106 transitions, 4841 arcs.
Final Score: 63274.823
Took : 53 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679570608110

--------------------
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 7424:
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="ShieldPPPs-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 ShieldPPPs-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 r395-oct2-167903718800495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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