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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 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-308-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678174269497

Running Version 202205111006
[2023-03-07 07:31:10] [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:31:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:31:11] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2023-03-07 07:31:11] [INFO ] Transformed 2585 places.
[2023-03-07 07:31:11] [INFO ] Transformed 3095 transitions.
[2023-03-07 07:31:11] [INFO ] Found NUPN structural information;
[2023-03-07 07:31:11] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 307 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:31:11] [INFO ] Computed 4 place invariants in 57 ms
Incomplete random walk after 10000 steps, including 68 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :2
FORMULA CloudReconfiguration-PT-308-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-308-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :0
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-07 07:31:11] [INFO ] Computed 4 place invariants in 19 ms
[2023-03-07 07:31:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-07 07:31:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:13] [INFO ] [Real]Absence check using state equation in 1203 ms returned sat
[2023-03-07 07:31:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:31:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:31:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:15] [INFO ] [Nat]Absence check using state equation in 1164 ms returned sat
[2023-03-07 07:31:15] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 165 ms.
[2023-03-07 07:31:18] [INFO ] Added : 120 causal constraints over 24 iterations in 3323 ms. Result :unknown
[2023-03-07 07:31:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 07:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:20] [INFO ] [Real]Absence check using state equation in 1138 ms returned sat
[2023-03-07 07:31:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:31:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 07:31:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:21] [INFO ] [Nat]Absence check using state equation in 1225 ms returned sat
[2023-03-07 07:31:22] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 144 ms.
[2023-03-07 07:31:25] [INFO ] Added : 120 causal constraints over 24 iterations in 3281 ms. Result :unknown
[2023-03-07 07:31:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 07:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:26] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2023-03-07 07:31:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:31:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 07:31:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:28] [INFO ] [Nat]Absence check using state equation in 1218 ms returned sat
[2023-03-07 07:31:28] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 145 ms.
[2023-03-07 07:31:31] [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 2
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: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:31:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 07:31:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:33] [INFO ] [Real]Absence check using state equation in 1238 ms returned sat
[2023-03-07 07:31:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:31:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 07:31:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:35] [INFO ] [Nat]Absence check using state equation in 1203 ms returned sat
[2023-03-07 07:31:35] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 139 ms.
[2023-03-07 07:31:38] [INFO ] Added : 130 causal constraints over 26 iterations in 3394 ms. Result :unknown
[2023-03-07 07:31:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 07:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:40] [INFO ] [Real]Absence check using state equation in 1165 ms returned sat
[2023-03-07 07:31:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:31:40] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-07 07:31:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:42] [INFO ] [Nat]Absence check using state equation in 1557 ms returned sat
[2023-03-07 07:31:42] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 137 ms.
[2023-03-07 07:31:45] [INFO ] Added : 115 causal constraints over 23 iterations in 3066 ms. Result :unknown
[2023-03-07 07:31:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 07:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:47] [INFO ] [Real]Absence check using state equation in 1135 ms returned sat
[2023-03-07 07:31:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:31:47] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:31:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:48] [INFO ] [Nat]Absence check using state equation in 1127 ms returned sat
[2023-03-07 07:31:48] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 142 ms.
[2023-03-07 07:31:52] [INFO ] Added : 130 causal constraints over 26 iterations in 3390 ms. Result :unknown
[2023-03-07 07:31:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 07:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:53] [INFO ] [Real]Absence check using state equation in 1105 ms returned sat
[2023-03-07 07:31:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:31:54] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 07:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:31:55] [INFO ] [Nat]Absence check using state equation in 1065 ms returned sat
[2023-03-07 07:31:55] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 147 ms.
[2023-03-07 07:31:58] [INFO ] Added : 124 causal constraints over 25 iterations in 3514 ms. Result :unknown
[2023-03-07 07:31:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:31:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:00] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2023-03-07 07:32:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:32:00] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:32:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:02] [INFO ] [Nat]Absence check using state equation in 1237 ms returned sat
[2023-03-07 07:32:02] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 127 ms.
[2023-03-07 07:32:05] [INFO ] Added : 130 causal constraints over 26 iterations in 3346 ms. Result :unknown
[2023-03-07 07:32:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 07:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:07] [INFO ] [Real]Absence check using state equation in 1164 ms returned sat
[2023-03-07 07:32:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:32:07] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:08] [INFO ] [Nat]Absence check using state equation in 1182 ms returned sat
[2023-03-07 07:32:08] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-07 07:32:12] [INFO ] Added : 120 causal constraints over 24 iterations in 3405 ms. Result :unknown
[2023-03-07 07:32:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 07:32:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:13] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2023-03-07 07:32:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:32:14] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:32:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:15] [INFO ] [Nat]Absence check using state equation in 1129 ms returned sat
[2023-03-07 07:32:15] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 142 ms.
[2023-03-07 07:32:18] [INFO ] Added : 135 causal constraints over 27 iterations in 3420 ms. Result :unknown
[2023-03-07 07:32:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 07:32:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:20] [INFO ] [Real]Absence check using state equation in 1160 ms returned sat
[2023-03-07 07:32:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:32:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:32:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:21] [INFO ] [Nat]Absence check using state equation in 1072 ms returned sat
[2023-03-07 07:32:22] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 137 ms.
[2023-03-07 07:32:25] [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 10
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: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:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 07:32:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:27] [INFO ] [Real]Absence check using state equation in 1194 ms returned sat
[2023-03-07 07:32:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:32:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 07:32:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:28] [INFO ] [Nat]Absence check using state equation in 1202 ms returned sat
[2023-03-07 07:32:28] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 136 ms.
[2023-03-07 07:32:32] [INFO ] Added : 125 causal constraints over 25 iterations in 3403 ms. Result :unknown
[2023-03-07 07:32:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 07:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:33] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2023-03-07 07:32:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:32:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 07:32:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:32:35] [INFO ] [Nat]Absence check using state equation in 1112 ms returned sat
[2023-03-07 07:32:35] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 136 ms.
[2023-03-07 07:32:38] [INFO ] Added : 130 causal constraints over 26 iterations in 3467 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-308-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 12 out of 2585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2933 edges and 2585 vertex of which 853 / 2585 are part of one of the 63 SCC in 20 ms
Free SCC test removed 790 places
Drop transitions removed 965 transitions
Reduce isomorphic transitions removed 965 transitions.
Graph (complete) has 2410 edges and 1795 vertex of which 1781 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.22 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 1191 transitions
Trivial Post-agglo rules discarded 1191 transitions
Performed 1191 trivial Post agglomeration. Transition count delta: 1191
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1202 place count 1781 transition count 921
Reduce places removed 1191 places and 0 transitions.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 1325 rules applied. Total rules applied 2527 place count 590 transition count 787
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 67 rules applied. Total rules applied 2594 place count 530 transition count 780
Reduce places removed 2 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 5 rules applied. Total rules applied 2599 place count 528 transition count 777
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 2603 place count 526 transition count 775
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 2610 place count 525 transition count 769
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2616 place count 519 transition count 769
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2616 place count 519 transition count 747
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2660 place count 497 transition count 747
Discarding 78 places :
Symmetric choice reduction at 7 with 78 rule applications. Total rules 2738 place count 419 transition count 669
Iterating global reduction 7 with 78 rules applied. Total rules applied 2816 place count 419 transition count 669
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2816 place count 419 transition count 660
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 2834 place count 410 transition count 660
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 2894 place count 350 transition count 600
Iterating global reduction 7 with 60 rules applied. Total rules applied 2954 place count 350 transition count 600
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 7 with 34 rules applied. Total rules applied 2988 place count 350 transition count 566
Reduce places removed 17 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 27 rules applied. Total rules applied 3015 place count 333 transition count 556
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3020 place count 328 transition count 556
Discarding 21 places :
Symmetric choice reduction at 10 with 21 rule applications. Total rules 3041 place count 307 transition count 523
Iterating global reduction 10 with 21 rules applied. Total rules applied 3062 place count 307 transition count 523
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3071 place count 307 transition count 514
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 3080 place count 298 transition count 496
Iterating global reduction 11 with 9 rules applied. Total rules applied 3089 place count 298 transition count 496
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3092 place count 295 transition count 490
Iterating global reduction 11 with 3 rules applied. Total rules applied 3095 place count 295 transition count 490
Performed 154 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 11 with 308 rules applied. Total rules applied 3403 place count 141 transition count 258
Drop transitions removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3410 place count 141 transition count 251
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 3416 place count 138 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 3420 place count 138 transition count 244
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 3424 place count 136 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 3428 place count 136 transition count 238
Performed 38 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 14 with 76 rules applied. Total rules applied 3504 place count 98 transition count 271
Drop transitions removed 10 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 14 with 42 rules applied. Total rules applied 3546 place count 98 transition count 229
Discarding 20 places :
Symmetric choice reduction at 15 with 20 rule applications. Total rules 3566 place count 78 transition count 196
Iterating global reduction 15 with 20 rules applied. Total rules applied 3586 place count 78 transition count 196
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 15 with 11 rules applied. Total rules applied 3597 place count 78 transition count 185
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3601 place count 74 transition count 177
Iterating global reduction 16 with 4 rules applied. Total rules applied 3605 place count 74 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 3609 place count 74 transition count 173
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 17 with 14 rules applied. Total rules applied 3623 place count 74 transition count 159
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3624 place count 73 transition count 156
Iterating global reduction 17 with 1 rules applied. Total rules applied 3625 place count 73 transition count 156
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3626 place count 72 transition count 155
Iterating global reduction 17 with 1 rules applied. Total rules applied 3627 place count 72 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 3628 place count 72 transition count 154
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3629 place count 72 transition count 153
Free-agglomeration rule applied 8 times.
Iterating global reduction 18 with 8 rules applied. Total rules applied 3637 place count 72 transition count 145
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 10 rules applied. Total rules applied 3647 place count 64 transition count 143
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 3649 place count 64 transition count 141
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3650 place count 64 transition count 141
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 3652 place count 63 transition count 140
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 3654 place count 63 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 3655 place count 62 transition count 139
Applied a total of 3655 rules in 327 ms. Remains 62 /2585 variables (removed 2523) and now considering 139/3095 (removed 2956) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/2585 places, 139/3095 transitions.
Normalized transition count is 130 out of 139 initially.
// Phase 1: matrix 130 rows 62 cols
[2023-03-07 07:32:39] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 13101 resets, run finished after 1023 ms. (steps per millisecond=977 ) properties (out of 12) seen :12
FORMULA CloudReconfiguration-PT-308-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 89698 ms.

BK_STOP 1678174360469

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ 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-308"
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-308, 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-167814504300008"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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