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.r235-tall-167856421900509.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 LeafsetExtension-PT-S32C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856421900509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 8.1K Feb 25 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 16:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.4M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678662852680

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C3
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 23:14:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 23:14:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:14:14] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2023-03-12 23:14:14] [INFO ] Transformed 5622 places.
[2023-03-12 23:14:14] [INFO ] Transformed 5449 transitions.
[2023-03-12 23:14:14] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 341 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-12 23:14:15] [INFO ] Computed 173 place invariants in 292 ms
Incomplete random walk after 10000 steps, including 387 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 16) seen :8
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :1
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :2
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :1
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :1
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-12 23:14:15] [INFO ] Invariant cache hit.
[2023-03-12 23:14:16] [INFO ] [Real]Absence check using 35 positive place invariants in 82 ms returned sat
[2023-03-12 23:14:16] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 325 ms returned sat
[2023-03-12 23:14:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:14:20] [INFO ] [Real]Absence check using state equation in 3413 ms returned sat
[2023-03-12 23:14:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:14:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 66 ms returned sat
[2023-03-12 23:14:21] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 140 ms returned sat
[2023-03-12 23:14:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:14:24] [INFO ] [Nat]Absence check using state equation in 3217 ms returned sat
[2023-03-12 23:14:24] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 300 ms.
[2023-03-12 23:14:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-12 23:14:25] [INFO ] [Real]Absence check using 35 positive place invariants in 59 ms returned sat
[2023-03-12 23:14:25] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 141 ms returned sat
[2023-03-12 23:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:14:29] [INFO ] [Real]Absence check using state equation in 3276 ms returned sat
[2023-03-12 23:14:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:14:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 55 ms returned sat
[2023-03-12 23:14:30] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 134 ms returned sat
[2023-03-12 23:14:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:14:33] [INFO ] [Nat]Absence check using state equation in 3192 ms returned sat
[2023-03-12 23:14:33] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 241 ms.
[2023-03-12 23:14:41] [INFO ] Deduced a trap composed of 2 places in 6692 ms of which 14 ms to minimize.
[2023-03-12 23:14:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-12 23:14:41] [INFO ] [Real]Absence check using 35 positive place invariants in 62 ms returned sat
[2023-03-12 23:14:41] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 137 ms returned unsat
[2023-03-12 23:14:42] [INFO ] [Real]Absence check using 35 positive place invariants in 54 ms returned sat
[2023-03-12 23:14:42] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 83 ms returned unsat
[2023-03-12 23:14:42] [INFO ] [Real]Absence check using 35 positive place invariants in 53 ms returned sat
[2023-03-12 23:14:43] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 150 ms returned sat
[2023-03-12 23:14:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 23:14:46] [INFO ] [Real]Absence check using state equation in 3234 ms returned sat
[2023-03-12 23:14:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 23:14:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 55 ms returned sat
[2023-03-12 23:14:47] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 137 ms returned sat
[2023-03-12 23:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 23:14:50] [INFO ] [Nat]Absence check using state equation in 3440 ms returned sat
[2023-03-12 23:14:51] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 247 ms.
[2023-03-12 23:14:58] [INFO ] Deduced a trap composed of 2 places in 6954 ms of which 8 ms to minimize.
[2023-03-12 23:14:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 1, 1, 0]
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 128 are kept as prefixes of interest. Removing 5494 places using SCC suffix rule.10 ms
Discarding 5494 places :
Also discarding 3970 output transitions
Drop transitions removed 3970 transitions
Drop transitions removed 1102 transitions
Reduce isomorphic transitions removed 1102 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 1133 rules applied. Total rules applied 1134 place count 128 transition count 346
Reduce places removed 35 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 1186 place count 93 transition count 329
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1188 place count 91 transition count 329
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1188 place count 91 transition count 327
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1192 place count 89 transition count 327
Free-agglomeration rule applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 1225 place count 89 transition count 294
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 1258 place count 56 transition count 294
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1259 place count 56 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1260 place count 55 transition count 293
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 1290 place count 55 transition count 293
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 1292 place count 53 transition count 293
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1293 place count 53 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1294 place count 52 transition count 292
Applied a total of 1294 rules in 165 ms. Remains 52 /5622 variables (removed 5570) and now considering 292/5449 (removed 5157) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 52/5622 places, 292/5449 transitions.
Successfully produced net in file /tmp/petri1000_7063942048746202397.dot
Successfully produced net in file /tmp/petri1001_1705039966026513416.dot
Successfully produced net in file /tmp/petri1002_4780568350298820859.dot
Successfully produced net in file /tmp/petri1003_11633132668718438769.dot
Successfully produced net in file /tmp/petri1004_5333213328852064366.dot
Successfully produced net in file /tmp/petri1005_15794093532207050294.dot
Successfully produced net in file /tmp/petri1006_14216310404181112419.dot
Successfully produced net in file /tmp/petri1007_12710827271757430578.dot
Successfully produced net in file /tmp/petri1008_13255805770527264485.dot
Successfully produced net in file /tmp/petri1009_2241047003955237630.dot
Successfully produced net in file /tmp/petri1010_4915697703378531545.dot
Successfully produced net in file /tmp/petri1011_11759480725850594267.dot
Successfully produced net in file /tmp/petri1012_3296848926652631788.dot
Successfully produced net in file /tmp/petri1013_1041334107075196218.dot
Successfully produced net in file /tmp/petri1014_16832163811794046498.dot
Successfully produced net in file /tmp/petri1015_1543288341555508717.dot
Successfully produced net in file /tmp/petri1016_16273405267949182977.dot
Successfully produced net in file /tmp/petri1017_9457952658660414156.dot
Successfully produced net in file /tmp/petri1018_3948321480435373981.dot
Successfully produced net in file /tmp/petri1019_2153187430587460695.dot
Successfully produced net in file /tmp/petri1020_7191412905095167980.dot
Successfully produced net in file /tmp/petri1021_14561060819209124066.dot
Successfully produced net in file /tmp/petri1022_556896048240225201.dot
Successfully produced net in file /tmp/petri1023_15683642791434953790.dot
Successfully produced net in file /tmp/petri1024_1850133487846810525.dot
Successfully produced net in file /tmp/petri1025_16945867750284472283.dot
Successfully produced net in file /tmp/petri1026_249097177894507949.dot
Successfully produced net in file /tmp/petri1027_15366291206315074731.dot
Successfully produced net in file /tmp/petri1028_12048312478722037349.dot
Successfully produced net in file /tmp/petri1029_9590054398866221294.dot
Drop transitions removed 30 transitions
Dominated transitions for bounds rules discarded 30 transitions
Normalized transition count is 38 out of 262 initially.
// Phase 1: matrix 38 rows 52 cols
[2023-03-12 23:14:58] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 137341 resets, run finished after 1449 ms. (steps per millisecond=690 ) properties (out of 3) seen :3
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 45722 ms.
ITS solved all properties within timeout

BK_STOP 1678662901056

--------------------
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 UpperBounds -timeout 360 -rebuildPNML

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="LeafsetExtension-PT-S32C3"
export BK_EXAMINATION="UpperBounds"
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 LeafsetExtension-PT-S32C3, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-tall-167856421900509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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