fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r045-oct2-162038292100491
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for CloudReconfiguration-PT-303

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
851.159 79689.00 102960.00 77.50 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038292100491.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CloudReconfiguration-PT-303, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038292100491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 165K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 660K May 5 16:51 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-303-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-303-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620584625308

Running Version 0
[2021-05-09 18:23:47] [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]
[2021-05-09 18:23:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 18:23:47] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2021-05-09 18:23:47] [INFO ] Transformed 2584 places.
[2021-05-09 18:23:47] [INFO ] Transformed 3094 transitions.
[2021-05-09 18:23:47] [INFO ] Found NUPN structural information;
[2021-05-09 18:23:47] [INFO ] Parsed PT model containing 2584 places and 3094 transitions in 155 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 3094 rows 2584 cols
[2021-05-09 18:23:47] [INFO ] Computed 4 place invariants in 54 ms
Incomplete random walk after 10000 steps, including 112 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :3
FORMULA CloudReconfiguration-PT-303-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 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 33 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :1
FORMULA CloudReconfiguration-PT-303-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :1
FORMULA CloudReconfiguration-PT-303-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 3094 rows 2584 cols
[2021-05-09 18:23:47] [INFO ] Computed 4 place invariants in 41 ms
[2021-05-09 18:23:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2021-05-09 18:23:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:49] [INFO ] [Real]Absence check using state equation in 885 ms returned sat
[2021-05-09 18:23:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2021-05-09 18:23:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:50] [INFO ] [Nat]Absence check using state equation in 1015 ms returned sat
[2021-05-09 18:23:51] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 151 ms.
[2021-05-09 18:23:54] [INFO ] Added : 145 causal constraints over 29 iterations in 3544 ms. Result :unknown
[2021-05-09 18:23:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 36 ms returned sat
[2021-05-09 18:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:56] [INFO ] [Real]Absence check using state equation in 1644 ms returned sat
[2021-05-09 18:23:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:23:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 50 ms returned sat
[2021-05-09 18:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:23:58] [INFO ] [Nat]Absence check using state equation in 984 ms returned sat
[2021-05-09 18:23:58] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 274 ms.
[2021-05-09 18:24:01] [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 1
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 18:24:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-09 18:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:03] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2021-05-09 18:24:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:24:03] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2021-05-09 18:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:04] [INFO ] [Nat]Absence check using state equation in 1056 ms returned sat
[2021-05-09 18:24:05] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 232 ms.
[2021-05-09 18:24:08] [INFO ] Added : 140 causal constraints over 28 iterations in 3543 ms. Result :unknown
[2021-05-09 18:24:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2021-05-09 18:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:10] [INFO ] [Real]Absence check using state equation in 1765 ms returned sat
[2021-05-09 18:24:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:24:11] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2021-05-09 18:24:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:12] [INFO ] [Nat]Absence check using state equation in 1408 ms returned sat
[2021-05-09 18:24:12] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 128 ms.
[2021-05-09 18:24:15] [INFO ] Added : 125 causal constraints over 25 iterations in 3244 ms. Result :unknown
[2021-05-09 18:24:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 36 ms returned sat
[2021-05-09 18:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:17] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2021-05-09 18:24:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:24:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2021-05-09 18:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:18] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2021-05-09 18:24:19] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 131 ms.
[2021-05-09 18:24:22] [INFO ] Added : 120 causal constraints over 24 iterations in 3369 ms. Result :unknown
[2021-05-09 18:24:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2021-05-09 18:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:23] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2021-05-09 18:24:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:24:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 50 ms returned sat
[2021-05-09 18:24:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:26] [INFO ] [Nat]Absence check using state equation in 1461 ms returned sat
[2021-05-09 18:24:26] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 129 ms.
[2021-05-09 18:24:29] [INFO ] Added : 85 causal constraints over 17 iterations in 2810 ms. Result :unknown
[2021-05-09 18:24:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 36 ms returned sat
[2021-05-09 18:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:30] [INFO ] [Real]Absence check using state equation in 1130 ms returned sat
[2021-05-09 18:24:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:24:31] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2021-05-09 18:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:33] [INFO ] [Nat]Absence check using state equation in 1834 ms returned sat
[2021-05-09 18:24:33] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 310 ms.
[2021-05-09 18:24:35] [INFO ] Added : 75 causal constraints over 15 iterations in 2374 ms. Result :unknown
[2021-05-09 18:24:36] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 36 ms returned sat
[2021-05-09 18:24:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:37] [INFO ] [Real]Absence check using state equation in 1439 ms returned sat
[2021-05-09 18:24:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:24:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2021-05-09 18:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:39] [INFO ] [Nat]Absence check using state equation in 1116 ms returned sat
[2021-05-09 18:24:39] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 160 ms.
[2021-05-09 18:24:42] [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 7
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 18:24:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2021-05-09 18:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:44] [INFO ] [Real]Absence check using state equation in 1335 ms returned sat
[2021-05-09 18:24:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:24:45] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2021-05-09 18:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:46] [INFO ] [Nat]Absence check using state equation in 1004 ms returned sat
[2021-05-09 18:24:46] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 127 ms.
[2021-05-09 18:24:49] [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 8
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 18:24:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 35 ms returned sat
[2021-05-09 18:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:51] [INFO ] [Real]Absence check using state equation in 1476 ms returned sat
[2021-05-09 18:24:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:24:52] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2021-05-09 18:24:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:53] [INFO ] [Nat]Absence check using state equation in 1435 ms returned sat
[2021-05-09 18:24:53] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 147 ms.
[2021-05-09 18:24:56] [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 9
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 18:24:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 36 ms returned sat
[2021-05-09 18:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:58] [INFO ] [Real]Absence check using state equation in 917 ms returned sat
[2021-05-09 18:24:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 18:24:58] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2021-05-09 18:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 18:24:59] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2021-05-09 18:24:59] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 103 ms.
[2021-05-09 18:25:03] [INFO ] Added : 155 causal constraints over 31 iterations in 3778 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]
Incomplete Parikh walk after 74400 steps, including 585 resets, run finished after 167 ms. (steps per millisecond=445 ) properties (out of 11) seen :1 could not realise parikh vector
FORMULA CloudReconfiguration-PT-303-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 10 out of 2584 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Graph (trivial) has 2935 edges and 2584 vertex of which 834 / 2584 are part of one of the 60 SCC in 23 ms
Free SCC test removed 774 places
Drop transitions removed 941 transitions
Reduce isomorphic transitions removed 941 transitions.
Graph (complete) has 2431 edges and 1810 vertex of which 1796 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1201 transitions
Trivial Post-agglo rules discarded 1201 transitions
Performed 1201 trivial Post agglomeration. Transition count delta: 1201
Iterating post reduction 0 with 1210 rules applied. Total rules applied 1212 place count 1796 transition count 934
Reduce places removed 1201 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 1335 rules applied. Total rules applied 2547 place count 595 transition count 800
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 69 rules applied. Total rules applied 2616 place count 537 transition count 789
Reduce places removed 4 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 3 with 6 rules applied. Total rules applied 2622 place count 533 transition count 787
Reduce places removed 1 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 3 rules applied. Total rules applied 2625 place count 532 transition count 785
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 5 with 10 rules applied. Total rules applied 2635 place count 531 transition count 776
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2645 place count 522 transition count 775
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 24 Pre rules applied. Total rules applied 2645 place count 522 transition count 751
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 2693 place count 498 transition count 751
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2770 place count 421 transition count 674
Iterating global reduction 7 with 77 rules applied. Total rules applied 2847 place count 421 transition count 674
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 2847 place count 421 transition count 666
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 2863 place count 413 transition count 666
Discarding 62 places :
Symmetric choice reduction at 7 with 62 rule applications. Total rules 2925 place count 351 transition count 604
Iterating global reduction 7 with 62 rules applied. Total rules applied 2987 place count 351 transition count 604
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 3021 place count 351 transition count 570
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 8 with 25 rules applied. Total rules applied 3046 place count 334 transition count 562
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 3050 place count 330 transition count 562
Discarding 21 places :
Symmetric choice reduction at 10 with 21 rule applications. Total rules 3071 place count 309 transition count 529
Iterating global reduction 10 with 21 rules applied. Total rules applied 3092 place count 309 transition count 529
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3101 place count 309 transition count 520
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 3110 place count 300 transition count 502
Iterating global reduction 11 with 9 rules applied. Total rules applied 3119 place count 300 transition count 502
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3122 place count 297 transition count 496
Iterating global reduction 11 with 3 rules applied. Total rules applied 3125 place count 297 transition count 496
Performed 157 Post agglomeration using F-continuation condition with reduction of 81 identical transitions.
Deduced a syphon composed of 157 places in 1 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 11 with 314 rules applied. Total rules applied 3439 place count 140 transition count 258
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 3444 place count 140 transition count 253
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 3450 place count 137 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3456 place count 137 transition count 244
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3462 place count 134 transition count 241
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3468 place count 134 transition count 235
Performed 39 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 14 with 78 rules applied. Total rules applied 3546 place count 95 transition count 264
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 14 with 30 rules applied. Total rules applied 3576 place count 95 transition count 234
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 3597 place count 74 transition count 192
Iterating global reduction 15 with 21 rules applied. Total rules applied 3618 place count 74 transition count 192
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 15 with 11 rules applied. Total rules applied 3629 place count 74 transition count 181
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 3634 place count 69 transition count 171
Iterating global reduction 16 with 5 rules applied. Total rules applied 3639 place count 69 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 3644 place count 69 transition count 166
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 3645 place count 69 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 3647 place count 68 transition count 164
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 3652 place count 68 transition count 159
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 3660 place count 63 transition count 156
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 3662 place count 63 transition count 154
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 3664 place count 63 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 3665 place count 63 transition count 153
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3666 place count 62 transition count 152
Iterating global reduction 18 with 1 rules applied. Total rules applied 3667 place count 62 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 3668 place count 61 transition count 151
Applied a total of 3668 rules in 248 ms. Remains 61 /2584 variables (removed 2523) and now considering 151/3094 (removed 2943) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/2584 places, 151/3094 transitions.
Normalized transition count is 140 out of 151 initially.
// Phase 1: matrix 140 rows 61 cols
[2021-05-09 18:25:03] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 18229 resets, run finished after 974 ms. (steps per millisecond=1026 ) properties (out of 10) seen :10
FORMULA CloudReconfiguration-PT-303-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620584704997

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-303"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-303, 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 r045-oct2-162038292100491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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