Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978700269.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVt-PT-010B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978700269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.2K Feb 25 22:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 22:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 22:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 119K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679347640054

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-010B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:27:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 21:27:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:27:22] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-20 21:27:22] [INFO ] Transformed 503 places.
[2023-03-20 21:27:22] [INFO ] Transformed 503 transitions.
[2023-03-20 21:27:22] [INFO ] Found NUPN structural information;
[2023-03-20 21:27:22] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 503 rows 503 cols
[2023-03-20 21:27:22] [INFO ] Computed 41 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :13
FORMULA ShieldRVt-PT-010B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
[2023-03-20 21:27:22] [INFO ] Invariant cache hit.
[2023-03-20 21:27:22] [INFO ] [Real]Absence check using 41 positive place invariants in 15 ms returned sat
[2023-03-20 21:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:27:23] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2023-03-20 21:27:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:27:23] [INFO ] [Nat]Absence check using 41 positive place invariants in 14 ms returned sat
[2023-03-20 21:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:27:23] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2023-03-20 21:27:23] [INFO ] Deduced a trap composed of 38 places in 350 ms of which 4 ms to minimize.
[2023-03-20 21:27:24] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 1 ms to minimize.
[2023-03-20 21:27:24] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 1 ms to minimize.
[2023-03-20 21:27:24] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2023-03-20 21:27:24] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 1 ms to minimize.
[2023-03-20 21:27:24] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 0 ms to minimize.
[2023-03-20 21:27:24] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2023-03-20 21:27:24] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2023-03-20 21:27:25] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2023-03-20 21:27:25] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 0 ms to minimize.
[2023-03-20 21:27:25] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 0 ms to minimize.
[2023-03-20 21:27:25] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2023-03-20 21:27:25] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2023-03-20 21:27:25] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2023-03-20 21:27:25] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2023-03-20 21:27:25] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2023-03-20 21:27:26] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 0 ms to minimize.
[2023-03-20 21:27:26] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
[2023-03-20 21:27:26] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2023-03-20 21:27:26] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2023-03-20 21:27:26] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2023-03-20 21:27:26] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2023-03-20 21:27:26] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2023-03-20 21:27:26] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2023-03-20 21:27:26] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2023-03-20 21:27:26] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 19 ms to minimize.
[2023-03-20 21:27:26] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3242 ms
[2023-03-20 21:27:26] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-20 21:27:28] [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-20 21:27:28] [INFO ] [Real]Absence check using 41 positive place invariants in 25 ms returned sat
[2023-03-20 21:27:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:27:28] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-20 21:27:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:27:28] [INFO ] [Nat]Absence check using 41 positive place invariants in 11 ms returned sat
[2023-03-20 21:27:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:27:28] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-20 21:27:28] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 1 ms to minimize.
[2023-03-20 21:27:29] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 1 ms to minimize.
[2023-03-20 21:27:29] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2023-03-20 21:27:29] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 1 ms to minimize.
[2023-03-20 21:27:29] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 0 ms to minimize.
[2023-03-20 21:27:29] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2023-03-20 21:27:29] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2023-03-20 21:27:29] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 2 ms to minimize.
[2023-03-20 21:27:29] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 5 ms to minimize.
[2023-03-20 21:27:29] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 0 ms to minimize.
[2023-03-20 21:27:30] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 0 ms to minimize.
[2023-03-20 21:27:30] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 0 ms to minimize.
[2023-03-20 21:27:30] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2023-03-20 21:27:30] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2023-03-20 21:27:30] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2023-03-20 21:27:30] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 1 ms to minimize.
[2023-03-20 21:27:30] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 0 ms to minimize.
[2023-03-20 21:27:30] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 0 ms to minimize.
[2023-03-20 21:27:30] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2023-03-20 21:27:31] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2023-03-20 21:27:31] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2365 ms
[2023-03-20 21:27:31] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-20 21:27:33] [INFO ] Added : 470 causal constraints over 95 iterations in 2422 ms. Result :unknown
[2023-03-20 21:27:33] [INFO ] [Real]Absence check using 41 positive place invariants in 15 ms returned sat
[2023-03-20 21:27:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 21:27:33] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2023-03-20 21:27:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 21:27:33] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2023-03-20 21:27:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 21:27:34] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-20 21:27:34] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 1 ms to minimize.
[2023-03-20 21:27:34] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2023-03-20 21:27:34] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 1 ms to minimize.
[2023-03-20 21:27:34] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 1 ms to minimize.
[2023-03-20 21:27:34] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2023-03-20 21:27:35] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 1 ms to minimize.
[2023-03-20 21:27:35] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 1 ms to minimize.
[2023-03-20 21:27:35] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2023-03-20 21:27:35] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2023-03-20 21:27:35] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2023-03-20 21:27:35] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2023-03-20 21:27:35] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 0 ms to minimize.
[2023-03-20 21:27:35] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2023-03-20 21:27:36] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 0 ms to minimize.
[2023-03-20 21:27:36] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 0 ms to minimize.
[2023-03-20 21:27:36] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2023-03-20 21:27:36] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 0 ms to minimize.
[2023-03-20 21:27:36] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2023-03-20 21:27:36] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2023-03-20 21:27:36] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2561 ms
[2023-03-20 21:27:36] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 52 ms.
[2023-03-20 21:27:39] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 3 ms to minimize.
[2023-03-20 21:27:39] [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 2
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] Max seen :[0, 0, 0]
Support contains 3 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 503/503 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 503 transition count 342
Reduce places removed 161 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 163 rules applied. Total rules applied 324 place count 342 transition count 340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 325 place count 341 transition count 340
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 325 place count 341 transition count 301
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 403 place count 302 transition count 301
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 472 place count 233 transition count 232
Iterating global reduction 3 with 69 rules applied. Total rules applied 541 place count 233 transition count 232
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 541 place count 233 transition count 204
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 597 place count 205 transition count 204
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 779 place count 114 transition count 113
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 835 place count 86 transition count 139
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 836 place count 86 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 837 place count 85 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 838 place count 84 transition count 137
Applied a total of 838 rules in 131 ms. Remains 84 /503 variables (removed 419) and now considering 137/503 (removed 366) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 84/503 places, 137/503 transitions.
// Phase 1: matrix 137 rows 84 cols
[2023-03-20 21:27:39] [INFO ] Computed 40 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 271 resets, run finished after 2366 ms. (steps per millisecond=422 ) properties (out of 3) seen :3
FORMULA ShieldRVt-PT-010B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 19554 ms.
ITS solved all properties within timeout

BK_STOP 1679347661989

--------------------
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="ShieldRVt-PT-010B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldRVt-PT-010B, 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 r426-tajo-167905978700269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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