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

About the Execution of Smart+red for ShieldIIPt-PT-100B

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679564513685

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 09:41:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 09:41:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 09:41:55] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2023-03-23 09:41:56] [INFO ] Transformed 7003 places.
[2023-03-23 09:41:56] [INFO ] Transformed 6503 transitions.
[2023-03-23 09:41:56] [INFO ] Found NUPN structural information;
[2023-03-23 09:41:56] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 568 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 16) seen :6
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 6503 rows 7003 cols
[2023-03-23 09:41:57] [INFO ] Computed 901 place invariants in 50 ms
[2023-03-23 09:42:00] [INFO ] After 2646ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 09:42:04] [INFO ] [Nat]Absence check using 901 positive place invariants in 1021 ms returned sat
[2023-03-23 09:42:25] [INFO ] After 20053ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 09:42:25] [INFO ] After 20064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-23 09:42:25] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 662 ms.
Support contains 208 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions removed 1530 transitions
Trivial Post-agglo rules discarded 1530 transitions
Performed 1530 trivial Post agglomeration. Transition count delta: 1530
Iterating post reduction 0 with 1530 rules applied. Total rules applied 1530 place count 7003 transition count 4973
Reduce places removed 1530 places and 0 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Iterating post reduction 1 with 1577 rules applied. Total rules applied 3107 place count 5473 transition count 4926
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 3154 place count 5426 transition count 4926
Performed 426 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 426 Pre rules applied. Total rules applied 3154 place count 5426 transition count 4500
Deduced a syphon composed of 426 places in 23 ms
Reduce places removed 426 places and 0 transitions.
Iterating global reduction 3 with 852 rules applied. Total rules applied 4006 place count 5000 transition count 4500
Discarding 693 places :
Symmetric choice reduction at 3 with 693 rule applications. Total rules 4699 place count 4307 transition count 3807
Iterating global reduction 3 with 693 rules applied. Total rules applied 5392 place count 4307 transition count 3807
Performed 267 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 267 Pre rules applied. Total rules applied 5392 place count 4307 transition count 3540
Deduced a syphon composed of 267 places in 18 ms
Reduce places removed 267 places and 0 transitions.
Iterating global reduction 3 with 534 rules applied. Total rules applied 5926 place count 4040 transition count 3540
Performed 1588 Post agglomeration using F-continuation condition.Transition count delta: 1588
Deduced a syphon composed of 1588 places in 5 ms
Reduce places removed 1588 places and 0 transitions.
Iterating global reduction 3 with 3176 rules applied. Total rules applied 9102 place count 2452 transition count 1952
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9304 place count 2351 transition count 2005
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9506 place count 2250 transition count 2061
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 62 places in 6 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 9630 place count 2188 transition count 2096
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 9642 place count 2188 transition count 2084
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 9654 place count 2176 transition count 2084
Partial Free-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 4 with 96 rules applied. Total rules applied 9750 place count 2176 transition count 2084
Applied a total of 9750 rules in 2224 ms. Remains 2176 /7003 variables (removed 4827) and now considering 2084/6503 (removed 4419) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2225 ms. Remains : 2176/7003 places, 2084/6503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 55135 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55135 steps, saw 30842 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2084 rows 2176 cols
[2023-03-23 09:42:32] [INFO ] Computed 901 place invariants in 20 ms
[2023-03-23 09:42:33] [INFO ] After 655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 09:42:34] [INFO ] [Nat]Absence check using 901 positive place invariants in 298 ms returned sat
[2023-03-23 09:42:38] [INFO ] After 3631ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-23 09:42:38] [INFO ] State equation strengthened by 686 read => feed constraints.
[2023-03-23 09:42:51] [INFO ] After 12917ms SMT Verify possible using 686 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 09:42:52] [INFO ] Deduced a trap composed of 6 places in 487 ms of which 7 ms to minimize.
[2023-03-23 09:42:53] [INFO ] Deduced a trap composed of 9 places in 456 ms of which 1 ms to minimize.
[2023-03-23 09:42:53] [INFO ] Deduced a trap composed of 8 places in 408 ms of which 1 ms to minimize.
[2023-03-23 09:42:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1735 ms
[2023-03-23 09:42:55] [INFO ] Deduced a trap composed of 12 places in 392 ms of which 1 ms to minimize.
[2023-03-23 09:42:55] [INFO ] Deduced a trap composed of 7 places in 399 ms of which 1 ms to minimize.
[2023-03-23 09:42:56] [INFO ] Deduced a trap composed of 10 places in 465 ms of which 1 ms to minimize.
[2023-03-23 09:42:57] [INFO ] Deduced a trap composed of 12 places in 428 ms of which 16 ms to minimize.
[2023-03-23 09:42:57] [INFO ] Deduced a trap composed of 10 places in 352 ms of which 0 ms to minimize.
[2023-03-23 09:42:58] [INFO ] Deduced a trap composed of 7 places in 423 ms of which 1 ms to minimize.
[2023-03-23 09:42:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3460 ms
[2023-03-23 09:42:58] [INFO ] Deduced a trap composed of 11 places in 378 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 09:42:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 09:42:58] [INFO ] After 25358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 624 ms.
Support contains 208 out of 2176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2176/2176 places, 2084/2084 transitions.
Applied a total of 0 rules in 109 ms. Remains 2176 /2176 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 2176/2176 places, 2084/2084 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2176/2176 places, 2084/2084 transitions.
Applied a total of 0 rules in 81 ms. Remains 2176 /2176 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
[2023-03-23 09:42:59] [INFO ] Invariant cache hit.
[2023-03-23 09:43:01] [INFO ] Implicit Places using invariants in 1554 ms returned []
[2023-03-23 09:43:01] [INFO ] Invariant cache hit.
[2023-03-23 09:43:02] [INFO ] State equation strengthened by 686 read => feed constraints.
[2023-03-23 09:43:18] [INFO ] Implicit Places using invariants and state equation in 17208 ms returned []
Implicit Place search using SMT with State Equation took 18805 ms to find 0 implicit places.
[2023-03-23 09:43:18] [INFO ] Redundant transitions in 128 ms returned []
[2023-03-23 09:43:18] [INFO ] Invariant cache hit.
[2023-03-23 09:43:20] [INFO ] Dead Transitions using invariants and state equation in 1510 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20564 ms. Remains : 2176/2176 places, 2084/2084 transitions.
Partial Free-agglomeration rule applied 354 times.
Drop transitions removed 354 transitions
Iterating global reduction 0 with 354 rules applied. Total rules applied 354 place count 2176 transition count 2084
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 357 place count 2176 transition count 2081
Applied a total of 357 rules in 211 ms. Remains 2176 /2176 variables (removed 0) and now considering 2081/2084 (removed 3) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 2081 rows 2176 cols
[2023-03-23 09:43:20] [INFO ] Computed 901 place invariants in 16 ms
[2023-03-23 09:43:21] [INFO ] After 650ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 09:43:22] [INFO ] [Nat]Absence check using 901 positive place invariants in 262 ms returned sat
[2023-03-23 09:43:25] [INFO ] After 2922ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-23 09:43:25] [INFO ] State equation strengthened by 336 read => feed constraints.
[2023-03-23 09:43:34] [INFO ] After 8942ms SMT Verify possible using 336 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-23 09:43:35] [INFO ] Deduced a trap composed of 7 places in 427 ms of which 1 ms to minimize.
[2023-03-23 09:43:35] [INFO ] Deduced a trap composed of 5 places in 430 ms of which 1 ms to minimize.
[2023-03-23 09:43:36] [INFO ] Deduced a trap composed of 6 places in 445 ms of which 0 ms to minimize.
[2023-03-23 09:43:37] [INFO ] Deduced a trap composed of 4 places in 509 ms of which 1 ms to minimize.
[2023-03-23 09:43:37] [INFO ] Deduced a trap composed of 12 places in 281 ms of which 0 ms to minimize.
[2023-03-23 09:43:37] [INFO ] Deduced a trap composed of 9 places in 372 ms of which 2 ms to minimize.
[2023-03-23 09:43:38] [INFO ] Deduced a trap composed of 21 places in 344 ms of which 1 ms to minimize.
[2023-03-23 09:43:38] [INFO ] Deduced a trap composed of 8 places in 346 ms of which 1 ms to minimize.
[2023-03-23 09:43:39] [INFO ] Deduced a trap composed of 8 places in 401 ms of which 1 ms to minimize.
[2023-03-23 09:43:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4552 ms
[2023-03-23 09:43:40] [INFO ] Deduced a trap composed of 9 places in 498 ms of which 2 ms to minimize.
[2023-03-23 09:43:41] [INFO ] Deduced a trap composed of 9 places in 377 ms of which 1 ms to minimize.
[2023-03-23 09:43:41] [INFO ] Deduced a trap composed of 9 places in 398 ms of which 2 ms to minimize.
[2023-03-23 09:43:42] [INFO ] Deduced a trap composed of 6 places in 436 ms of which 1 ms to minimize.
[2023-03-23 09:43:43] [INFO ] Deduced a trap composed of 9 places in 452 ms of which 1 ms to minimize.
[2023-03-23 09:43:43] [INFO ] Deduced a trap composed of 8 places in 291 ms of which 0 ms to minimize.
[2023-03-23 09:43:44] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 1 ms to minimize.
[2023-03-23 09:43:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3930 ms
[2023-03-23 09:43:55] [INFO ] Deduced a trap composed of 12 places in 532 ms of which 1 ms to minimize.
[2023-03-23 09:43:56] [INFO ] Deduced a trap composed of 12 places in 501 ms of which 1 ms to minimize.
[2023-03-23 09:43:56] [INFO ] Deduced a trap composed of 12 places in 433 ms of which 1 ms to minimize.
[2023-03-23 09:43:57] [INFO ] Deduced a trap composed of 10 places in 386 ms of which 1 ms to minimize.
[2023-03-23 09:43:58] [INFO ] Deduced a trap composed of 13 places in 395 ms of which 1 ms to minimize.
[2023-03-23 09:43:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3632 ms
[2023-03-23 09:43:59] [INFO ] Deduced a trap composed of 9 places in 437 ms of which 1 ms to minimize.
[2023-03-23 09:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 613 ms
[2023-03-23 09:43:59] [INFO ] After 33887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2494 ms.
[2023-03-23 09:44:02] [INFO ] After 40849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-23 09:44:02] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-23 09:44:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2176 places, 2084 transitions and 10106 arcs took 18 ms.
[2023-03-23 09:44:02] [INFO ] Flatten gal took : 226 ms
Total runtime 126887 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPt (PT), instance 100B
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: 2176 places, 2084 transitions, 10106 arcs.
Final Score: 377068.539
Took : 97 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679564740564

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
++ sed s/.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 14373:
syntax error

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is ShieldIIPt-PT-100B, 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-167903718700351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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