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.r523-tall-167987247500070.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 Anderson-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247500070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 8.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.1M Mar 31 16:48 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 Anderson-PT-12-ReachabilityCardinality-00
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-01
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-02
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-03
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-04
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-05
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-06
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-07
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-08
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-09
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-10
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-11
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-12
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-13
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-14
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680826629462

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-07 00:17:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 00:17:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 00:17:11] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2023-04-07 00:17:11] [INFO ] Transformed 889 places.
[2023-04-07 00:17:11] [INFO ] Transformed 4152 transitions.
[2023-04-07 00:17:11] [INFO ] Found NUPN structural information;
[2023-04-07 00:17:11] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-12-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 14) seen :6
FORMULA Anderson-PT-12-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 4152 rows 889 cols
[2023-04-07 00:17:13] [INFO ] Computed 27 invariants in 99 ms
[2023-04-07 00:17:13] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 00:17:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-04-07 00:17:14] [INFO ] [Nat]Absence check using 13 positive and 14 generalized place invariants in 24 ms returned sat
[2023-04-07 00:17:21] [INFO ] After 7383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 00:17:21] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 00:17:25] [INFO ] After 3923ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 00:17:28] [INFO ] Deduced a trap composed of 279 places in 699 ms of which 7 ms to minimize.
[2023-04-07 00:17:28] [INFO ] Deduced a trap composed of 135 places in 709 ms of which 1 ms to minimize.
[2023-04-07 00:17:29] [INFO ] Deduced a trap composed of 138 places in 695 ms of which 1 ms to minimize.
[2023-04-07 00:17:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2482 ms
[2023-04-07 00:17:30] [INFO ] Deduced a trap composed of 163 places in 703 ms of which 2 ms to minimize.
[2023-04-07 00:17:31] [INFO ] Deduced a trap composed of 215 places in 714 ms of which 2 ms to minimize.
[2023-04-07 00:17:32] [INFO ] Deduced a trap composed of 358 places in 722 ms of which 1 ms to minimize.
[2023-04-07 00:17:33] [INFO ] Deduced a trap composed of 163 places in 709 ms of which 1 ms to minimize.
[2023-04-07 00:17:33] [INFO ] Deduced a trap composed of 333 places in 711 ms of which 1 ms to minimize.
[2023-04-07 00:17:34] [INFO ] Deduced a trap composed of 218 places in 799 ms of which 1 ms to minimize.
[2023-04-07 00:17:35] [INFO ] Deduced a trap composed of 134 places in 803 ms of which 1 ms to minimize.
[2023-04-07 00:17:36] [INFO ] Deduced a trap composed of 279 places in 804 ms of which 1 ms to minimize.
[2023-04-07 00:17:37] [INFO ] Deduced a trap composed of 198 places in 801 ms of which 1 ms to minimize.
[2023-04-07 00:17:38] [INFO ] Deduced a trap composed of 216 places in 790 ms of which 1 ms to minimize.
[2023-04-07 00:17:39] [INFO ] Deduced a trap composed of 338 places in 724 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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-04-07 00:17:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-07 00:17:39] [INFO ] After 25536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 68 ms.
Support contains 90 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 97 Pre rules applied. Total rules applied 0 place count 889 transition count 4055
Deduced a syphon composed of 97 places in 15 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 0 with 194 rules applied. Total rules applied 194 place count 792 transition count 4055
Discarding 225 places :
Symmetric choice reduction at 0 with 225 rule applications. Total rules 419 place count 567 transition count 1234
Iterating global reduction 0 with 225 rules applied. Total rules applied 644 place count 567 transition count 1234
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 684 place count 547 transition count 1214
Applied a total of 684 rules in 210 ms. Remains 547 /889 variables (removed 342) and now considering 1214/4152 (removed 2938) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 547/889 places, 1214/4152 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1214 rows 547 cols
[2023-04-07 00:17:40] [INFO ] Computed 27 invariants in 44 ms
[2023-04-07 00:17:40] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 00:17:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-04-07 00:17:40] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 245 ms returned sat
[2023-04-07 00:17:42] [INFO ] After 1552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 00:17:42] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 00:17:43] [INFO ] After 806ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 00:17:43] [INFO ] Deduced a trap composed of 252 places in 294 ms of which 1 ms to minimize.
[2023-04-07 00:17:44] [INFO ] Deduced a trap composed of 249 places in 274 ms of which 1 ms to minimize.
[2023-04-07 00:17:44] [INFO ] Deduced a trap composed of 135 places in 278 ms of which 1 ms to minimize.
[2023-04-07 00:17:44] [INFO ] Deduced a trap composed of 155 places in 267 ms of which 0 ms to minimize.
[2023-04-07 00:17:45] [INFO ] Deduced a trap composed of 200 places in 275 ms of which 0 ms to minimize.
[2023-04-07 00:17:45] [INFO ] Deduced a trap composed of 228 places in 277 ms of which 1 ms to minimize.
[2023-04-07 00:17:45] [INFO ] Deduced a trap composed of 247 places in 291 ms of which 0 ms to minimize.
[2023-04-07 00:17:46] [INFO ] Deduced a trap composed of 149 places in 282 ms of which 1 ms to minimize.
[2023-04-07 00:17:46] [INFO ] Deduced a trap composed of 144 places in 279 ms of which 1 ms to minimize.
[2023-04-07 00:17:46] [INFO ] Deduced a trap composed of 131 places in 277 ms of which 0 ms to minimize.
[2023-04-07 00:17:47] [INFO ] Deduced a trap composed of 202 places in 290 ms of which 1 ms to minimize.
[2023-04-07 00:17:47] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 1 ms to minimize.
[2023-04-07 00:17:47] [INFO ] Deduced a trap composed of 219 places in 281 ms of which 0 ms to minimize.
[2023-04-07 00:17:48] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 0 ms to minimize.
[2023-04-07 00:17:48] [INFO ] Deduced a trap composed of 202 places in 268 ms of which 1 ms to minimize.
[2023-04-07 00:17:48] [INFO ] Deduced a trap composed of 277 places in 287 ms of which 1 ms to minimize.
[2023-04-07 00:17:49] [INFO ] Deduced a trap composed of 273 places in 272 ms of which 1 ms to minimize.
[2023-04-07 00:17:49] [INFO ] Deduced a trap composed of 190 places in 270 ms of which 1 ms to minimize.
[2023-04-07 00:17:49] [INFO ] Deduced a trap composed of 267 places in 273 ms of which 1 ms to minimize.
[2023-04-07 00:17:50] [INFO ] Deduced a trap composed of 285 places in 264 ms of which 1 ms to minimize.
[2023-04-07 00:17:50] [INFO ] Deduced a trap composed of 276 places in 257 ms of which 2 ms to minimize.
[2023-04-07 00:17:50] [INFO ] Deduced a trap composed of 182 places in 262 ms of which 1 ms to minimize.
[2023-04-07 00:17:51] [INFO ] Deduced a trap composed of 118 places in 286 ms of which 0 ms to minimize.
[2023-04-07 00:17:51] [INFO ] Deduced a trap composed of 261 places in 285 ms of which 1 ms to minimize.
[2023-04-07 00:17:52] [INFO ] Deduced a trap composed of 68 places in 257 ms of which 1 ms to minimize.
[2023-04-07 00:17:52] [INFO ] Deduced a trap composed of 254 places in 269 ms of which 0 ms to minimize.
[2023-04-07 00:17:52] [INFO ] Deduced a trap composed of 122 places in 257 ms of which 0 ms to minimize.
[2023-04-07 00:17:53] [INFO ] Deduced a trap composed of 93 places in 274 ms of which 1 ms to minimize.
[2023-04-07 00:17:53] [INFO ] Deduced a trap composed of 238 places in 264 ms of which 0 ms to minimize.
[2023-04-07 00:17:53] [INFO ] Deduced a trap composed of 204 places in 257 ms of which 1 ms to minimize.
[2023-04-07 00:17:54] [INFO ] Deduced a trap composed of 263 places in 251 ms of which 1 ms to minimize.
[2023-04-07 00:17:54] [INFO ] Deduced a trap composed of 206 places in 262 ms of which 0 ms to minimize.
[2023-04-07 00:17:54] [INFO ] Deduced a trap composed of 259 places in 256 ms of which 1 ms to minimize.
[2023-04-07 00:17:54] [INFO ] Deduced a trap composed of 264 places in 252 ms of which 1 ms to minimize.
[2023-04-07 00:17:55] [INFO ] Deduced a trap composed of 260 places in 248 ms of which 0 ms to minimize.
[2023-04-07 00:17:55] [INFO ] Deduced a trap composed of 154 places in 264 ms of which 0 ms to minimize.
[2023-04-07 00:17:55] [INFO ] Deduced a trap composed of 150 places in 259 ms of which 1 ms to minimize.
[2023-04-07 00:17:56] [INFO ] Deduced a trap composed of 158 places in 248 ms of which 1 ms to minimize.
[2023-04-07 00:17:56] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 12721 ms
[2023-04-07 00:17:57] [INFO ] After 14650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 878 ms.
[2023-04-07 00:17:58] [INFO ] After 17540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 40 ms.
Support contains 72 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 1214/1214 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 547 transition count 1212
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 545 transition count 1212
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 7 place count 542 transition count 1143
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 542 transition count 1143
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 537 transition count 1138
Applied a total of 20 rules in 77 ms. Remains 537 /547 variables (removed 10) and now considering 1138/1214 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 537/547 places, 1138/1214 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 384905 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{1=1, 3=1, 4=1}
Probabilistic random walk after 384905 steps, saw 295142 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :3
FORMULA Anderson-PT-12-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 1138 rows 537 cols
[2023-04-07 00:18:01] [INFO ] Computed 27 invariants in 12 ms
[2023-04-07 00:18:01] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 00:18:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-04-07 00:18:02] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 28 ms returned sat
[2023-04-07 00:18:03] [INFO ] After 1034ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 00:18:03] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 00:18:03] [INFO ] After 432ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 00:18:04] [INFO ] Deduced a trap composed of 208 places in 254 ms of which 0 ms to minimize.
[2023-04-07 00:18:04] [INFO ] Deduced a trap composed of 260 places in 262 ms of which 0 ms to minimize.
[2023-04-07 00:18:04] [INFO ] Deduced a trap composed of 105 places in 297 ms of which 5 ms to minimize.
[2023-04-07 00:18:04] [INFO ] Deduced a trap composed of 81 places in 263 ms of which 0 ms to minimize.
[2023-04-07 00:18:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1282 ms
[2023-04-07 00:18:05] [INFO ] After 1964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 314 ms.
[2023-04-07 00:18:05] [INFO ] After 3463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 33 out of 537 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 537/537 places, 1138/1138 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 537 transition count 1133
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 532 transition count 1133
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 21 place count 521 transition count 924
Iterating global reduction 0 with 11 rules applied. Total rules applied 32 place count 521 transition count 924
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 56 place count 509 transition count 912
Applied a total of 56 rules in 65 ms. Remains 509 /537 variables (removed 28) and now considering 912/1138 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 509/537 places, 912/1138 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 341815 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 341815 steps, saw 266550 distinct states, run finished after 3002 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 912 rows 509 cols
[2023-04-07 00:18:08] [INFO ] Computed 27 invariants in 7 ms
[2023-04-07 00:18:08] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 00:18:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-04-07 00:18:09] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 30 ms returned sat
[2023-04-07 00:18:09] [INFO ] After 684ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 00:18:09] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 00:18:10] [INFO ] After 454ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 00:18:14] [INFO ] After 4687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 275 ms.
[2023-04-07 00:18:14] [INFO ] After 5824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 33 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 912/912 transitions.
Applied a total of 0 rules in 17 ms. Remains 509 /509 variables (removed 0) and now considering 912/912 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 509/509 places, 912/912 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 912/912 transitions.
Applied a total of 0 rules in 24 ms. Remains 509 /509 variables (removed 0) and now considering 912/912 (removed 0) transitions.
[2023-04-07 00:18:14] [INFO ] Invariant cache hit.
[2023-04-07 00:18:15] [INFO ] Implicit Places using invariants in 656 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 658 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 508/509 places, 912/912 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 508 transition count 803
Reduce places removed 109 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 127 rules applied. Total rules applied 236 place count 399 transition count 785
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 254 place count 381 transition count 785
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 266 place count 381 transition count 773
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 278 place count 369 transition count 773
Applied a total of 278 rules in 38 ms. Remains 369 /508 variables (removed 139) and now considering 773/912 (removed 139) transitions.
// Phase 1: matrix 773 rows 369 cols
[2023-04-07 00:18:15] [INFO ] Computed 26 invariants in 8 ms
[2023-04-07 00:18:15] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-04-07 00:18:15] [INFO ] Invariant cache hit.
[2023-04-07 00:18:16] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 00:18:17] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 369/509 places, 773/912 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2354 ms. Remains : 369/509 places, 773/912 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
FORMULA Anderson-PT-12-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-04-07 00:18:17] [INFO ] Invariant cache hit.
[2023-04-07 00:18:17] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:18:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-04-07 00:18:17] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 15 ms returned sat
[2023-04-07 00:18:17] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:18:17] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 00:18:18] [INFO ] After 199ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:18:18] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-04-07 00:18:18] [INFO ] After 1136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 31 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 773/773 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 369 transition count 772
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 368 transition count 772
Applied a total of 2 rules in 16 ms. Remains 368 /369 variables (removed 1) and now considering 772/773 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 368/369 places, 772/773 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 816225 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :{}
Probabilistic random walk after 816225 steps, saw 612142 distinct states, run finished after 3002 ms. (steps per millisecond=271 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 772 rows 368 cols
[2023-04-07 00:18:21] [INFO ] Computed 26 invariants in 11 ms
[2023-04-07 00:18:21] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:18:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 00:18:21] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 00:18:22] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:18:22] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 00:18:22] [INFO ] After 159ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:18:22] [INFO ] Deduced a trap composed of 104 places in 184 ms of which 1 ms to minimize.
[2023-04-07 00:18:22] [INFO ] Deduced a trap composed of 86 places in 181 ms of which 1 ms to minimize.
[2023-04-07 00:18:23] [INFO ] Deduced a trap composed of 113 places in 180 ms of which 0 ms to minimize.
[2023-04-07 00:18:23] [INFO ] Deduced a trap composed of 101 places in 181 ms of which 0 ms to minimize.
[2023-04-07 00:18:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1008 ms
[2023-04-07 00:18:23] [INFO ] After 1254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 152 ms.
[2023-04-07 00:18:23] [INFO ] After 1929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 31 out of 368 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 772/772 transitions.
Applied a total of 0 rules in 11 ms. Remains 368 /368 variables (removed 0) and now considering 772/772 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 368/368 places, 772/772 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 772/772 transitions.
Applied a total of 0 rules in 10 ms. Remains 368 /368 variables (removed 0) and now considering 772/772 (removed 0) transitions.
[2023-04-07 00:18:23] [INFO ] Invariant cache hit.
[2023-04-07 00:18:23] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-04-07 00:18:23] [INFO ] Invariant cache hit.
[2023-04-07 00:18:24] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 00:18:25] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
[2023-04-07 00:18:25] [INFO ] Redundant transitions in 47 ms returned []
[2023-04-07 00:18:25] [INFO ] Invariant cache hit.
[2023-04-07 00:18:26] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2500 ms. Remains : 368/368 places, 772/772 transitions.
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 130 Pre rules applied. Total rules applied 0 place count 368 transition count 642
Deduced a syphon composed of 130 places in 0 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 0 with 260 rules applied. Total rules applied 260 place count 238 transition count 642
Applied a total of 260 rules in 14 ms. Remains 238 /368 variables (removed 130) and now considering 642/772 (removed 130) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 642 rows 238 cols
[2023-04-07 00:18:26] [INFO ] Computed 26 invariants in 8 ms
[2023-04-07 00:18:26] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:18:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 00:18:26] [INFO ] [Nat]Absence check using 13 positive and 13 generalized place invariants in 11 ms returned sat
[2023-04-07 00:18:26] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:18:26] [INFO ] After 509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-04-07 00:18:26] [INFO ] After 657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:18:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-04-07 00:18:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 368 places, 772 transitions and 3052 arcs took 5 ms.
[2023-04-07 00:18:27] [INFO ] Flatten gal took : 107 ms
Total runtime 75880 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Anderson (PT), instance 12
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 368 places, 772 transitions, 3052 arcs.
Final Score: 36525.838
Took : 35 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Anderson-PT-12-ReachabilityCardinality-01 (reachable &!potential( ( ( ( ( (tk(P231)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P231)) ) ) | ( ( (tk(P350)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P350)) ) ) ) | ( ( ( (tk(P257)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P257)) ) ) | ( ( ( ( (tk(P220)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P220)) ) ) & ( ( (tk(P178)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P178)) ) ) ) & ( ( ( ( (tk(P124)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P124)) ) ) | ( ( (tk(P278)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P278)) ) ) ) & ( ( ( ( ( (tk(P365)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P365)) ) ) & ( ( ( (tk(P240)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P240)) ) ) & ( ( ( (tk(P79)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P79)) ) ) | ( ( (tk(P339)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P339)) ) ) ) ) ) | ( ( ( ( (tk(P366)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P366)) ) ) & ( ( ( (tk(P44)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P44)) ) ) & ( ( ( ( (tk(P309)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P309)) ) ) | ( ( (tk(P84)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P84)) ) ) ) | ( ( ( (tk(P115)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P115)) ) ) | ( ( (tk(P184)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P184)) ) ) ) ) ) ) | ( ( ( ( ( (tk(P206)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P206)) ) ) | ( ( (tk(P180)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P180)) ) ) ) | ( ( ( (tk(P38)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P38)) ) ) | ( ( ( (tk(P177)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P177)) ) ) & ( ( ( (tk(P182)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P182)) ) ) & ( ( ( (tk(P261)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P261)) ) ) | ( ( (tk(P179)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P179)) ) ) ) ) ) ) ) & ( ( ( (tk(P54)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P54)) ) ) | ( ( (tk(P203)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P203)) ) ) ) ) ) ) & ( ( ( (tk(P368)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P368)) ) ) | ( ( ( (tk(P180)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P180)) ) ) | ( ( ( (tk(P25)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P25)) ) ) & ( ( ( (tk(P60)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P60)) ) ) & ( ( ( (tk(P12)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P12)) ) ) | ( ( (tk(P294)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P294)) ) ) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6493164 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16110932 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="Anderson-PT-12"
export BK_EXAMINATION="ReachabilityCardinality"
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 Anderson-PT-12, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r523-tall-167987247500070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-12.tgz
mv Anderson-PT-12 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;