fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r105-tall-167814480800117
Last Updated
May 14, 2023

About the Execution of LTSMin+red for CloudReconfiguration-PT-315

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
647.100 81889.00 100200.00 620.30 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.4K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 11:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 11:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:51 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 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-315-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-315-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678260918909

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-315
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 07:35:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 07:35:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 07:35:20] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-08 07:35:20] [INFO ] Transformed 2585 places.
[2023-03-08 07:35:20] [INFO ] Transformed 3095 transitions.
[2023-03-08 07:35:20] [INFO ] Found NUPN structural information;
[2023-03-08 07:35:21] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-08 07:35:21] [INFO ] Computed 4 place invariants in 66 ms
Incomplete random walk after 10000 steps, including 78 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :5
FORMULA CloudReconfiguration-PT-315-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 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 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 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 24 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :0
[2023-03-08 07:35:21] [INFO ] Invariant cache hit.
[2023-03-08 07:35:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 52 ms returned sat
[2023-03-08 07:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:35:23] [INFO ] [Real]Absence check using state equation in 1166 ms returned sat
[2023-03-08 07:35:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:35:23] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 07:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:35:25] [INFO ] [Nat]Absence check using state equation in 1214 ms returned sat
[2023-03-08 07:35:25] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 190 ms.
[2023-03-08 07:35: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: Broken pipe ... 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: Broken pipe ...
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 07:35:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 07:35:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:35:30] [INFO ] [Real]Absence check using state equation in 1287 ms returned sat
[2023-03-08 07:35:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:35:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-08 07:35:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:35:32] [INFO ] [Nat]Absence check using state equation in 1411 ms returned sat
[2023-03-08 07:35:32] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 153 ms.
[2023-03-08 07:35:35] [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 07:35:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 07:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:35:37] [INFO ] [Real]Absence check using state equation in 1331 ms returned sat
[2023-03-08 07:35:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:35:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 07:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:35:39] [INFO ] [Nat]Absence check using state equation in 1281 ms returned sat
[2023-03-08 07:35:39] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 162 ms.
[2023-03-08 07:35:42] [INFO ] Added : 115 causal constraints over 23 iterations in 3256 ms. Result :unknown
[2023-03-08 07:35:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 07:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:35:44] [INFO ] [Real]Absence check using state equation in 1232 ms returned sat
[2023-03-08 07:35:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:35:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-08 07:35:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:35:45] [INFO ] [Nat]Absence check using state equation in 1236 ms returned sat
[2023-03-08 07:35:46] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 153 ms.
[2023-03-08 07:35:49] [INFO ] Added : 120 causal constraints over 24 iterations in 3263 ms. Result :unknown
[2023-03-08 07:35:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 07:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:35:50] [INFO ] [Real]Absence check using state equation in 1298 ms returned sat
[2023-03-08 07:35:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:35:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-08 07:35:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:35:52] [INFO ] [Nat]Absence check using state equation in 1209 ms returned sat
[2023-03-08 07:35:52] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 177 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-08 07:35:56] [INFO ] Added : 120 causal constraints over 24 iterations in 3391 ms. Result :unknown
[2023-03-08 07:35:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 07:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:35:57] [INFO ] [Real]Absence check using state equation in 1306 ms returned sat
[2023-03-08 07:35:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:35:58] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 07:35:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:35:59] [INFO ] [Nat]Absence check using state equation in 1251 ms returned sat
[2023-03-08 07:35:59] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 156 ms.
[2023-03-08 07:36:03] [INFO ] Added : 115 causal constraints over 23 iterations in 3252 ms. Result :unknown
[2023-03-08 07:36:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 07:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:04] [INFO ] [Real]Absence check using state equation in 1304 ms returned sat
[2023-03-08 07:36:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:36:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-08 07:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:06] [INFO ] [Nat]Absence check using state equation in 1302 ms returned sat
[2023-03-08 07:36:06] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 149 ms.
[2023-03-08 07:36:09] [INFO ] Added : 110 causal constraints over 22 iterations in 3195 ms. Result :unknown
[2023-03-08 07:36:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 07:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:11] [INFO ] [Real]Absence check using state equation in 1286 ms returned sat
[2023-03-08 07:36:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:36:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 07:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:13] [INFO ] [Nat]Absence check using state equation in 1251 ms returned sat
[2023-03-08 07:36:13] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 158 ms.
[2023-03-08 07:36:16] [INFO ] Added : 120 causal constraints over 24 iterations in 3272 ms. Result :unknown
[2023-03-08 07:36:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 07:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:18] [INFO ] [Real]Absence check using state equation in 1264 ms returned sat
[2023-03-08 07:36:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:36:18] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-08 07:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:20] [INFO ] [Nat]Absence check using state equation in 1225 ms returned sat
[2023-03-08 07:36:20] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 138 ms.
[2023-03-08 07:36:23] [INFO ] Added : 120 causal constraints over 24 iterations in 3319 ms. Result :unknown
[2023-03-08 07:36:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 07:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:25] [INFO ] [Real]Absence check using state equation in 1287 ms returned sat
[2023-03-08 07:36:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:36:25] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 57 ms returned sat
[2023-03-08 07:36:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:27] [INFO ] [Nat]Absence check using state equation in 1306 ms returned sat
[2023-03-08 07:36:27] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 125 ms.
[2023-03-08 07:36:30] [INFO ] Added : 120 causal constraints over 24 iterations in 3205 ms. Result :unknown
[2023-03-08 07:36:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2023-03-08 07:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:32] [INFO ] [Real]Absence check using state equation in 1208 ms returned sat
[2023-03-08 07:36:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:36:32] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-08 07:36:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:33] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2023-03-08 07:36:34] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 166 ms.
[2023-03-08 07:36:37] [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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-315-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 10 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2934 edges and 2585 vertex of which 842 / 2585 are part of one of the 62 SCC in 15 ms
Free SCC test removed 780 places
Drop transitions removed 951 transitions
Reduce isomorphic transitions removed 951 transitions.
Graph (complete) has 2424 edges and 1805 vertex of which 1791 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 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 1201 transitions
Trivial Post-agglo rules discarded 1201 transitions
Performed 1201 trivial Post agglomeration. Transition count delta: 1201
Iterating post reduction 0 with 1210 rules applied. Total rules applied 1212 place count 1791 transition count 925
Reduce places removed 1201 places and 0 transitions.
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 1 with 1339 rules applied. Total rules applied 2551 place count 590 transition count 787
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 71 rules applied. Total rules applied 2622 place count 529 transition count 777
Reduce places removed 3 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 3 with 6 rules applied. Total rules applied 2628 place count 526 transition count 774
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 2632 place count 524 transition count 772
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 5 with 9 rules applied. Total rules applied 2641 place count 523 transition count 764
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2650 place count 515 transition count 763
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2650 place count 515 transition count 741
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2694 place count 493 transition count 741
Discarding 79 places :
Symmetric choice reduction at 7 with 79 rule applications. Total rules 2773 place count 414 transition count 662
Iterating global reduction 7 with 79 rules applied. Total rules applied 2852 place count 414 transition count 662
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2852 place count 414 transition count 653
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2870 place count 405 transition count 653
Discarding 61 places :
Symmetric choice reduction at 7 with 61 rule applications. Total rules 2931 place count 344 transition count 592
Iterating global reduction 7 with 61 rules applied. Total rules applied 2992 place count 344 transition count 592
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 7 with 36 rules applied. Total rules applied 3028 place count 344 transition count 556
Reduce places removed 18 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 30 rules applied. Total rules applied 3058 place count 326 transition count 544
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 3064 place count 320 transition count 544
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 3084 place count 300 transition count 513
Iterating global reduction 10 with 20 rules applied. Total rules applied 3104 place count 300 transition count 513
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3113 place count 300 transition count 504
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 3121 place count 292 transition count 488
Iterating global reduction 11 with 8 rules applied. Total rules applied 3129 place count 292 transition count 488
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3132 place count 289 transition count 482
Iterating global reduction 11 with 3 rules applied. Total rules applied 3135 place count 289 transition count 482
Performed 151 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 11 with 302 rules applied. Total rules applied 3437 place count 138 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 3441 place count 138 transition count 245
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 3449 place count 134 transition count 241
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3455 place count 134 transition count 235
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 3461 place count 131 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3467 place count 131 transition count 226
Performed 37 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 14 with 74 rules applied. Total rules applied 3541 place count 94 transition count 248
Drop transitions removed 8 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 14 with 36 rules applied. Total rules applied 3577 place count 94 transition count 212
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 3598 place count 73 transition count 177
Iterating global reduction 15 with 21 rules applied. Total rules applied 3619 place count 73 transition count 177
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 3631 place count 73 transition count 165
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 3636 place count 68 transition count 155
Iterating global reduction 16 with 5 rules applied. Total rules applied 3641 place count 68 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 3646 place count 68 transition count 150
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 3651 place count 68 transition count 145
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 3654 place count 68 transition count 142
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 3659 place count 65 transition count 140
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 18 with 4 rules applied. Total rules applied 3663 place count 65 transition count 140
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3664 place count 65 transition count 139
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 3666 place count 65 transition count 137
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 3668 place count 63 transition count 135
Iterating global reduction 19 with 2 rules applied. Total rules applied 3670 place count 63 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3671 place count 62 transition count 134
Applied a total of 3671 rules in 291 ms. Remains 62 /2585 variables (removed 2523) and now considering 134/3095 (removed 2961) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 62/2585 places, 134/3095 transitions.
Normalized transition count is 127 out of 134 initially.
// Phase 1: matrix 127 rows 62 cols
[2023-03-08 07:36:37] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 11696 resets, run finished after 1068 ms. (steps per millisecond=936 ) properties (out of 10) seen :8
FORMULA CloudReconfiguration-PT-315-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3870 resets, run finished after 344 ms. (steps per millisecond=2906 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3783 resets, run finished after 338 ms. (steps per millisecond=2958 ) properties (out of 2) seen :0
[2023-03-08 07:36:39] [INFO ] Flow matrix only has 127 transitions (discarded 7 similar events)
// Phase 1: matrix 127 rows 62 cols
[2023-03-08 07:36:39] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 07:36:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 07:36:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 07:36:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 07:36:39] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-08 07:36:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:36:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 07:36:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:39] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-08 07:36:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-08 07:36:39] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
[2023-03-08 07:36:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 62 ms
[2023-03-08 07:36:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 07:36:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:39] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 07:36:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:36:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 07:36:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:36:39] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-08 07:36:39] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2023-03-08 07:36:39] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2023-03-08 07:36:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
Current structural bounds on expressions (after SMT) : [0, 0] Max seen :[0, 0]
FORMULA CloudReconfiguration-PT-315-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CloudReconfiguration-PT-315-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 79250 ms.
ITS solved all properties within timeout

BK_STOP 1678261000798

--------------------
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-315"
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-315, 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-167814480800117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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