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-167814480800133.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-317, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814480800133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 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 661K 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-317-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678262410914

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-317
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 08:00:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 08:00:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:00:12] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-08 08:00:12] [INFO ] Transformed 2587 places.
[2023-03-08 08:00:12] [INFO ] Transformed 3099 transitions.
[2023-03-08 08:00:12] [INFO ] Found NUPN structural information;
[2023-03-08 08:00:12] [INFO ] Parsed PT model containing 2587 places and 3099 transitions and 6479 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 3099 rows 2587 cols
[2023-03-08 08:00:13] [INFO ] Computed 4 place invariants in 52 ms
Incomplete random walk after 10000 steps, including 114 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :2
FORMULA CloudReconfiguration-PT-317-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
[2023-03-08 08:00:13] [INFO ] Invariant cache hit.
[2023-03-08 08:00:13] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-08 08:00:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:15] [INFO ] [Real]Absence check using state equation in 1075 ms returned sat
[2023-03-08 08:00:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:00:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-08 08:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:16] [INFO ] [Nat]Absence check using state equation in 1126 ms returned sat
[2023-03-08 08:00:17] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 172 ms.
[2023-03-08 08:00:20] [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-08 08:00:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 08:00:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:21] [INFO ] [Real]Absence check using state equation in 1247 ms returned sat
[2023-03-08 08:00:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:00:22] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-08 08:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:23] [INFO ] [Nat]Absence check using state equation in 1291 ms returned sat
[2023-03-08 08:00:23] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 152 ms.
[2023-03-08 08:00:27] [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 08:00:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 08:00:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:28] [INFO ] [Real]Absence check using state equation in 1165 ms returned sat
[2023-03-08 08:00:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:00:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 08:00:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:30] [INFO ] [Nat]Absence check using state equation in 1172 ms returned sat
[2023-03-08 08:00:30] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 133 ms.
[2023-03-08 08:00:33] [INFO ] Added : 109 causal constraints over 23 iterations in 3358 ms. Result :unknown
[2023-03-08 08:00:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 08:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:35] [INFO ] [Real]Absence check using state equation in 1259 ms returned sat
[2023-03-08 08:00:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:00:35] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-08 08:00:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:37] [INFO ] [Nat]Absence check using state equation in 1541 ms returned sat
[2023-03-08 08:00:37] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 136 ms.
[2023-03-08 08:00:40] [INFO ] Added : 110 causal constraints over 22 iterations in 3027 ms. Result :unknown
[2023-03-08 08:00:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 08:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:42] [INFO ] [Real]Absence check using state equation in 1148 ms returned sat
[2023-03-08 08:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:00:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 08:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:43] [INFO ] [Nat]Absence check using state equation in 1172 ms returned sat
[2023-03-08 08:00:44] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 153 ms.
[2023-03-08 08:00:47] [INFO ] Added : 120 causal constraints over 24 iterations in 3380 ms. Result :unknown
[2023-03-08 08:00:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 08:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:48] [INFO ] [Real]Absence check using state equation in 1139 ms returned sat
[2023-03-08 08:00:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:00:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 08:00:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:50] [INFO ] [Nat]Absence check using state equation in 1154 ms returned sat
[2023-03-08 08:00:50] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-08 08:00:53] [INFO ] Added : 124 causal constraints over 25 iterations in 3417 ms. Result :unknown
[2023-03-08 08:00:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 08:00:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:55] [INFO ] [Real]Absence check using state equation in 1283 ms returned sat
[2023-03-08 08:00:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:00:56] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 08:00:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:57] [INFO ] [Nat]Absence check using state equation in 1469 ms returned sat
[2023-03-08 08:00:57] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 138 ms.
[2023-03-08 08:01:00] [INFO ] Added : 115 causal constraints over 23 iterations in 3133 ms. Result :unknown
[2023-03-08 08:01:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 08:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:02] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2023-03-08 08:01:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:01:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 08:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:04] [INFO ] [Nat]Absence check using state equation in 1763 ms returned sat
[2023-03-08 08:01:04] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 136 ms.
[2023-03-08 08:01:07] [INFO ] Added : 100 causal constraints over 20 iterations in 2825 ms. Result :unknown
[2023-03-08 08:01:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 08:01:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:09] [INFO ] [Real]Absence check using state equation in 1395 ms returned sat
[2023-03-08 08:01:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:01:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-08 08:01:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:11] [INFO ] [Nat]Absence check using state equation in 1410 ms returned sat
[2023-03-08 08:01:11] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 132 ms.
[2023-03-08 08:01:14] [INFO ] Added : 120 causal constraints over 24 iterations in 3166 ms. Result :unknown
[2023-03-08 08:01:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 08:01:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:16] [INFO ] [Real]Absence check using state equation in 1117 ms returned sat
[2023-03-08 08:01:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:01:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 08:01:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:17] [INFO ] [Nat]Absence check using state equation in 1132 ms returned sat
[2023-03-08 08:01:17] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 142 ms.
[2023-03-08 08:01:21] [INFO ] Added : 125 causal constraints over 25 iterations in 3437 ms. Result :unknown
[2023-03-08 08:01:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 08:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:22] [INFO ] [Real]Absence check using state equation in 1381 ms returned sat
[2023-03-08 08:01:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:01:23] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 08:01:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:24] [INFO ] [Nat]Absence check using state equation in 1371 ms returned sat
[2023-03-08 08:01:25] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-08 08:01: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 10
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 08:01:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 08:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:29] [INFO ] [Real]Absence check using state equation in 1193 ms returned sat
[2023-03-08 08:01:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:01:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-08 08:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:31] [INFO ] [Nat]Absence check using state equation in 1187 ms returned sat
[2023-03-08 08:01:31] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 116 ms.
[2023-03-08 08:01:34] [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 11
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 08:01:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 08:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:36] [INFO ] [Real]Absence check using state equation in 1258 ms returned sat
[2023-03-08 08:01:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:01:36] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 08:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:38] [INFO ] [Nat]Absence check using state equation in 1690 ms returned sat
[2023-03-08 08:01:38] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 135 ms.
[2023-03-08 08:01:41] [INFO ] Added : 105 causal constraints over 21 iterations in 2869 ms. Result :unknown
[2023-03-08 08:01:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 08:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:43] [INFO ] [Real]Absence check using state equation in 1137 ms returned sat
[2023-03-08 08:01:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:01:43] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 08:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:44] [INFO ] [Nat]Absence check using state equation in 1129 ms returned sat
[2023-03-08 08:01:45] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 125 ms.
[2023-03-08 08:01:48] [INFO ] Added : 117 causal constraints over 24 iterations in 3434 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 14 out of 2587 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Graph (trivial) has 2927 edges and 2587 vertex of which 812 / 2587 are part of one of the 61 SCC in 12 ms
Free SCC test removed 751 places
Drop transitions removed 913 transitions
Reduce isomorphic transitions removed 913 transitions.
Graph (complete) has 2472 edges and 1836 vertex of which 1822 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 1217 transitions
Trivial Post-agglo rules discarded 1217 transitions
Performed 1217 trivial Post agglomeration. Transition count delta: 1217
Iterating post reduction 0 with 1226 rules applied. Total rules applied 1228 place count 1822 transition count 951
Reduce places removed 1217 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 1 with 1356 rules applied. Total rules applied 2584 place count 605 transition count 812
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 2 with 66 rules applied. Total rules applied 2650 place count 546 transition count 805
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 5 rules applied. Total rules applied 2655 place count 544 transition count 802
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 rules applied. Total rules applied 2659 place count 543 transition count 799
Reduce places removed 2 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 5 with 14 rules applied. Total rules applied 2673 place count 541 transition count 787
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2686 place count 529 transition count 786
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 26 Pre rules applied. Total rules applied 2686 place count 529 transition count 760
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 2738 place count 503 transition count 760
Discarding 78 places :
Symmetric choice reduction at 7 with 78 rule applications. Total rules 2816 place count 425 transition count 682
Iterating global reduction 7 with 78 rules applied. Total rules applied 2894 place count 425 transition count 682
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2894 place count 425 transition count 673
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2912 place count 416 transition count 673
Discarding 61 places :
Symmetric choice reduction at 7 with 61 rule applications. Total rules 2973 place count 355 transition count 612
Iterating global reduction 7 with 61 rules applied. Total rules applied 3034 place count 355 transition count 612
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 3068 place count 355 transition count 578
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 3097 place count 338 transition count 566
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 3103 place count 332 transition count 566
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 3123 place count 312 transition count 535
Iterating global reduction 10 with 20 rules applied. Total rules applied 3143 place count 312 transition count 535
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3152 place count 312 transition count 526
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 3159 place count 305 transition count 512
Iterating global reduction 11 with 7 rules applied. Total rules applied 3166 place count 305 transition count 512
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3169 place count 302 transition count 506
Iterating global reduction 11 with 3 rules applied. Total rules applied 3172 place count 302 transition count 506
Performed 152 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 152 places in 0 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 11 with 304 rules applied. Total rules applied 3476 place count 150 transition count 274
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 3479 place count 150 transition count 271
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 12 with 6 rules applied. Total rules applied 3485 place count 147 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3491 place count 147 transition count 262
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 3495 place count 145 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 3499 place count 145 transition count 256
Performed 39 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 14 with 78 rules applied. Total rules applied 3577 place count 106 transition count 297
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 14 with 31 rules applied. Total rules applied 3608 place count 106 transition count 266
Discarding 22 places :
Symmetric choice reduction at 15 with 22 rule applications. Total rules 3630 place count 84 transition count 219
Iterating global reduction 15 with 22 rules applied. Total rules applied 3652 place count 84 transition count 219
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 3664 place count 84 transition count 207
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 3667 place count 81 transition count 201
Iterating global reduction 16 with 3 rules applied. Total rules applied 3670 place count 81 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 3673 place count 81 transition count 198
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 17 with 14 rules applied. Total rules applied 3687 place count 81 transition count 184
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 3692 place count 81 transition count 179
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 3698 place count 76 transition count 178
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 18 with 4 rules applied. Total rules applied 3702 place count 76 transition count 178
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3703 place count 76 transition count 177
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3704 place count 75 transition count 176
Iterating global reduction 18 with 1 rules applied. Total rules applied 3705 place count 75 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 3706 place count 74 transition count 175
Applied a total of 3706 rules in 282 ms. Remains 74 /2587 variables (removed 2513) and now considering 175/3099 (removed 2924) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 74/2587 places, 175/3099 transitions.
Normalized transition count is 163 out of 175 initially.
// Phase 1: matrix 163 rows 74 cols
[2023-03-08 08:01:48] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 8407 resets, run finished after 1216 ms. (steps per millisecond=822 ) properties (out of 14) seen :13
FORMULA CloudReconfiguration-PT-317-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2689 resets, run finished after 374 ms. (steps per millisecond=2673 ) properties (out of 1) seen :0
[2023-03-08 08:01:50] [INFO ] Flow matrix only has 163 transitions (discarded 12 similar events)
// Phase 1: matrix 163 rows 74 cols
[2023-03-08 08:01:50] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-08 08:01:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 08:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:50] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-08 08:01:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:01:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 08:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:01:50] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-08 08:01:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-08 08:01:50] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2023-03-08 08:01:50] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 4 ms to minimize.
[2023-03-08 08:01:50] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2023-03-08 08:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 79 ms
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA CloudReconfiguration-PT-317-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 98008 ms.
ITS solved all properties within timeout

BK_STOP 1678262511366

--------------------
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="CloudReconfiguration-PT-317"
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-317, 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-167814480800133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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