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-165252095400229.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-303, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095400229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 7.0K Apr 29 14:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 14:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 14:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 14:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:19 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-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 1652643224787

Running Version 202205111006
[2022-05-15 19:33: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]
[2022-05-15 19:33:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 19:33:48] [INFO ] Load time of PNML (sax parser for PT used): 602 ms
[2022-05-15 19:33:48] [INFO ] Transformed 2584 places.
[2022-05-15 19:33:48] [INFO ] Transformed 3094 transitions.
[2022-05-15 19:33:48] [INFO ] Found NUPN structural information;
[2022-05-15 19:33:48] [INFO ] Parsed PT model containing 2584 places and 3094 transitions in 870 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
// Phase 1: matrix 3094 rows 2584 cols
[2022-05-15 19:33:48] [INFO ] Computed 4 place invariants in 73 ms
Incomplete random walk after 10000 steps, including 103 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :3
FORMULA CloudReconfiguration-PT-303-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 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 35 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 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 32 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 14 ms. (steps per millisecond=714 ) 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 :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
// Phase 1: matrix 3094 rows 2584 cols
[2022-05-15 19:33:48] [INFO ] Computed 4 place invariants in 25 ms
[2022-05-15 19:33:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 107 ms returned sat
[2022-05-15 19:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:33:52] [INFO ] [Real]Absence check using state equation in 1965 ms returned sat
[2022-05-15 19:33:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:33:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 19:33:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:33:55] [INFO ] [Nat]Absence check using state equation in 1787 ms returned sat
[2022-05-15 19:33:55] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 282 ms.
[2022-05-15 19:33:57] [INFO ] Added : 35 causal constraints over 7 iterations in 2312 ms. Result :unknown
[2022-05-15 19:33:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 63 ms returned sat
[2022-05-15 19:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:00] [INFO ] [Real]Absence check using state equation in 1797 ms returned sat
[2022-05-15 19:34:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 110 ms returned sat
[2022-05-15 19:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:03] [INFO ] [Nat]Absence check using state equation in 2206 ms returned sat
[2022-05-15 19:34:03] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 342 ms.
[2022-05-15 19:34:05] [INFO ] Added : 25 causal constraints over 5 iterations in 2060 ms. Result :unknown
[2022-05-15 19:34:06] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 19:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:08] [INFO ] [Real]Absence check using state equation in 1915 ms returned sat
[2022-05-15 19:34:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2022-05-15 19:34:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:11] [INFO ] [Nat]Absence check using state equation in 2123 ms returned sat
[2022-05-15 19:34:11] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 204 ms.
[2022-05-15 19:34:13] [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 2
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 19:34:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 19:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:16] [INFO ] [Real]Absence check using state equation in 2175 ms returned sat
[2022-05-15 19:34:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 19:34:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:19] [INFO ] [Nat]Absence check using state equation in 2305 ms returned sat
[2022-05-15 19:34:20] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 214 ms.
[2022-05-15 19:34:21] [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 19:34:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 65 ms returned sat
[2022-05-15 19:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:24] [INFO ] [Real]Absence check using state equation in 2086 ms returned sat
[2022-05-15 19:34:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:25] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-15 19:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:27] [INFO ] [Nat]Absence check using state equation in 2067 ms returned sat
[2022-05-15 19:34:27] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 200 ms.
[2022-05-15 19:34:29] [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 4
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 19:34:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 99 ms returned sat
[2022-05-15 19:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:32] [INFO ] [Real]Absence check using state equation in 1937 ms returned sat
[2022-05-15 19:34:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 105 ms returned sat
[2022-05-15 19:34:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:35] [INFO ] [Nat]Absence check using state equation in 2190 ms returned sat
[2022-05-15 19:34:36] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 311 ms.
[2022-05-15 19:34:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 19:34:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2022-05-15 19:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:40] [INFO ] [Real]Absence check using state equation in 1890 ms returned sat
[2022-05-15 19:34:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:41] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-15 19:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:43] [INFO ] [Nat]Absence check using state equation in 2002 ms returned sat
[2022-05-15 19:34:43] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 213 ms.
[2022-05-15 19:34:46] [INFO ] Added : 35 causal constraints over 7 iterations in 2379 ms. Result :unknown
[2022-05-15 19:34:46] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 19:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:48] [INFO ] [Real]Absence check using state equation in 1903 ms returned sat
[2022-05-15 19:34:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2022-05-15 19:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:51] [INFO ] [Nat]Absence check using state equation in 1887 ms returned sat
[2022-05-15 19:34:51] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 282 ms.
[2022-05-15 19:34:54] [INFO ] Added : 35 causal constraints over 7 iterations in 2319 ms. Result :unknown
[2022-05-15 19:34:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 19:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:56] [INFO ] [Real]Absence check using state equation in 1930 ms returned sat
[2022-05-15 19:34:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2022-05-15 19:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:59] [INFO ] [Nat]Absence check using state equation in 2036 ms returned sat
[2022-05-15 19:35:00] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 258 ms.
[2022-05-15 19:35: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: 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 19:35:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 19:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:04] [INFO ] [Real]Absence check using state equation in 1867 ms returned sat
[2022-05-15 19:35:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2022-05-15 19:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:07] [INFO ] [Nat]Absence check using state equation in 2103 ms returned sat
[2022-05-15 19:35:08] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 311 ms.
[2022-05-15 19:35:09] [INFO ] Added : 35 causal constraints over 7 iterations in 2197 ms. Result :unknown
[2022-05-15 19:35:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 76 ms returned sat
[2022-05-15 19:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:12] [INFO ] [Real]Absence check using state equation in 2124 ms returned sat
[2022-05-15 19:35:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2022-05-15 19:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:16] [INFO ] [Nat]Absence check using state equation in 2199 ms returned sat
[2022-05-15 19:35:16] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 354 ms.
[2022-05-15 19:35:18] [INFO ] Added : 30 causal constraints over 6 iterations in 1850 ms. Result :unknown
[2022-05-15 19:35:18] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 19:35:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:20] [INFO ] [Real]Absence check using state equation in 1845 ms returned sat
[2022-05-15 19:35:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2022-05-15 19:35:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:23] [INFO ] [Nat]Absence check using state equation in 1913 ms returned sat
[2022-05-15 19:35:23] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 215 ms.
[2022-05-15 19:35:26] [INFO ] Added : 40 causal constraints over 8 iterations in 2272 ms. Result :unknown
[2022-05-15 19:35:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 102 ms returned sat
[2022-05-15 19:35:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:29] [INFO ] [Real]Absence check using state equation in 2121 ms returned sat
[2022-05-15 19:35:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 19:35:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:31] [INFO ] [Nat]Absence check using state equation in 1928 ms returned sat
[2022-05-15 19:35:32] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 332 ms.
[2022-05-15 19:35:34] [INFO ] Added : 35 causal constraints over 7 iterations in 2175 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 2584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Graph (trivial) has 2929 edges and 2584 vertex of which 864 / 2584 are part of one of the 63 SCC in 25 ms
Free SCC test removed 801 places
Drop transitions removed 979 transitions
Reduce isomorphic transitions removed 979 transitions.
Graph (complete) has 2393 edges and 1783 vertex of which 1769 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 1182 transitions
Trivial Post-agglo rules discarded 1182 transitions
Performed 1182 trivial Post agglomeration. Transition count delta: 1182
Iterating post reduction 0 with 1191 rules applied. Total rules applied 1193 place count 1769 transition count 915
Reduce places removed 1182 places and 0 transitions.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 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 1319 rules applied. Total rules applied 2512 place count 587 transition count 778
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 71 rules applied. Total rules applied 2583 place count 524 transition count 770
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 12 rules applied. Total rules applied 2595 place count 521 transition count 761
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 10 rules applied. Total rules applied 2605 place count 515 transition count 757
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 5 with 11 rules applied. Total rules applied 2616 place count 514 transition count 747
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2626 place count 504 transition count 747
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 2626 place count 504 transition count 726
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 2668 place count 483 transition count 726
Discarding 76 places :
Symmetric choice reduction at 7 with 76 rule applications. Total rules 2744 place count 407 transition count 650
Iterating global reduction 7 with 76 rules applied. Total rules applied 2820 place count 407 transition count 650
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 2820 place count 407 transition count 642
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 2836 place count 399 transition count 642
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 2896 place count 339 transition count 582
Iterating global reduction 7 with 60 rules applied. Total rules applied 2956 place count 339 transition count 582
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 7 with 31 rules applied. Total rules applied 2987 place count 339 transition count 551
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 25 rules applied. Total rules applied 3012 place count 324 transition count 541
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 6 rules applied. Total rules applied 3018 place count 319 transition count 540
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3020 place count 318 transition count 539
Discarding 21 places :
Symmetric choice reduction at 11 with 21 rule applications. Total rules 3041 place count 297 transition count 506
Iterating global reduction 11 with 21 rules applied. Total rules applied 3062 place count 297 transition count 506
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 3071 place count 297 transition count 497
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 3080 place count 288 transition count 479
Iterating global reduction 12 with 9 rules applied. Total rules applied 3089 place count 288 transition count 479
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 3092 place count 285 transition count 473
Iterating global reduction 12 with 3 rules applied. Total rules applied 3095 place count 285 transition count 473
Performed 146 Post agglomeration using F-continuation condition with reduction of 75 identical transitions.
Deduced a syphon composed of 146 places in 1 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 12 with 292 rules applied. Total rules applied 3387 place count 139 transition count 252
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 3389 place count 139 transition count 250
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 3395 place count 136 transition count 247
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3401 place count 136 transition count 241
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 14 with 6 rules applied. Total rules applied 3407 place count 133 transition count 238
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3413 place count 133 transition count 232
Performed 34 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 15 with 68 rules applied. Total rules applied 3481 place count 99 transition count 262
Drop transitions removed 10 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 15 with 33 rules applied. Total rules applied 3514 place count 99 transition count 229
Discarding 20 places :
Symmetric choice reduction at 16 with 20 rule applications. Total rules 3534 place count 79 transition count 196
Iterating global reduction 16 with 20 rules applied. Total rules applied 3554 place count 79 transition count 196
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 16 with 11 rules applied. Total rules applied 3565 place count 79 transition count 185
Discarding 3 places :
Symmetric choice reduction at 17 with 3 rule applications. Total rules 3568 place count 76 transition count 179
Iterating global reduction 17 with 3 rules applied. Total rules applied 3571 place count 76 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 3574 place count 76 transition count 176
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 18 with 20 rules applied. Total rules applied 3594 place count 76 transition count 156
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 3596 place count 74 transition count 152
Iterating global reduction 18 with 2 rules applied. Total rules applied 3598 place count 74 transition count 152
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3599 place count 73 transition count 151
Iterating global reduction 18 with 1 rules applied. Total rules applied 3600 place count 73 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3601 place count 73 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 3602 place count 73 transition count 149
Free-agglomeration rule applied 5 times.
Iterating global reduction 19 with 5 rules applied. Total rules applied 3607 place count 73 transition count 144
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 19 with 5 rules applied. Total rules applied 3612 place count 68 transition count 144
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3613 place count 68 transition count 143
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3614 place count 68 transition count 143
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 3617 place count 68 transition count 143
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 3618 place count 68 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 3619 place count 67 transition count 141
Applied a total of 3619 rules in 587 ms. Remains 67 /2584 variables (removed 2517) and now considering 141/3094 (removed 2953) transitions.
Finished structural reductions, in 1 iterations. Remains : 67/2584 places, 141/3094 transitions.
Normalized transition count is 133 out of 141 initially.
// Phase 1: matrix 133 rows 67 cols
[2022-05-15 19:35:34] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 24307 resets, run finished after 1470 ms. (steps per millisecond=680 ) properties (out of 13) seen :13
FORMULA CloudReconfiguration-PT-303-UpperBounds-15 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-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-06 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-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-303-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 109109 ms.

BK_STOP 1652643336450

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