fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1167.447 151367.00 198398.00 63.00 TFTFFF?F?TTTTTFT 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-167903718900511.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-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718900511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 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:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 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 888K 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-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679571805874

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-050B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 11:43:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 11:43:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 11:43:28] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2023-03-23 11:43:28] [INFO ] Transformed 3403 places.
[2023-03-23 11:43:28] [INFO ] Transformed 3153 transitions.
[2023-03-23 11:43:28] [INFO ] Found NUPN structural information;
[2023-03-23 11:43:28] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 393 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 16) seen :8
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3153 rows 3403 cols
[2023-03-23 11:43:29] [INFO ] Computed 551 place invariants in 63 ms
[2023-03-23 11:43:31] [INFO ] [Real]Absence check using 551 positive place invariants in 400 ms returned sat
[2023-03-23 11:43:31] [INFO ] After 1898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 11:43:32] [INFO ] [Nat]Absence check using 551 positive place invariants in 390 ms returned sat
[2023-03-23 11:43:37] [INFO ] After 3666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 11:43:39] [INFO ] Deduced a trap composed of 36 places in 2150 ms of which 23 ms to minimize.
[2023-03-23 11:43:41] [INFO ] Deduced a trap composed of 30 places in 2207 ms of which 30 ms to minimize.
[2023-03-23 11:43:43] [INFO ] Deduced a trap composed of 19 places in 1498 ms of which 18 ms to minimize.
[2023-03-23 11:43:46] [INFO ] Deduced a trap composed of 31 places in 2647 ms of which 3 ms to minimize.
[2023-03-23 11:43:47] [INFO ] Deduced a trap composed of 27 places in 1442 ms of which 2 ms to minimize.
[2023-03-23 11:43:49] [INFO ] Deduced a trap composed of 21 places in 1383 ms of which 3 ms to minimize.
[2023-03-23 11:43:51] [INFO ] Deduced a trap composed of 27 places in 1923 ms of which 2 ms to minimize.
[2023-03-23 11:43:53] [INFO ] Deduced a trap composed of 24 places in 1760 ms of which 2 ms to minimize.
[2023-03-23 11:43:55] [INFO ] Deduced a trap composed of 25 places in 1623 ms of which 3 ms to minimize.
[2023-03-23 11:43:56] [INFO ] Deduced a trap composed of 27 places in 1457 ms of which 2 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:43:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:43:56] [INFO ] After 25239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 678 ms.
Support contains 113 out of 3403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 3403 transition count 2831
Reduce places removed 322 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 328 rules applied. Total rules applied 650 place count 3081 transition count 2825
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 656 place count 3075 transition count 2825
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 656 place count 3075 transition count 2577
Deduced a syphon composed of 248 places in 9 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 1152 place count 2827 transition count 2577
Discarding 333 places :
Symmetric choice reduction at 3 with 333 rule applications. Total rules 1485 place count 2494 transition count 2244
Iterating global reduction 3 with 333 rules applied. Total rules applied 1818 place count 2494 transition count 2244
Performed 127 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 127 Pre rules applied. Total rules applied 1818 place count 2494 transition count 2117
Deduced a syphon composed of 127 places in 15 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 2072 place count 2367 transition count 2117
Performed 693 Post agglomeration using F-continuation condition.Transition count delta: 693
Deduced a syphon composed of 693 places in 5 ms
Reduce places removed 693 places and 0 transitions.
Iterating global reduction 3 with 1386 rules applied. Total rules applied 3458 place count 1674 transition count 1424
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 418 times.
Drop transitions removed 418 transitions
Iterating global reduction 3 with 418 rules applied. Total rules applied 3876 place count 1674 transition count 1424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3877 place count 1673 transition count 1423
Applied a total of 3877 rules in 1210 ms. Remains 1673 /3403 variables (removed 1730) and now considering 1423/3153 (removed 1730) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1211 ms. Remains : 1673/3403 places, 1423/3153 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 8) seen :6
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1423 rows 1673 cols
[2023-03-23 11:43:59] [INFO ] Computed 551 place invariants in 59 ms
[2023-03-23 11:43:59] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:43:59] [INFO ] [Nat]Absence check using 530 positive place invariants in 121 ms returned sat
[2023-03-23 11:43:59] [INFO ] [Nat]Absence check using 530 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-23 11:44:00] [INFO ] After 1176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:01] [INFO ] Deduced a trap composed of 5 places in 445 ms of which 1 ms to minimize.
[2023-03-23 11:44:01] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
[2023-03-23 11:44:01] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 0 ms to minimize.
[2023-03-23 11:44:02] [INFO ] Deduced a trap composed of 9 places in 341 ms of which 1 ms to minimize.
[2023-03-23 11:44:02] [INFO ] Deduced a trap composed of 9 places in 329 ms of which 0 ms to minimize.
[2023-03-23 11:44:03] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2023-03-23 11:44:03] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 0 ms to minimize.
[2023-03-23 11:44:03] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 0 ms to minimize.
[2023-03-23 11:44:04] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2023-03-23 11:44:04] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 1 ms to minimize.
[2023-03-23 11:44:04] [INFO ] Deduced a trap composed of 18 places in 290 ms of which 1 ms to minimize.
[2023-03-23 11:44:05] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 0 ms to minimize.
[2023-03-23 11:44:05] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 4 ms to minimize.
[2023-03-23 11:44:05] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 1 ms to minimize.
[2023-03-23 11:44:05] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2023-03-23 11:44:06] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
[2023-03-23 11:44:06] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 0 ms to minimize.
[2023-03-23 11:44:06] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 4 ms to minimize.
[2023-03-23 11:44:07] [INFO ] Deduced a trap composed of 8 places in 295 ms of which 1 ms to minimize.
[2023-03-23 11:44:07] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 1 ms to minimize.
[2023-03-23 11:44:07] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2023-03-23 11:44:08] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 0 ms to minimize.
[2023-03-23 11:44:08] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 0 ms to minimize.
[2023-03-23 11:44:08] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 15 ms to minimize.
[2023-03-23 11:44:08] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 1 ms to minimize.
[2023-03-23 11:44:09] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2023-03-23 11:44:09] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 8333 ms
[2023-03-23 11:44:09] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2023-03-23 11:44:09] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 0 ms to minimize.
[2023-03-23 11:44:10] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2023-03-23 11:44:10] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 1 ms to minimize.
[2023-03-23 11:44:10] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 1 ms to minimize.
[2023-03-23 11:44:11] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 1 ms to minimize.
[2023-03-23 11:44:11] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 0 ms to minimize.
[2023-03-23 11:44:11] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2023-03-23 11:44:11] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 0 ms to minimize.
[2023-03-23 11:44:12] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 1 ms to minimize.
[2023-03-23 11:44:12] [INFO ] Deduced a trap composed of 7 places in 296 ms of which 1 ms to minimize.
[2023-03-23 11:44:12] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 1 ms to minimize.
[2023-03-23 11:44:13] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 0 ms to minimize.
[2023-03-23 11:44:13] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 1 ms to minimize.
[2023-03-23 11:44:13] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 13 ms to minimize.
[2023-03-23 11:44:13] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
[2023-03-23 11:44:14] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 0 ms to minimize.
[2023-03-23 11:44:14] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2023-03-23 11:44:14] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2023-03-23 11:44:14] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 1 ms to minimize.
[2023-03-23 11:44:14] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2023-03-23 11:44:15] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2023-03-23 11:44:15] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-23 11:44:15] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
[2023-03-23 11:44:15] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2023-03-23 11:44:16] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 1 ms to minimize.
[2023-03-23 11:44:16] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2023-03-23 11:44:16] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
[2023-03-23 11:44:17] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 0 ms to minimize.
[2023-03-23 11:44:17] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2023-03-23 11:44:17] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 13 ms to minimize.
[2023-03-23 11:44:17] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 13 ms to minimize.
[2023-03-23 11:44:17] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2023-03-23 11:44:18] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2023-03-23 11:44:18] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 8868 ms
[2023-03-23 11:44:18] [INFO ] After 18609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 512 ms.
[2023-03-23 11:44:18] [INFO ] After 19461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 71 ms.
Support contains 56 out of 1673 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1673/1673 places, 1423/1423 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1673 transition count 1413
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1663 transition count 1413
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 20 place count 1663 transition count 1403
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 1653 transition count 1403
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 116 place count 1615 transition count 1365
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 123 place count 1615 transition count 1365
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 1613 transition count 1363
Applied a total of 125 rules in 299 ms. Remains 1613 /1673 variables (removed 60) and now considering 1363/1423 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 1613/1673 places, 1363/1423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 119180 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119180 steps, saw 113148 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1363 rows 1613 cols
[2023-03-23 11:44:22] [INFO ] Computed 551 place invariants in 36 ms
[2023-03-23 11:44:22] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:23] [INFO ] [Nat]Absence check using 529 positive place invariants in 76 ms returned sat
[2023-03-23 11:44:23] [INFO ] [Nat]Absence check using 529 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-23 11:44:24] [INFO ] After 994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:24] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 0 ms to minimize.
[2023-03-23 11:44:25] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 1 ms to minimize.
[2023-03-23 11:44:25] [INFO ] Deduced a trap composed of 5 places in 413 ms of which 0 ms to minimize.
[2023-03-23 11:44:25] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 0 ms to minimize.
[2023-03-23 11:44:26] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2023-03-23 11:44:26] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 0 ms to minimize.
[2023-03-23 11:44:26] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2023-03-23 11:44:27] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 0 ms to minimize.
[2023-03-23 11:44:27] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2023-03-23 11:44:27] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 1 ms to minimize.
[2023-03-23 11:44:27] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2023-03-23 11:44:28] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 1 ms to minimize.
[2023-03-23 11:44:28] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2023-03-23 11:44:28] [INFO ] Deduced a trap composed of 8 places in 276 ms of which 0 ms to minimize.
[2023-03-23 11:44:29] [INFO ] Deduced a trap composed of 7 places in 296 ms of which 1 ms to minimize.
[2023-03-23 11:44:29] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-03-23 11:44:29] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2023-03-23 11:44:30] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2023-03-23 11:44:30] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2023-03-23 11:44:30] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
[2023-03-23 11:44:31] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2023-03-23 11:44:31] [INFO ] Deduced a trap composed of 8 places in 337 ms of which 1 ms to minimize.
[2023-03-23 11:44:31] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2023-03-23 11:44:31] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2023-03-23 11:44:32] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2023-03-23 11:44:32] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-23 11:44:32] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
[2023-03-23 11:44:33] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-23 11:44:33] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8859 ms
[2023-03-23 11:44:33] [INFO ] Deduced a trap composed of 5 places in 389 ms of which 1 ms to minimize.
[2023-03-23 11:44:34] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 0 ms to minimize.
[2023-03-23 11:44:34] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2023-03-23 11:44:34] [INFO ] Deduced a trap composed of 5 places in 322 ms of which 1 ms to minimize.
[2023-03-23 11:44:34] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 0 ms to minimize.
[2023-03-23 11:44:35] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2023-03-23 11:44:35] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-23 11:44:35] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2023-03-23 11:44:36] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 0 ms to minimize.
[2023-03-23 11:44:36] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-23 11:44:36] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2023-03-23 11:44:36] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 1 ms to minimize.
[2023-03-23 11:44:37] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 1 ms to minimize.
[2023-03-23 11:44:37] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2023-03-23 11:44:37] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2023-03-23 11:44:38] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 1 ms to minimize.
[2023-03-23 11:44:38] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2023-03-23 11:44:38] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-23 11:44:38] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-23 11:44:38] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 1 ms to minimize.
[2023-03-23 11:44:39] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2023-03-23 11:44:39] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-23 11:44:39] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-23 11:44:39] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 0 ms to minimize.
[2023-03-23 11:44:40] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 0 ms to minimize.
[2023-03-23 11:44:40] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6864 ms
[2023-03-23 11:44:40] [INFO ] After 16947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 364 ms.
[2023-03-23 11:44:40] [INFO ] After 17712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 65 ms.
Support contains 56 out of 1613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1613/1613 places, 1363/1363 transitions.
Applied a total of 0 rules in 61 ms. Remains 1613 /1613 variables (removed 0) and now considering 1363/1363 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1613/1613 places, 1363/1363 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1613/1613 places, 1363/1363 transitions.
Applied a total of 0 rules in 61 ms. Remains 1613 /1613 variables (removed 0) and now considering 1363/1363 (removed 0) transitions.
[2023-03-23 11:44:40] [INFO ] Invariant cache hit.
[2023-03-23 11:44:41] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2023-03-23 11:44:41] [INFO ] Invariant cache hit.
[2023-03-23 11:44:44] [INFO ] Implicit Places using invariants and state equation in 2619 ms returned []
Implicit Place search using SMT with State Equation took 3698 ms to find 0 implicit places.
[2023-03-23 11:44:44] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-23 11:44:44] [INFO ] Invariant cache hit.
[2023-03-23 11:44:45] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4567 ms. Remains : 1613/1613 places, 1363/1363 transitions.
Applied a total of 0 rules in 46 ms. Remains 1613 /1613 variables (removed 0) and now considering 1363/1363 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-23 11:44:45] [INFO ] Invariant cache hit.
[2023-03-23 11:44:45] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:44:45] [INFO ] [Nat]Absence check using 529 positive place invariants in 99 ms returned sat
[2023-03-23 11:44:45] [INFO ] [Nat]Absence check using 529 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-23 11:44:46] [INFO ] After 1188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:47] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 1 ms to minimize.
[2023-03-23 11:44:47] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2023-03-23 11:44:47] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 1 ms to minimize.
[2023-03-23 11:44:48] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 16 ms to minimize.
[2023-03-23 11:44:48] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 0 ms to minimize.
[2023-03-23 11:44:48] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-23 11:44:49] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2023-03-23 11:44:49] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2023-03-23 11:44:49] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2023-03-23 11:44:49] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2023-03-23 11:44:50] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2023-03-23 11:44:50] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 0 ms to minimize.
[2023-03-23 11:44:50] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2023-03-23 11:44:50] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 0 ms to minimize.
[2023-03-23 11:44:50] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2023-03-23 11:44:51] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2023-03-23 11:44:51] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-23 11:44:51] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2023-03-23 11:44:51] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-23 11:44:51] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 0 ms to minimize.
[2023-03-23 11:44:52] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2023-03-23 11:44:52] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2023-03-23 11:44:52] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2023-03-23 11:44:52] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2023-03-23 11:44:52] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5830 ms
[2023-03-23 11:44:53] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 0 ms to minimize.
[2023-03-23 11:44:53] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
[2023-03-23 11:44:53] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2023-03-23 11:44:54] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 0 ms to minimize.
[2023-03-23 11:44:54] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 1 ms to minimize.
[2023-03-23 11:44:54] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 0 ms to minimize.
[2023-03-23 11:44:55] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 0 ms to minimize.
[2023-03-23 11:44:55] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2023-03-23 11:44:55] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 0 ms to minimize.
[2023-03-23 11:44:56] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2023-03-23 11:44:56] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2023-03-23 11:44:56] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 1 ms to minimize.
[2023-03-23 11:44:56] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 1 ms to minimize.
[2023-03-23 11:44:57] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 0 ms to minimize.
[2023-03-23 11:44:57] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2023-03-23 11:44:57] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 0 ms to minimize.
[2023-03-23 11:44:57] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 1 ms to minimize.
[2023-03-23 11:44:58] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 1 ms to minimize.
[2023-03-23 11:44:58] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 0 ms to minimize.
[2023-03-23 11:44:58] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2023-03-23 11:44:58] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 0 ms to minimize.
[2023-03-23 11:44:59] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 0 ms to minimize.
[2023-03-23 11:44:59] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6098 ms
[2023-03-23 11:44:59] [INFO ] After 13375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 335 ms.
[2023-03-23 11:44:59] [INFO ] After 14015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:44:59] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-23 11:44:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1613 places, 1363 transitions and 5914 arcs took 9 ms.
[2023-03-23 11:45:00] [INFO ] Flatten gal took : 199 ms
Total runtime 91924 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPs (PT), instance 050B
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: 1613 places, 1363 transitions, 5914 arcs.
Final Score: 35773.497
Took : 56 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679571957241

--------------------
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 9251:
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-050B"
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-050B, 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-167903718900511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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