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.r105-tall-167814480600005.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 ltsminxred
Input is CloudReconfiguration-PT-301, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814480600005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-301-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678256640954

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-301
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 06:24:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 06:24:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:24:02] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-08 06:24:02] [INFO ] Transformed 2584 places.
[2023-03-08 06:24:02] [INFO ] Transformed 3094 transitions.
[2023-03-08 06:24:02] [INFO ] Found NUPN structural information;
[2023-03-08 06:24:02] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3094 rows 2584 cols
[2023-03-08 06:24:03] [INFO ] Computed 4 place invariants in 67 ms
Incomplete random walk after 10000 steps, including 75 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :4
FORMULA CloudReconfiguration-PT-301-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :1
FORMULA CloudReconfiguration-PT-301-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :1
FORMULA CloudReconfiguration-PT-301-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
[2023-03-08 06:24:03] [INFO ] Invariant cache hit.
[2023-03-08 06:24:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-08 06:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:05] [INFO ] [Real]Absence check using state equation in 1504 ms returned sat
[2023-03-08 06:24:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:24:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 51 ms returned sat
[2023-03-08 06:24:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:07] [INFO ] [Nat]Absence check using state equation in 1243 ms returned sat
[2023-03-08 06:24:07] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 172 ms.
[2023-03-08 06:24:10] [INFO ] Added : 120 causal constraints over 24 iterations in 3291 ms. Result :unknown
[2023-03-08 06:24:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 06:24:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:12] [INFO ] [Real]Absence check using state equation in 1135 ms returned sat
[2023-03-08 06:24:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:24:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 06:24:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:13] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2023-03-08 06:24:14] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 136 ms.
[2023-03-08 06:24:17] [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.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-08 06:24:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 06:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:18] [INFO ] [Real]Absence check using state equation in 1099 ms returned sat
[2023-03-08 06:24:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:24:19] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:24:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:20] [INFO ] [Nat]Absence check using state equation in 1164 ms returned sat
[2023-03-08 06:24:20] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 145 ms.
[2023-03-08 06:24:23] [INFO ] Added : 125 causal constraints over 25 iterations in 3393 ms. Result :unknown
[2023-03-08 06:24:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 06:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:25] [INFO ] [Real]Absence check using state equation in 1179 ms returned sat
[2023-03-08 06:24:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:24:26] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:24:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:27] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2023-03-08 06:24:27] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 132 ms.
[2023-03-08 06:24:30] [INFO ] Added : 125 causal constraints over 25 iterations in 3309 ms. Result :unknown
[2023-03-08 06:24:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:32] [INFO ] [Real]Absence check using state equation in 1201 ms returned sat
[2023-03-08 06:24:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:24:32] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:34] [INFO ] [Nat]Absence check using state equation in 1190 ms returned sat
[2023-03-08 06:24:34] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 148 ms.
[2023-03-08 06:24:37] [INFO ] Added : 130 causal constraints over 26 iterations in 3293 ms. Result :unknown
[2023-03-08 06:24:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:39] [INFO ] [Real]Absence check using state equation in 1210 ms returned sat
[2023-03-08 06:24:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:24:39] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:24:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:40] [INFO ] [Nat]Absence check using state equation in 1186 ms returned sat
[2023-03-08 06:24:40] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 141 ms.
[2023-03-08 06:24:44] [INFO ] Added : 130 causal constraints over 26 iterations in 3359 ms. Result :unknown
[2023-03-08 06:24:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:45] [INFO ] [Real]Absence check using state equation in 1220 ms returned sat
[2023-03-08 06:24:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:24:46] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:24:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:47] [INFO ] [Nat]Absence check using state equation in 1198 ms returned sat
[2023-03-08 06:24:47] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 153 ms.
[2023-03-08 06:24:50] [INFO ] Added : 130 causal constraints over 26 iterations in 3353 ms. Result :unknown
[2023-03-08 06:24:51] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 06:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:52] [INFO ] [Real]Absence check using state equation in 1175 ms returned sat
[2023-03-08 06:24:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:24:52] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2023-03-08 06:24:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:54] [INFO ] [Nat]Absence check using state equation in 1167 ms returned sat
[2023-03-08 06:24:54] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 131 ms.
[2023-03-08 06:24:57] [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 7
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-08 06:24:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-08 06:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:24:59] [INFO ] [Real]Absence check using state equation in 1114 ms returned sat
[2023-03-08 06:24:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:24:59] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 51 ms returned sat
[2023-03-08 06:24:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:25:00] [INFO ] [Nat]Absence check using state equation in 1204 ms returned sat
[2023-03-08 06:25:01] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 133 ms.
[2023-03-08 06:25:04] [INFO ] Added : 130 causal constraints over 26 iterations in 3391 ms. Result :unknown
[2023-03-08 06:25:04] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 06:25:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:25:05] [INFO ] [Real]Absence check using state equation in 1053 ms returned sat
[2023-03-08 06:25:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:25:06] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 06:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:25:07] [INFO ] [Nat]Absence check using state equation in 1089 ms returned sat
[2023-03-08 06:25:07] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 132 ms.
[2023-03-08 06:25:10] [INFO ] Added : 127 causal constraints over 26 iterations in 3476 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-301-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 9 out of 2584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Graph (trivial) has 2943 edges and 2584 vertex of which 872 / 2584 are part of one of the 63 SCC in 15 ms
Free SCC test removed 809 places
Drop transitions removed 988 transitions
Reduce isomorphic transitions removed 988 transitions.
Graph (complete) has 2384 edges and 1775 vertex of which 1761 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1192 transitions
Trivial Post-agglo rules discarded 1192 transitions
Performed 1192 trivial Post agglomeration. Transition count delta: 1192
Iterating post reduction 0 with 1201 rules applied. Total rules applied 1203 place count 1761 transition count 896
Reduce places removed 1192 places and 0 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 1 with 1330 rules applied. Total rules applied 2533 place count 569 transition count 758
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 72 rules applied. Total rules applied 2605 place count 506 transition count 749
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 9 rules applied. Total rules applied 2614 place count 503 transition count 743
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 8 rules applied. Total rules applied 2622 place count 499 transition count 739
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 2626 place count 497 transition count 737
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2628 place count 495 transition count 737
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 2628 place count 495 transition count 716
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 2670 place count 474 transition count 716
Discarding 74 places :
Symmetric choice reduction at 7 with 74 rule applications. Total rules 2744 place count 400 transition count 642
Iterating global reduction 7 with 74 rules applied. Total rules applied 2818 place count 400 transition count 642
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 2818 place count 400 transition count 637
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 2828 place count 395 transition count 637
Discarding 59 places :
Symmetric choice reduction at 7 with 59 rule applications. Total rules 2887 place count 336 transition count 578
Iterating global reduction 7 with 59 rules applied. Total rules applied 2946 place count 336 transition count 578
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 7 with 34 rules applied. Total rules applied 2980 place count 336 transition count 544
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 8 with 29 rules applied. Total rules applied 3009 place count 319 transition count 532
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 3015 place count 313 transition count 532
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 3035 place count 293 transition count 501
Iterating global reduction 10 with 20 rules applied. Total rules applied 3055 place count 293 transition count 501
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3063 place count 293 transition count 493
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 3072 place count 284 transition count 475
Iterating global reduction 11 with 9 rules applied. Total rules applied 3081 place count 284 transition count 475
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3084 place count 281 transition count 469
Iterating global reduction 11 with 3 rules applied. Total rules applied 3087 place count 281 transition count 469
Performed 153 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 11 with 306 rules applied. Total rules applied 3393 place count 128 transition count 234
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3395 place count 128 transition count 232
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 3401 place count 125 transition count 229
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3407 place count 125 transition count 223
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3413 place count 122 transition count 220
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3419 place count 122 transition count 214
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 14 with 68 rules applied. Total rules applied 3487 place count 88 transition count 249
Drop transitions removed 20 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 14 with 45 rules applied. Total rules applied 3532 place count 88 transition count 204
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 3553 place count 67 transition count 176
Iterating global reduction 15 with 21 rules applied. Total rules applied 3574 place count 67 transition count 176
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 15 with 11 rules applied. Total rules applied 3585 place count 67 transition count 165
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 3590 place count 62 transition count 155
Iterating global reduction 16 with 5 rules applied. Total rules applied 3595 place count 62 transition count 155
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 3600 place count 62 transition count 150
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 17 with 22 rules applied. Total rules applied 3622 place count 62 transition count 128
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3623 place count 61 transition count 125
Iterating global reduction 17 with 1 rules applied. Total rules applied 3624 place count 61 transition count 125
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3625 place count 60 transition count 124
Iterating global reduction 17 with 1 rules applied. Total rules applied 3626 place count 60 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 3627 place count 60 transition count 123
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3628 place count 60 transition count 122
Free-agglomeration rule applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 3632 place count 60 transition count 118
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 3638 place count 56 transition count 116
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 19 with 9 rules applied. Total rules applied 3647 place count 56 transition count 116
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 3650 place count 56 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3651 place count 55 transition count 112
Applied a total of 3651 rules in 334 ms. Remains 55 /2584 variables (removed 2529) and now considering 112/3094 (removed 2982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 55/2584 places, 112/3094 transitions.
Normalized transition count is 107 out of 112 initially.
// Phase 1: matrix 107 rows 55 cols
[2023-03-08 06:25:11] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 20810 resets, run finished after 987 ms. (steps per millisecond=1013 ) properties (out of 9) seen :9
FORMULA CloudReconfiguration-PT-301-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 69684 ms.
ITS solved all properties within timeout

BK_STOP 1678256713390

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="CloudReconfiguration-PT-301"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CloudReconfiguration-PT-301, 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 r105-tall-167814480600005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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