fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r042-smll-165252095500269
Last Updated
Jun 22, 2022

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
489.224 119705.00 145473.00 447.90 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/fkordon/mcc2022-input.r042-smll-165252095500269.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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-308, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095500269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 5.8K Apr 29 14:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 29 14:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 14:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 14:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 660K May 10 09:33 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 1652658156721

Running Version 202205111006
[2022-05-15 23:42:39] [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]
[2022-05-15 23:42:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:42:40] [INFO ] Load time of PNML (sax parser for PT used): 527 ms
[2022-05-15 23:42:40] [INFO ] Transformed 2585 places.
[2022-05-15 23:42:40] [INFO ] Transformed 3095 transitions.
[2022-05-15 23:42:40] [INFO ] Found NUPN structural information;
[2022-05-15 23:42:40] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 894 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-15 23:42:40] [INFO ] Computed 4 place invariants in 106 ms
Incomplete random walk after 10000 steps, including 71 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :1
FORMULA CloudReconfiguration-PT-308-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :1
FORMULA CloudReconfiguration-PT-308-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 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 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :0
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-15 23:42:40] [INFO ] Computed 4 place invariants in 29 ms
[2022-05-15 23:42:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 106 ms returned sat
[2022-05-15 23:42:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:42:44] [INFO ] [Real]Absence check using state equation in 2395 ms returned sat
[2022-05-15 23:42:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:42:45] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 23:42:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:42:47] [INFO ] [Nat]Absence check using state equation in 2317 ms returned sat
[2022-05-15 23:42:48] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 351 ms.
[2022-05-15 23:42:50] [INFO ] Added : 20 causal constraints over 4 iterations in 1958 ms. Result :unknown
[2022-05-15 23:42:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 23:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:42:52] [INFO ] [Real]Absence check using state equation in 1803 ms returned sat
[2022-05-15 23:42:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:42:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 82 ms returned sat
[2022-05-15 23:42:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:42:55] [INFO ] [Nat]Absence check using state equation in 1920 ms returned sat
[2022-05-15 23:42:55] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 222 ms.
[2022-05-15 23:42:58] [INFO ] Added : 40 causal constraints over 8 iterations in 2431 ms. Result :unknown
[2022-05-15 23:42:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 23:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:01] [INFO ] [Real]Absence check using state equation in 2068 ms returned sat
[2022-05-15 23:43:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 103 ms returned sat
[2022-05-15 23:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:04] [INFO ] [Nat]Absence check using state equation in 2319 ms returned sat
[2022-05-15 23:43:04] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 295 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-05-15 23:43:06] [INFO ] Added : 20 causal constraints over 4 iterations in 1716 ms. Result :unknown
[2022-05-15 23:43:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 79 ms returned sat
[2022-05-15 23:43:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:09] [INFO ] [Real]Absence check using state equation in 2068 ms returned sat
[2022-05-15 23:43:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 102 ms returned sat
[2022-05-15 23:43:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:12] [INFO ] [Nat]Absence check using state equation in 2091 ms returned sat
[2022-05-15 23:43:12] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 199 ms.
[2022-05-15 23:43:14] [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 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 23:43:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 23:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:17] [INFO ] [Real]Absence check using state equation in 1874 ms returned sat
[2022-05-15 23:43:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:18] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 111 ms returned sat
[2022-05-15 23:43:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:20] [INFO ] [Nat]Absence check using state equation in 2052 ms returned sat
[2022-05-15 23:43:20] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 285 ms.
[2022-05-15 23:43:22] [INFO ] Added : 30 causal constraints over 6 iterations in 2066 ms. Result :unknown
[2022-05-15 23:43:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 63 ms returned sat
[2022-05-15 23:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:25] [INFO ] [Real]Absence check using state equation in 1955 ms returned sat
[2022-05-15 23:43:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:26] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2022-05-15 23:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:28] [INFO ] [Nat]Absence check using state equation in 1887 ms returned sat
[2022-05-15 23:43:28] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 291 ms.
[2022-05-15 23:43:30] [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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 23:43:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 23:43:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:33] [INFO ] [Real]Absence check using state equation in 1791 ms returned sat
[2022-05-15 23:43:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 23:43:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:35] [INFO ] [Nat]Absence check using state equation in 1823 ms returned sat
[2022-05-15 23:43:36] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 194 ms.
[2022-05-15 23:43:38] [INFO ] Added : 40 causal constraints over 8 iterations in 2578 ms. Result :unknown
[2022-05-15 23:43:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 99 ms returned sat
[2022-05-15 23:43:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:41] [INFO ] [Real]Absence check using state equation in 1931 ms returned sat
[2022-05-15 23:43:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 76 ms returned sat
[2022-05-15 23:43:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:43] [INFO ] [Nat]Absence check using state equation in 1710 ms returned sat
[2022-05-15 23:43:44] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 311 ms.
[2022-05-15 23:43:46] [INFO ] Added : 35 causal constraints over 7 iterations in 2481 ms. Result :unknown
[2022-05-15 23:43:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 23:43:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:49] [INFO ] [Real]Absence check using state equation in 1819 ms returned sat
[2022-05-15 23:43:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 111 ms returned sat
[2022-05-15 23:43:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:51] [INFO ] [Nat]Absence check using state equation in 1930 ms returned sat
[2022-05-15 23:43:52] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 190 ms.
[2022-05-15 23:43:54] [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: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)
[2022-05-15 23:43:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 23:43:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:57] [INFO ] [Real]Absence check using state equation in 1747 ms returned sat
[2022-05-15 23:43:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:43:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 23:43:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:43:59] [INFO ] [Nat]Absence check using state equation in 1755 ms returned sat
[2022-05-15 23:44:00] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 190 ms.
[2022-05-15 23:44:02] [INFO ] Added : 40 causal constraints over 8 iterations in 2471 ms. Result :unknown
[2022-05-15 23:44:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 98 ms returned sat
[2022-05-15 23:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:44:05] [INFO ] [Real]Absence check using state equation in 1923 ms returned sat
[2022-05-15 23:44:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:44:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 23:44:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:44:07] [INFO ] [Nat]Absence check using state equation in 1801 ms returned sat
[2022-05-15 23:44:08] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 195 ms.
[2022-05-15 23:44:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2022-05-15 23:44:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 23:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:44:13] [INFO ] [Real]Absence check using state equation in 1738 ms returned sat
[2022-05-15 23:44:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:44:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 23:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:44:15] [INFO ] [Nat]Absence check using state equation in 1805 ms returned sat
[2022-05-15 23:44:16] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 194 ms.
[2022-05-15 23:44:18] [INFO ] Added : 35 causal constraints over 7 iterations in 2471 ms. Result :unknown
[2022-05-15 23:44:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 103 ms returned sat
[2022-05-15 23:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:44:21] [INFO ] [Real]Absence check using state equation in 1746 ms returned sat
[2022-05-15 23:44:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:44:22] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 104 ms returned sat
[2022-05-15 23:44:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:44:24] [INFO ] [Nat]Absence check using state equation in 2259 ms returned sat
[2022-05-15 23:44:24] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 191 ms.
[2022-05-15 23:44:26] [INFO ] Added : 30 causal constraints over 6 iterations in 1814 ms. Result :unknown
[2022-05-15 23:44:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 23:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:44:28] [INFO ] [Real]Absence check using state equation in 1786 ms returned sat
[2022-05-15 23:44:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:44:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 23:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:44:31] [INFO ] [Nat]Absence check using state equation in 2386 ms returned sat
[2022-05-15 23:44:32] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 195 ms.
[2022-05-15 23:44:34] [INFO ] Added : 30 causal constraints over 6 iterations in 1960 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-308-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 13 out of 2585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2929 edges and 2585 vertex of which 857 / 2585 are part of one of the 62 SCC in 23 ms
Free SCC test removed 795 places
Drop transitions removed 969 transitions
Reduce isomorphic transitions removed 969 transitions.
Graph (complete) has 2406 edges and 1790 vertex of which 1776 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.17 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 1185 transitions
Trivial Post-agglo rules discarded 1185 transitions
Performed 1185 trivial Post agglomeration. Transition count delta: 1185
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1196 place count 1776 transition count 923
Reduce places removed 1185 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 1 with 1324 rules applied. Total rules applied 2520 place count 591 transition count 784
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 73 rules applied. Total rules applied 2593 place count 528 transition count 774
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 8 rules applied. Total rules applied 2601 place count 525 transition count 769
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 7 rules applied. Total rules applied 2608 place count 522 transition count 765
Reduce places removed 2 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 5 with 10 rules applied. Total rules applied 2618 place count 520 transition count 757
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2627 place count 512 transition count 756
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2627 place count 512 transition count 734
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2671 place count 490 transition count 734
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2748 place count 413 transition count 657
Iterating global reduction 7 with 77 rules applied. Total rules applied 2825 place count 413 transition count 657
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2825 place count 413 transition count 648
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 2843 place count 404 transition count 648
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 2903 place count 344 transition count 588
Iterating global reduction 7 with 60 rules applied. Total rules applied 2963 place count 344 transition count 588
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 2997 place count 344 transition count 554
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 3022 place count 327 transition count 546
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 3026 place count 323 transition count 546
Discarding 19 places :
Symmetric choice reduction at 10 with 19 rule applications. Total rules 3045 place count 304 transition count 517
Iterating global reduction 10 with 19 rules applied. Total rules applied 3064 place count 304 transition count 517
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3072 place count 304 transition count 509
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 3080 place count 296 transition count 493
Iterating global reduction 11 with 8 rules applied. Total rules applied 3088 place count 296 transition count 493
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3091 place count 293 transition count 487
Iterating global reduction 11 with 3 rules applied. Total rules applied 3094 place count 293 transition count 487
Performed 151 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 11 with 302 rules applied. Total rules applied 3396 place count 142 transition count 257
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 3400 place count 142 transition count 253
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 3408 place count 138 transition count 249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3414 place count 138 transition count 243
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 3420 place count 135 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3426 place count 135 transition count 234
Performed 34 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 14 with 68 rules applied. Total rules applied 3494 place count 101 transition count 271
Drop transitions removed 11 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 14 with 37 rules applied. Total rules applied 3531 place count 101 transition count 234
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 3552 place count 80 transition count 200
Iterating global reduction 15 with 21 rules applied. Total rules applied 3573 place count 80 transition count 200
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 15 with 11 rules applied. Total rules applied 3584 place count 80 transition count 189
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3588 place count 76 transition count 181
Iterating global reduction 16 with 4 rules applied. Total rules applied 3592 place count 76 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 3596 place count 76 transition count 177
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 17 with 14 rules applied. Total rules applied 3610 place count 76 transition count 163
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3611 place count 75 transition count 160
Iterating global reduction 17 with 1 rules applied. Total rules applied 3612 place count 75 transition count 160
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3613 place count 74 transition count 159
Iterating global reduction 17 with 1 rules applied. Total rules applied 3614 place count 74 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 3615 place count 74 transition count 158
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3616 place count 74 transition count 157
Free-agglomeration rule applied 5 times.
Iterating global reduction 18 with 5 rules applied. Total rules applied 3621 place count 74 transition count 152
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 3627 place count 69 transition count 151
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3628 place count 69 transition count 150
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 3630 place count 69 transition count 150
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3631 place count 69 transition count 149
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3632 place count 68 transition count 148
Iterating global reduction 19 with 1 rules applied. Total rules applied 3633 place count 68 transition count 148
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3634 place count 68 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3635 place count 67 transition count 147
Applied a total of 3635 rules in 693 ms. Remains 67 /2585 variables (removed 2518) and now considering 147/3095 (removed 2948) transitions.
Finished structural reductions, in 1 iterations. Remains : 67/2585 places, 147/3095 transitions.
Normalized transition count is 138 out of 147 initially.
// Phase 1: matrix 138 rows 67 cols
[2022-05-15 23:44:34] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 14496 resets, run finished after 1560 ms. (steps per millisecond=641 ) properties (out of 13) seen :13
FORMULA CloudReconfiguration-PT-308-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-10 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-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 117106 ms.

BK_STOP 1652658276426

--------------------
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="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-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 r042-smll-165252095500269"
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 ;