fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r107-tall-167814483800109
Last Updated
May 14, 2023

About the Execution of Smart+red for CloudReconfiguration-PT-314

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
639.384 91445.00 108525.00 356.70 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/mcc2023-input.r107-tall-167814483800109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is CloudReconfiguration-PT-314, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814483800109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 11:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678329457995

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-314
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 02:37:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 02:37:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 02:37:39] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2023-03-09 02:37:39] [INFO ] Transformed 2585 places.
[2023-03-09 02:37:39] [INFO ] Transformed 3095 transitions.
[2023-03-09 02:37:39] [INFO ] Found NUPN structural information;
[2023-03-09 02:37:39] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-09 02:37:39] [INFO ] Computed 4 place invariants in 58 ms
Incomplete random walk after 10000 steps, including 109 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :2
FORMULA CloudReconfiguration-PT-314-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 35 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 33 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-314-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 38 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 30 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 36 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 36 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 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 37 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
[2023-03-09 02:37:40] [INFO ] Invariant cache hit.
[2023-03-09 02:37:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 56 ms returned sat
[2023-03-09 02:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:37:41] [INFO ] [Real]Absence check using state equation in 1149 ms returned sat
[2023-03-09 02:37:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:37:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-09 02:37:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:37:43] [INFO ] [Nat]Absence check using state equation in 1145 ms returned sat
[2023-03-09 02:37:43] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 156 ms.
[2023-03-09 02:37:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 02:37:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 02:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:37:48] [INFO ] [Real]Absence check using state equation in 1183 ms returned sat
[2023-03-09 02:37:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:37:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 02:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:37:50] [INFO ] [Nat]Absence check using state equation in 1145 ms returned sat
[2023-03-09 02:37:50] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-09 02:37:53] [INFO ] Added : 140 causal constraints over 28 iterations in 3442 ms. Result :unknown
[2023-03-09 02:37:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 02:37:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:37:55] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2023-03-09 02:37:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:37:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 02:37:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:37:56] [INFO ] [Nat]Absence check using state equation in 1215 ms returned sat
[2023-03-09 02:37:57] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 129 ms.
[2023-03-09 02:38:00] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 02:38:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 02:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:02] [INFO ] [Real]Absence check using state equation in 1322 ms returned sat
[2023-03-09 02:38:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 02:38:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:04] [INFO ] [Nat]Absence check using state equation in 1660 ms returned sat
[2023-03-09 02:38:04] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 135 ms.
[2023-03-09 02:38:07] [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 3
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 02:38:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 02:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:08] [INFO ] [Real]Absence check using state equation in 1173 ms returned sat
[2023-03-09 02:38:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 02:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:10] [INFO ] [Nat]Absence check using state equation in 1175 ms returned sat
[2023-03-09 02:38:10] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 135 ms.
[2023-03-09 02:38:13] [INFO ] Added : 135 causal constraints over 27 iterations in 3420 ms. Result :unknown
[2023-03-09 02:38:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 02:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:15] [INFO ] [Real]Absence check using state equation in 1077 ms returned sat
[2023-03-09 02:38:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 02:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:16] [INFO ] [Nat]Absence check using state equation in 1079 ms returned sat
[2023-03-09 02:38:17] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 139 ms.
[2023-03-09 02:38:20] [INFO ] Added : 140 causal constraints over 28 iterations in 3559 ms. Result :unknown
[2023-03-09 02:38:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 02:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:21] [INFO ] [Real]Absence check using state equation in 1166 ms returned sat
[2023-03-09 02:38:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:22] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 02:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:23] [INFO ] [Nat]Absence check using state equation in 1154 ms returned sat
[2023-03-09 02:38:23] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 139 ms.
[2023-03-09 02:38:27] [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 6
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 02:38:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 02:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:28] [INFO ] [Real]Absence check using state equation in 1226 ms returned sat
[2023-03-09 02:38:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 02:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:30] [INFO ] [Nat]Absence check using state equation in 1234 ms returned sat
[2023-03-09 02:38:30] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 128 ms.
[2023-03-09 02:38:33] [INFO ] Added : 135 causal constraints over 27 iterations in 3370 ms. Result :unknown
[2023-03-09 02:38:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 02:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:35] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2023-03-09 02:38:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:35] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 02:38:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:36] [INFO ] [Nat]Absence check using state equation in 1135 ms returned sat
[2023-03-09 02:38:37] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 128 ms.
[2023-03-09 02:38:40] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 02:38:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-09 02:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:42] [INFO ] [Real]Absence check using state equation in 1212 ms returned sat
[2023-03-09 02:38:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 02:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:43] [INFO ] [Nat]Absence check using state equation in 1194 ms returned sat
[2023-03-09 02:38:43] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 133 ms.
[2023-03-09 02:38:47] [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 9
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 02:38:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 02:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:48] [INFO ] [Real]Absence check using state equation in 1160 ms returned sat
[2023-03-09 02:38:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 02:38:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:50] [INFO ] [Nat]Absence check using state equation in 1171 ms returned sat
[2023-03-09 02:38:50] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 128 ms.
[2023-03-09 02:38:53] [INFO ] Added : 140 causal constraints over 28 iterations in 3415 ms. Result :unknown
[2023-03-09 02:38:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 02:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:55] [INFO ] [Real]Absence check using state equation in 1206 ms returned sat
[2023-03-09 02:38:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:38:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 02:38:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:38:57] [INFO ] [Nat]Absence check using state equation in 1206 ms returned sat
[2023-03-09 02:38:57] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-09 02:39:00] [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 11
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 02:39:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-09 02:39:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 02:39:02] [INFO ] [Real]Absence check using state equation in 1154 ms returned sat
[2023-03-09 02:39:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 02:39:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 02:39:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 02:39:03] [INFO ] [Nat]Absence check using state equation in 1158 ms returned sat
[2023-03-09 02:39:03] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 127 ms.
[2023-03-09 02:39:07] [INFO ] Added : 140 causal constraints over 28 iterations in 3462 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-314-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 12 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2928 edges and 2585 vertex of which 844 / 2585 are part of one of the 62 SCC in 11 ms
Free SCC test removed 782 places
Drop transitions removed 957 transitions
Reduce isomorphic transitions removed 957 transitions.
Graph (complete) has 2418 edges and 1803 vertex of which 1789 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1203 rules applied. Total rules applied 1205 place count 1789 transition count 926
Reduce places removed 1194 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 1 with 1334 rules applied. Total rules applied 2539 place count 595 transition count 786
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 71 rules applied. Total rules applied 2610 place count 531 transition count 779
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 8 rules applied. Total rules applied 2618 place count 529 transition count 773
Reduce places removed 4 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 8 rules applied. Total rules applied 2626 place count 525 transition count 769
Reduce places removed 2 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 5 with 14 rules applied. Total rules applied 2640 place count 523 transition count 757
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2652 place count 511 transition count 757
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 2652 place count 511 transition count 736
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 2694 place count 490 transition count 736
Discarding 80 places :
Symmetric choice reduction at 7 with 80 rule applications. Total rules 2774 place count 410 transition count 656
Iterating global reduction 7 with 80 rules applied. Total rules applied 2854 place count 410 transition count 656
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2854 place count 410 transition count 647
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 2872 place count 401 transition count 647
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 2932 place count 341 transition count 587
Iterating global reduction 7 with 60 rules applied. Total rules applied 2992 place count 341 transition count 587
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 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 35 rules applied. Total rules applied 3027 place count 341 transition count 552
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 27 rules applied. Total rules applied 3054 place count 324 transition count 542
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 3060 place count 319 transition count 541
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3061 place count 318 transition count 541
Discarding 21 places :
Symmetric choice reduction at 11 with 21 rule applications. Total rules 3082 place count 297 transition count 508
Iterating global reduction 11 with 21 rules applied. Total rules applied 3103 place count 297 transition count 508
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 3112 place count 297 transition count 499
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 3121 place count 288 transition count 481
Iterating global reduction 12 with 9 rules applied. Total rules applied 3130 place count 288 transition count 481
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 3133 place count 285 transition count 475
Iterating global reduction 12 with 3 rules applied. Total rules applied 3136 place count 285 transition count 475
Performed 148 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 12 with 296 rules applied. Total rules applied 3432 place count 137 transition count 247
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3435 place count 137 transition count 244
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3441 place count 134 transition count 241
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3447 place count 134 transition count 235
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 3453 place count 131 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3459 place count 131 transition count 226
Performed 34 Post agglomeration using F-continuation condition with reduction of 15 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 3527 place count 97 transition count 263
Drop transitions removed 20 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 15 with 47 rules applied. Total rules applied 3574 place count 97 transition count 216
Discarding 19 places :
Symmetric choice reduction at 16 with 19 rule applications. Total rules 3593 place count 78 transition count 191
Iterating global reduction 16 with 19 rules applied. Total rules applied 3612 place count 78 transition count 191
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 3622 place count 78 transition count 181
Discarding 3 places :
Symmetric choice reduction at 17 with 3 rule applications. Total rules 3625 place count 75 transition count 175
Iterating global reduction 17 with 3 rules applied. Total rules applied 3628 place count 75 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 3630 place count 75 transition count 173
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 18 with 26 rules applied. Total rules applied 3656 place count 75 transition count 147
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 3658 place count 73 transition count 141
Iterating global reduction 18 with 2 rules applied. Total rules applied 3660 place count 73 transition count 141
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 3662 place count 71 transition count 139
Iterating global reduction 18 with 2 rules applied. Total rules applied 3664 place count 71 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 3666 place count 71 transition count 137
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 3668 place count 71 transition count 135
Free-agglomeration rule applied 6 times.
Iterating global reduction 19 with 6 rules applied. Total rules applied 3674 place count 71 transition count 129
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 3681 place count 65 transition count 128
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3682 place count 65 transition count 127
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3683 place count 65 transition count 127
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 3685 place count 65 transition count 127
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 3686 place count 65 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 3687 place count 64 transition count 125
Applied a total of 3687 rules in 273 ms. Remains 64 /2585 variables (removed 2521) and now considering 125/3095 (removed 2970) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 64/2585 places, 125/3095 transitions.
Normalized transition count is 119 out of 125 initially.
// Phase 1: matrix 119 rows 64 cols
[2023-03-09 02:39:07] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 18286 resets, run finished after 879 ms. (steps per millisecond=1137 ) properties (out of 12) seen :12
FORMULA CloudReconfiguration-PT-314-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 89190 ms.
ITS solved all properties within timeout

BK_STOP 1678329549440

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-314"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is CloudReconfiguration-PT-314, 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 r107-tall-167814483800109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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