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-167903718400151.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 ShieldIIPs-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718400151
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:34 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.8K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 426K 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 ShieldIIPs-PT-050A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679556941528

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=ShieldIIPs-PT-050A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:35:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 07:35:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:35:44] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2023-03-23 07:35:44] [INFO ] Transformed 1253 places.
[2023-03-23 07:35:44] [INFO ] Transformed 1203 transitions.
[2023-03-23 07:35:44] [INFO ] Found NUPN structural information;
[2023-03-23 07:35:44] [INFO ] Parsed PT model containing 1253 places and 1203 transitions and 5406 arcs in 277 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 3 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 16) seen :12
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) 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 4) seen :1
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 1203 rows 1253 cols
[2023-03-23 07:35:45] [INFO ] Computed 451 place invariants in 42 ms
[2023-03-23 07:35:46] [INFO ] [Real]Absence check using 451 positive place invariants in 287 ms returned sat
[2023-03-23 07:35:47] [INFO ] After 1256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 07:35:47] [INFO ] [Nat]Absence check using 451 positive place invariants in 292 ms returned sat
[2023-03-23 07:35:51] [INFO ] After 3184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 07:35:51] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 8 ms to minimize.
[2023-03-23 07:35:51] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 21 ms to minimize.
[2023-03-23 07:35:52] [INFO ] Deduced a trap composed of 19 places in 313 ms of which 2 ms to minimize.
[2023-03-23 07:35:52] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2023-03-23 07:35:52] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 2 ms to minimize.
[2023-03-23 07:35:53] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-23 07:35:53] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2023-03-23 07:35:53] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-23 07:35:53] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2023-03-23 07:35:54] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2023-03-23 07:35:54] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-23 07:35:54] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2931 ms
[2023-03-23 07:35:55] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2023-03-23 07:35:56] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2023-03-23 07:35:56] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 25 ms to minimize.
[2023-03-23 07:35:56] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-03-23 07:35:56] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-23 07:35:57] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2023-03-23 07:35:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1626 ms
[2023-03-23 07:35:57] [INFO ] After 9785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3828 ms.
[2023-03-23 07:36:01] [INFO ] After 14598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 345 ms.
Support contains 67 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Partial Free-agglomeration rule applied 320 times.
Drop transitions removed 320 transitions
Iterating global reduction 0 with 320 rules applied. Total rules applied 322 place count 1252 transition count 1202
Applied a total of 322 rules in 232 ms. Remains 1252 /1253 variables (removed 1) and now considering 1202/1203 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 1252/1253 places, 1202/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 3) seen :1
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1202 rows 1252 cols
[2023-03-23 07:36:02] [INFO ] Computed 451 place invariants in 99 ms
[2023-03-23 07:36:03] [INFO ] [Real]Absence check using 446 positive place invariants in 114 ms returned sat
[2023-03-23 07:36:03] [INFO ] [Real]Absence check using 446 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-23 07:36:03] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 07:36:03] [INFO ] [Nat]Absence check using 446 positive place invariants in 73 ms returned sat
[2023-03-23 07:36:03] [INFO ] [Nat]Absence check using 446 positive and 5 generalized place invariants in 15 ms returned sat
[2023-03-23 07:36:07] [INFO ] After 3742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 07:36:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:36:08] [INFO ] After 891ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-23 07:36:11] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 0 ms to minimize.
[2023-03-23 07:36:20] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 0 ms to minimize.
[2023-03-23 07:36:23] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 1 ms to minimize.
[2023-03-23 07:36:28] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 16624 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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 07:36:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:36:28] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 281 ms.
Support contains 35 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 1252 transition count 1202
Applied a total of 15 rules in 99 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 168959 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{1=1}
Probabilistic random walk after 168959 steps, saw 139512 distinct states, run finished after 3003 ms. (steps per millisecond=56 ) properties seen :1
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 1202 rows 1252 cols
[2023-03-23 07:36:31] [INFO ] Computed 451 place invariants in 33 ms
[2023-03-23 07:36:32] [INFO ] [Real]Absence check using 445 positive place invariants in 91 ms returned sat
[2023-03-23 07:36:32] [INFO ] [Real]Absence check using 445 positive and 6 generalized place invariants in 44 ms returned sat
[2023-03-23 07:36:33] [INFO ] After 1133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:36:33] [INFO ] [Nat]Absence check using 445 positive place invariants in 176 ms returned sat
[2023-03-23 07:36:33] [INFO ] [Nat]Absence check using 445 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-23 07:36:37] [INFO ] After 3706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:36:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:36:37] [INFO ] After 126ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 07:36:38] [INFO ] Deduced a trap composed of 8 places in 364 ms of which 14 ms to minimize.
[2023-03-23 07:36:41] [INFO ] Deduced a trap composed of 15 places in 499 ms of which 0 ms to minimize.
[2023-03-23 07:36:41] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 1 ms to minimize.
[2023-03-23 07:36:41] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 0 ms to minimize.
[2023-03-23 07:36:42] [INFO ] Deduced a trap composed of 9 places in 796 ms of which 1 ms to minimize.
[2023-03-23 07:36:43] [INFO ] Deduced a trap composed of 14 places in 398 ms of which 2 ms to minimize.
[2023-03-23 07:36:43] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 1 ms to minimize.
[2023-03-23 07:36:44] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 1 ms to minimize.
[2023-03-23 07:36:44] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 1 ms to minimize.
[2023-03-23 07:36:44] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 1 ms to minimize.
[2023-03-23 07:36:44] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 1 ms to minimize.
[2023-03-23 07:36:45] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 0 ms to minimize.
[2023-03-23 07:36:45] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 5 ms to minimize.
[2023-03-23 07:36:45] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 0 ms to minimize.
[2023-03-23 07:36:46] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 0 ms to minimize.
[2023-03-23 07:36:46] [INFO ] Deduced a trap composed of 17 places in 291 ms of which 0 ms to minimize.
[2023-03-23 07:36:46] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 0 ms to minimize.
[2023-03-23 07:36:47] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 4 ms to minimize.
[2023-03-23 07:36:47] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 14 ms to minimize.
[2023-03-23 07:36:49] [INFO ] Deduced a trap composed of 9 places in 329 ms of which 13 ms to minimize.
[2023-03-23 07:36:50] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
[2023-03-23 07:36:50] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 9 ms to minimize.
[2023-03-23 07:36:51] [INFO ] Deduced a trap composed of 17 places in 986 ms of which 0 ms to minimize.
[2023-03-23 07:36:51] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 0 ms to minimize.
[2023-03-23 07:36:51] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 1 ms to minimize.
[2023-03-23 07:36:52] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2023-03-23 07:36:52] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-23 07:36:52] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2023-03-23 07:36:52] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2023-03-23 07:36:53] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 18 ms to minimize.
[2023-03-23 07:36:53] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 1 ms to minimize.
[2023-03-23 07:36:53] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 1 ms to minimize.
[2023-03-23 07:36:54] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2023-03-23 07:36:54] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2023-03-23 07:36:54] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 13 ms to minimize.
[2023-03-23 07:36:54] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-23 07:36:55] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2023-03-23 07:36:55] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2023-03-23 07:36:55] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 17116 ms
[2023-03-23 07:36:55] [INFO ] After 17975ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-23 07:36:55] [INFO ] After 22576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 80 ms.
Support contains 8 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 1252 transition count 1202
Applied a total of 13 rules in 79 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 228685 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228685 steps, saw 217019 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1202 rows 1252 cols
[2023-03-23 07:36:59] [INFO ] Computed 451 place invariants in 33 ms
[2023-03-23 07:36:59] [INFO ] [Real]Absence check using 450 positive place invariants in 232 ms returned sat
[2023-03-23 07:36:59] [INFO ] [Real]Absence check using 450 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 07:37:00] [INFO ] After 1431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:37:00] [INFO ] [Nat]Absence check using 450 positive place invariants in 92 ms returned sat
[2023-03-23 07:37:00] [INFO ] [Nat]Absence check using 450 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 07:37:02] [INFO ] After 1379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:37:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:37:02] [INFO ] After 255ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 07:37:03] [INFO ] Deduced a trap composed of 9 places in 457 ms of which 1 ms to minimize.
[2023-03-23 07:37:03] [INFO ] Deduced a trap composed of 9 places in 363 ms of which 0 ms to minimize.
[2023-03-23 07:37:03] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 1 ms to minimize.
[2023-03-23 07:37:04] [INFO ] Deduced a trap composed of 9 places in 332 ms of which 1 ms to minimize.
[2023-03-23 07:37:04] [INFO ] Deduced a trap composed of 9 places in 486 ms of which 1 ms to minimize.
[2023-03-23 07:37:05] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 0 ms to minimize.
[2023-03-23 07:37:05] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 0 ms to minimize.
[2023-03-23 07:37:05] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 18 ms to minimize.
[2023-03-23 07:37:06] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 26 ms to minimize.
[2023-03-23 07:37:06] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 33 ms to minimize.
[2023-03-23 07:37:06] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2023-03-23 07:37:06] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 0 ms to minimize.
[2023-03-23 07:37:06] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 2 ms to minimize.
[2023-03-23 07:37:07] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2023-03-23 07:37:07] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 0 ms to minimize.
[2023-03-23 07:37:07] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2023-03-23 07:37:07] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4882 ms
[2023-03-23 07:37:07] [INFO ] After 5350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-23 07:37:07] [INFO ] After 7273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 63 ms.
Support contains 8 out of 1252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 34 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1252/1252 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1252/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 58 ms. Remains 1252 /1252 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-23 07:37:07] [INFO ] Invariant cache hit.
[2023-03-23 07:37:09] [INFO ] Implicit Places using invariants in 1509 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1529 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1251/1252 places, 1202/1202 transitions.
Applied a total of 0 rules in 56 ms. Remains 1251 /1251 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1644 ms. Remains : 1251/1252 places, 1202/1202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 219382 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219382 steps, saw 208987 distinct states, run finished after 3017 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1202 rows 1251 cols
[2023-03-23 07:37:12] [INFO ] Computed 450 place invariants in 20 ms
[2023-03-23 07:37:13] [INFO ] [Real]Absence check using 449 positive place invariants in 98 ms returned sat
[2023-03-23 07:37:13] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-23 07:37:13] [INFO ] After 1110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:37:14] [INFO ] [Nat]Absence check using 449 positive place invariants in 103 ms returned sat
[2023-03-23 07:37:14] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-23 07:37:16] [INFO ] After 1651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:37:16] [INFO ] Deduced a trap composed of 12 places in 273 ms of which 1 ms to minimize.
[2023-03-23 07:37:16] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2023-03-23 07:37:17] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 0 ms to minimize.
[2023-03-23 07:37:17] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 0 ms to minimize.
[2023-03-23 07:37:18] [INFO ] Deduced a trap composed of 12 places in 620 ms of which 4 ms to minimize.
[2023-03-23 07:37:20] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 1 ms to minimize.
[2023-03-23 07:37:20] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2023-03-23 07:37:20] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 1 ms to minimize.
[2023-03-23 07:37:21] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 0 ms to minimize.
[2023-03-23 07:37:21] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2023-03-23 07:37:21] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2023-03-23 07:37:21] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 0 ms to minimize.
[2023-03-23 07:37:22] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2023-03-23 07:37:22] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-23 07:37:22] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-23 07:37:22] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2023-03-23 07:37:23] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 1 ms to minimize.
[2023-03-23 07:37:23] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-23 07:37:23] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-23 07:37:23] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 0 ms to minimize.
[2023-03-23 07:37:24] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-23 07:37:24] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2023-03-23 07:37:24] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2023-03-23 07:37:24] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 8119 ms
[2023-03-23 07:37:24] [INFO ] After 10140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-23 07:37:24] [INFO ] After 10700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 97 ms.
Support contains 8 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1202/1202 transitions.
Applied a total of 0 rules in 38 ms. Remains 1251 /1251 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1251/1251 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1202/1202 transitions.
Applied a total of 0 rules in 32 ms. Remains 1251 /1251 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-23 07:37:24] [INFO ] Invariant cache hit.
[2023-03-23 07:37:26] [INFO ] Implicit Places using invariants in 1369 ms returned []
[2023-03-23 07:37:26] [INFO ] Invariant cache hit.
[2023-03-23 07:37:28] [INFO ] Implicit Places using invariants and state equation in 2712 ms returned []
Implicit Place search using SMT with State Equation took 4103 ms to find 0 implicit places.
[2023-03-23 07:37:28] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-23 07:37:28] [INFO ] Invariant cache hit.
[2023-03-23 07:37:29] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5022 ms. Remains : 1251/1251 places, 1202/1202 transitions.
Applied a total of 0 rules in 31 ms. Remains 1251 /1251 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-23 07:37:29] [INFO ] Invariant cache hit.
[2023-03-23 07:37:30] [INFO ] [Real]Absence check using 449 positive place invariants in 356 ms returned sat
[2023-03-23 07:37:30] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 07:37:31] [INFO ] After 1558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:37:32] [INFO ] [Nat]Absence check using 449 positive place invariants in 194 ms returned sat
[2023-03-23 07:37:32] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 07:37:34] [INFO ] After 1978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:37:34] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 0 ms to minimize.
[2023-03-23 07:37:35] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 1 ms to minimize.
[2023-03-23 07:37:35] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 0 ms to minimize.
[2023-03-23 07:37:35] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 1 ms to minimize.
[2023-03-23 07:37:35] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2023-03-23 07:37:36] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-23 07:37:36] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 0 ms to minimize.
[2023-03-23 07:37:36] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2023-03-23 07:37:36] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-23 07:37:36] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-23 07:37:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2343 ms
[2023-03-23 07:37:36] [INFO ] After 4826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-23 07:37:37] [INFO ] After 5796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 07:37:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-23 07:37:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1251 places, 1202 transitions and 6137 arcs took 9 ms.
[2023-03-23 07:37:37] [INFO ] Flatten gal took : 263 ms
Total runtime 113547 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 050A
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: 1251 places, 1202 transitions, 6137 arcs.
Final Score: 211056.401
Took : 65 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679557124296

--------------------
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 8597:
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="ShieldIIPs-PT-050A"
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 ShieldIIPs-PT-050A, 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-167903718400151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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