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.r127-tall-167814504300015.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 gold2022
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 r127-tall-167814504300015
=====================================================================

--------------------
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 1678174370477

Running Version 202205111006
[2023-03-07 07:32:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-07 07:32:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:32:51] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2023-03-07 07:32:52] [INFO ] Transformed 2585 places.
[2023-03-07 07:32:52] [INFO ] Transformed 3095 transitions.
[2023-03-07 07:32:52] [INFO ] Found NUPN structural information;
[2023-03-07 07:32:52] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 334 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-07 07:32:52] [INFO ] Computed 4 place invariants in 71 ms
Incomplete random walk after 10000 steps, including 81 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :4
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-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :1
FORMULA CloudReconfiguration-PT-315-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 13 ms. (steps per millisecond=769 ) 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 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-07 07:32:52] [INFO ] Computed 4 place invariants in 32 ms
[2023-03-07 07:32:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 50 ms returned sat
[2023-03-07 07:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:54] [INFO ] [Real]Absence check using state equation in 1135 ms returned sat
[2023-03-07 07:32:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:32:54] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-07 07:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:55] [INFO ] [Nat]Absence check using state equation in 1156 ms returned sat
[2023-03-07 07:32:56] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 179 ms.
[2023-03-07 07:32:59] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-07 07:32:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 07:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:00] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2023-03-07 07:33:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:33:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:02] [INFO ] [Nat]Absence check using state equation in 1204 ms returned sat
[2023-03-07 07:33:02] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 150 ms.
[2023-03-07 07:33:06] [INFO ] Added : 125 causal constraints over 25 iterations in 3371 ms. Result :unknown
[2023-03-07 07:33:06] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 07:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:07] [INFO ] [Real]Absence check using state equation in 1268 ms returned sat
[2023-03-07 07:33:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:33:08] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-07 07:33:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:09] [INFO ] [Nat]Absence check using state equation in 1265 ms returned sat
[2023-03-07 07:33:09] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 153 ms.
[2023-03-07 07:33:12] [INFO ] Added : 125 causal constraints over 25 iterations in 3341 ms. Result :unknown
[2023-03-07 07:33:13] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:14] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2023-03-07 07:33:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:33:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:33:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:16] [INFO ] [Nat]Absence check using state equation in 1131 ms returned sat
[2023-03-07 07:33:16] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 167 ms.
[2023-03-07 07:33:19] [INFO ] Added : 125 causal constraints over 25 iterations in 3420 ms. Result :unknown
[2023-03-07 07:33:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-07 07:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:21] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2023-03-07 07:33:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:33:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:22] [INFO ] [Nat]Absence check using state equation in 1120 ms returned sat
[2023-03-07 07:33:23] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 136 ms.
[2023-03-07 07:33:26] [INFO ] Added : 125 causal constraints over 25 iterations in 3421 ms. Result :unknown
[2023-03-07 07:33:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 07:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:28] [INFO ] [Real]Absence check using state equation in 1364 ms returned sat
[2023-03-07 07:33:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:33:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:29] [INFO ] [Nat]Absence check using state equation in 1262 ms returned sat
[2023-03-07 07:33:30] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 133 ms.
[2023-03-07 07:33:33] [INFO ] Added : 115 causal constraints over 23 iterations in 3293 ms. Result :unknown
[2023-03-07 07:33:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 07:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:34] [INFO ] [Real]Absence check using state equation in 1212 ms returned sat
[2023-03-07 07:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:33:35] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2023-03-07 07:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:36] [INFO ] [Nat]Absence check using state equation in 1225 ms returned sat
[2023-03-07 07:33:36] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 145 ms.
[2023-03-07 07:33:40] [INFO ] Added : 115 causal constraints over 23 iterations in 3309 ms. Result :unknown
[2023-03-07 07:33:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 07:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:41] [INFO ] [Real]Absence check using state equation in 1227 ms returned sat
[2023-03-07 07:33:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:33:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-07 07:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:43] [INFO ] [Nat]Absence check using state equation in 1197 ms returned sat
[2023-03-07 07:33:43] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-07 07:33:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-07 07:33:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 07:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:48] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2023-03-07 07:33:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:33:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:33:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:50] [INFO ] [Nat]Absence check using state equation in 1152 ms returned sat
[2023-03-07 07:33:50] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 141 ms.
[2023-03-07 07:33:53] [INFO ] Added : 130 causal constraints over 26 iterations in 3412 ms. Result :unknown
[2023-03-07 07:33:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 07:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:55] [INFO ] [Real]Absence check using state equation in 1226 ms returned sat
[2023-03-07 07:33:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:33:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-07 07:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:33:57] [INFO ] [Nat]Absence check using state equation in 1315 ms returned sat
[2023-03-07 07:33:57] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 148 ms.
[2023-03-07 07:34:00] [INFO ] Added : 120 causal constraints over 24 iterations in 3193 ms. Result :unknown
[2023-03-07 07:34:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 07:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:01] [INFO ] [Real]Absence check using state equation in 1183 ms returned sat
[2023-03-07 07:34:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2023-03-07 07:34:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:03] [INFO ] [Nat]Absence check using state equation in 1226 ms returned sat
[2023-03-07 07:34:03] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 156 ms.
[2023-03-07 07:34:07] [INFO ] Added : 125 causal constraints over 25 iterations in 3305 ms. Result :unknown
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-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 10 out of 2585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2936 edges and 2585 vertex of which 848 / 2585 are part of one of the 63 SCC in 12 ms
Free SCC test removed 785 places
Drop transitions removed 957 transitions
Reduce isomorphic transitions removed 957 transitions.
Graph (complete) has 2418 edges and 1800 vertex of which 1786 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.6 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 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1209 rules applied. Total rules applied 1211 place count 1786 transition count 920
Reduce places removed 1200 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 1338 rules applied. Total rules applied 2549 place count 586 transition count 782
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 2620 place count 525 transition count 772
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 2626 place count 522 transition count 769
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 2630 place count 520 transition count 767
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 5 with 7 rules applied. Total rules applied 2637 place count 519 transition count 761
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2644 place count 513 transition count 760
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 23 Pre rules applied. Total rules applied 2644 place count 513 transition count 737
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 2690 place count 490 transition count 737
Discarding 78 places :
Symmetric choice reduction at 7 with 78 rule applications. Total rules 2768 place count 412 transition count 659
Iterating global reduction 7 with 78 rules applied. Total rules applied 2846 place count 412 transition count 659
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2846 place count 412 transition count 650
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 2864 place count 403 transition count 650
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 2924 place count 343 transition count 590
Iterating global reduction 7 with 60 rules applied. Total rules applied 2984 place count 343 transition count 590
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 3020 place count 343 transition count 554
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 28 rules applied. Total rules applied 3048 place count 325 transition count 544
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3053 place count 320 transition count 544
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 3073 place count 300 transition count 513
Iterating global reduction 10 with 20 rules applied. Total rules applied 3093 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 3102 place count 300 transition count 504
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 3110 place count 292 transition count 488
Iterating global reduction 11 with 8 rules applied. Total rules applied 3118 place count 292 transition count 488
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3121 place count 289 transition count 482
Iterating global reduction 11 with 3 rules applied. Total rules applied 3124 place count 289 transition count 482
Performed 152 Post agglomeration using F-continuation condition with reduction of 82 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 3428 place count 137 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 3432 place count 137 transition count 244
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 3440 place count 133 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3446 place count 133 transition count 234
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3452 place count 130 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3458 place count 130 transition count 225
Performed 36 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 14 with 72 rules applied. Total rules applied 3530 place count 94 transition count 247
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 3566 place count 94 transition count 211
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 3587 place count 73 transition count 176
Iterating global reduction 15 with 21 rules applied. Total rules applied 3608 place count 73 transition count 176
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 3620 place count 73 transition count 164
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 3626 place count 67 transition count 152
Iterating global reduction 16 with 6 rules applied. Total rules applied 3632 place count 67 transition count 152
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 3638 place count 67 transition count 146
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 17 with 5 rules applied. Total rules applied 3643 place count 67 transition count 141
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 3646 place count 67 transition count 138
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 3651 place count 64 transition count 136
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 18 with 4 rules applied. Total rules applied 3655 place count 64 transition count 136
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3656 place count 64 transition count 135
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 3658 place count 64 transition count 133
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 3660 place count 62 transition count 131
Iterating global reduction 19 with 2 rules applied. Total rules applied 3662 place count 62 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3663 place count 61 transition count 130
Applied a total of 3663 rules in 281 ms. Remains 61 /2585 variables (removed 2524) and now considering 130/3095 (removed 2965) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/2585 places, 130/3095 transitions.
Normalized transition count is 123 out of 130 initially.
// Phase 1: matrix 123 rows 61 cols
[2023-03-07 07:34:07] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 11877 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties (out of 10) seen :8
FORMULA CloudReconfiguration-PT-315-UpperBounds-14 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 1000000 steps, including 3827 resets, run finished after 321 ms. (steps per millisecond=3115 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3758 resets, run finished after 321 ms. (steps per millisecond=3115 ) properties (out of 2) seen :0
[2023-03-07 07:34:09] [INFO ] Flow matrix only has 123 transitions (discarded 7 similar events)
// Phase 1: matrix 123 rows 61 cols
[2023-03-07 07:34:09] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-07 07:34:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-07 07:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:09] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-07 07:34:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-07 07:34:09] [INFO ] [Real]Added 3 Read/Feed constraints in 21 ms returned sat
[2023-03-07 07:34:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-07 07:34:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:09] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-07 07:34:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-07 07:34:09] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 6 ms to minimize.
[2023-03-07 07:34:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-07 07:34:09] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-07 07:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:09] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-07 07:34:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-07 07:34:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:09] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-07 07:34:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-07 07:34:09] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2023-03-07 07:34:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 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 78052 ms.

BK_STOP 1678174449777

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="gold2022"
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 gold2022"
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 r127-tall-167814504300015"
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 ;