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.r106-tall-167814482300133.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 marciexred
Input is CloudReconfiguration-PT-317, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482300133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 3.6K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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 661K 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-317-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-317-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678335011035

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-317
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 04:10:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 04:10:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 04:10:12] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-09 04:10:12] [INFO ] Transformed 2587 places.
[2023-03-09 04:10:12] [INFO ] Transformed 3099 transitions.
[2023-03-09 04:10:12] [INFO ] Found NUPN structural information;
[2023-03-09 04:10:12] [INFO ] Parsed PT model containing 2587 places and 3099 transitions and 6479 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3099 rows 2587 cols
[2023-03-09 04:10:12] [INFO ] Computed 4 place invariants in 60 ms
Incomplete random walk after 10000 steps, including 111 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) 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 16) seen :1
FORMULA CloudReconfiguration-PT-317-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) 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 15) 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 15) seen :0
[2023-03-09 04:10:13] [INFO ] Invariant cache hit.
[2023-03-09 04:10:13] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-09 04:10:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:14] [INFO ] [Real]Absence check using state equation in 1103 ms returned sat
[2023-03-09 04:10:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:10:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 04:10:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:16] [INFO ] [Nat]Absence check using state equation in 1114 ms returned sat
[2023-03-09 04:10:16] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 156 ms.
[2023-03-09 04:10:19] [INFO ] Added : 125 causal constraints over 25 iterations in 3367 ms. Result :unknown
[2023-03-09 04:10:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 04:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:21] [INFO ] [Real]Absence check using state equation in 1227 ms returned sat
[2023-03-09 04:10:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:10:22] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-09 04:10:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:23] [INFO ] [Nat]Absence check using state equation in 1267 ms returned sat
[2023-03-09 04:10:23] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 162 ms.
[2023-03-09 04:10:26] [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 1
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 04:10:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:10:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:28] [INFO ] [Real]Absence check using state equation in 1239 ms returned sat
[2023-03-09 04:10:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:10:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:10:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:30] [INFO ] [Nat]Absence check using state equation in 1533 ms returned sat
[2023-03-09 04:10:30] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-09 04:10:33] [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 04:10:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 04:10:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:34] [INFO ] [Real]Absence check using state equation in 1071 ms returned sat
[2023-03-09 04:10:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:10:35] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 04:10:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:36] [INFO ] [Nat]Absence check using state equation in 1114 ms returned sat
[2023-03-09 04:10:36] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 141 ms.
[2023-03-09 04:10: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 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: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 04:10:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 04:10:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:41] [INFO ] [Real]Absence check using state equation in 1121 ms returned sat
[2023-03-09 04:10:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:10:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 04:10:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:43] [INFO ] [Nat]Absence check using state equation in 1133 ms returned sat
[2023-03-09 04:10:43] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 148 ms.
[2023-03-09 04:10:46] [INFO ] Added : 129 causal constraints over 26 iterations in 3407 ms. Result :unknown
[2023-03-09 04:10:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:48] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2023-03-09 04:10:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:10:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:10:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:50] [INFO ] [Nat]Absence check using state equation in 1227 ms returned sat
[2023-03-09 04:10:50] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 148 ms.
[2023-03-09 04:10:53] [INFO ] Added : 130 causal constraints over 26 iterations in 3325 ms. Result :unknown
[2023-03-09 04:10:53] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 04:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:55] [INFO ] [Real]Absence check using state equation in 1219 ms returned sat
[2023-03-09 04:10:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:10:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 04:10:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:10:56] [INFO ] [Nat]Absence check using state equation in 1431 ms returned sat
[2023-03-09 04:10:57] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 121 ms.
[2023-03-09 04:11:00] [INFO ] Added : 125 causal constraints over 25 iterations in 3092 ms. Result :unknown
[2023-03-09 04:11:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 04:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:01] [INFO ] [Real]Absence check using state equation in 1244 ms returned sat
[2023-03-09 04:11:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:11:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 04:11:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:04] [INFO ] [Nat]Absence check using state equation in 1704 ms returned sat
[2023-03-09 04:11:04] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 144 ms.
[2023-03-09 04:11:06] [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 7
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 04:11:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 04:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:08] [INFO ] [Real]Absence check using state equation in 1161 ms returned sat
[2023-03-09 04:11:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:11:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-09 04:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:10] [INFO ] [Nat]Absence check using state equation in 1198 ms returned sat
[2023-03-09 04:11:10] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 147 ms.
[2023-03-09 04:11:13] [INFO ] Added : 125 causal constraints over 25 iterations in 3375 ms. Result :unknown
[2023-03-09 04:11:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:11:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:15] [INFO ] [Real]Absence check using state equation in 1413 ms returned sat
[2023-03-09 04:11:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:11:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 53 ms returned sat
[2023-03-09 04:11:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:17] [INFO ] [Nat]Absence check using state equation in 1341 ms returned sat
[2023-03-09 04:11:17] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 154 ms.
[2023-03-09 04:11:20] [INFO ] Added : 125 causal constraints over 25 iterations in 3174 ms. Result :unknown
[2023-03-09 04:11:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:11:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:22] [INFO ] [Real]Absence check using state equation in 1128 ms returned sat
[2023-03-09 04:11:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:11:22] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 04:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:23] [INFO ] [Nat]Absence check using state equation in 1080 ms returned sat
[2023-03-09 04:11:23] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 133 ms.
[2023-03-09 04:11:27] [INFO ] Added : 135 causal constraints over 27 iterations in 3505 ms. Result :unknown
[2023-03-09 04:11:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-09 04:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:29] [INFO ] [Real]Absence check using state equation in 1335 ms returned sat
[2023-03-09 04:11:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:11:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-09 04:11:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:30] [INFO ] [Nat]Absence check using state equation in 1306 ms returned sat
[2023-03-09 04:11:31] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-09 04:11:34] [INFO ] Added : 120 causal constraints over 24 iterations in 3287 ms. Result :unknown
[2023-03-09 04:11:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 04:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:35] [INFO ] [Real]Absence check using state equation in 1136 ms returned sat
[2023-03-09 04:11:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:11:36] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 04:11:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:37] [INFO ] [Nat]Absence check using state equation in 1187 ms returned sat
[2023-03-09 04:11:37] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 150 ms.
[2023-03-09 04:11:40] [INFO ] Added : 130 causal constraints over 26 iterations in 3386 ms. Result :unknown
[2023-03-09 04:11:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:11:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:42] [INFO ] [Real]Absence check using state equation in 1216 ms returned sat
[2023-03-09 04:11:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:11:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 04:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:44] [INFO ] [Nat]Absence check using state equation in 1653 ms returned sat
[2023-03-09 04:11:44] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-09 04:11:47] [INFO ] Added : 110 causal constraints over 22 iterations in 2878 ms. Result :unknown
[2023-03-09 04:11:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 04:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:49] [INFO ] [Real]Absence check using state equation in 1106 ms returned sat
[2023-03-09 04:11:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:11:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 04:11:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:50] [INFO ] [Nat]Absence check using state equation in 1141 ms returned sat
[2023-03-09 04:11:51] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 162 ms.
[2023-03-09 04:11:54] [INFO ] Added : 122 causal constraints over 25 iterations in 3411 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 15 out of 2587 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Graph (trivial) has 2924 edges and 2587 vertex of which 825 / 2587 are part of one of the 61 SCC in 14 ms
Free SCC test removed 764 places
Drop transitions removed 931 transitions
Reduce isomorphic transitions removed 931 transitions.
Graph (complete) has 2454 edges and 1823 vertex of which 1809 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 1204 transitions
Trivial Post-agglo rules discarded 1204 transitions
Performed 1204 trivial Post agglomeration. Transition count delta: 1204
Iterating post reduction 0 with 1213 rules applied. Total rules applied 1215 place count 1809 transition count 946
Reduce places removed 1204 places and 0 transitions.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 1 with 1341 rules applied. Total rules applied 2556 place count 605 transition count 809
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 64 rules applied. Total rules applied 2620 place count 546 transition count 804
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 2623 place count 545 transition count 802
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 2627 place count 544 transition count 799
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 2641 place count 542 transition count 787
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2654 place count 530 transition count 786
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 25 Pre rules applied. Total rules applied 2654 place count 530 transition count 761
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 2704 place count 505 transition count 761
Discarding 79 places :
Symmetric choice reduction at 7 with 79 rule applications. Total rules 2783 place count 426 transition count 682
Iterating global reduction 7 with 79 rules applied. Total rules applied 2862 place count 426 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2863 place count 426 transition count 681
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 2863 place count 426 transition count 672
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 2881 place count 417 transition count 672
Discarding 61 places :
Symmetric choice reduction at 8 with 61 rule applications. Total rules 2942 place count 356 transition count 611
Iterating global reduction 8 with 61 rules applied. Total rules applied 3003 place count 356 transition count 611
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 34 rules applied. Total rules applied 3037 place count 356 transition count 577
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 9 with 29 rules applied. Total rules applied 3066 place count 339 transition count 565
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3072 place count 333 transition count 565
Discarding 20 places :
Symmetric choice reduction at 11 with 20 rule applications. Total rules 3092 place count 313 transition count 534
Iterating global reduction 11 with 20 rules applied. Total rules applied 3112 place count 313 transition count 534
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 3121 place count 313 transition count 525
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 3128 place count 306 transition count 511
Iterating global reduction 12 with 7 rules applied. Total rules applied 3135 place count 306 transition count 511
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 3138 place count 303 transition count 505
Iterating global reduction 12 with 3 rules applied. Total rules applied 3141 place count 303 transition count 505
Performed 152 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 152 places in 0 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 12 with 304 rules applied. Total rules applied 3445 place count 151 transition count 273
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3448 place count 151 transition count 270
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3454 place count 148 transition count 267
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3460 place count 148 transition count 261
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 3464 place count 146 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 3468 place count 146 transition count 255
Performed 38 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 15 with 76 rules applied. Total rules applied 3544 place count 108 transition count 296
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 15 with 29 rules applied. Total rules applied 3573 place count 108 transition count 267
Discarding 21 places :
Symmetric choice reduction at 16 with 21 rule applications. Total rules 3594 place count 87 transition count 222
Iterating global reduction 16 with 21 rules applied. Total rules applied 3615 place count 87 transition count 222
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 16 with 11 rules applied. Total rules applied 3626 place count 87 transition count 211
Discarding 3 places :
Symmetric choice reduction at 17 with 3 rule applications. Total rules 3629 place count 84 transition count 205
Iterating global reduction 17 with 3 rules applied. Total rules applied 3632 place count 84 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 3635 place count 84 transition count 202
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 18 with 12 rules applied. Total rules applied 3647 place count 84 transition count 190
Free-agglomeration rule applied 5 times.
Iterating global reduction 18 with 5 rules applied. Total rules applied 3652 place count 84 transition count 185
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 3658 place count 79 transition count 184
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 19 with 4 rules applied. Total rules applied 3662 place count 79 transition count 184
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3663 place count 79 transition count 183
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3664 place count 78 transition count 182
Iterating global reduction 19 with 1 rules applied. Total rules applied 3665 place count 78 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3666 place count 77 transition count 181
Applied a total of 3666 rules in 267 ms. Remains 77 /2587 variables (removed 2510) and now considering 181/3099 (removed 2918) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 77/2587 places, 181/3099 transitions.
Normalized transition count is 168 out of 181 initially.
// Phase 1: matrix 168 rows 77 cols
[2023-03-09 04:11:54] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 9662 resets, run finished after 1230 ms. (steps per millisecond=813 ) properties (out of 15) seen :14
FORMULA CloudReconfiguration-PT-317-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-317-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2954 resets, run finished after 353 ms. (steps per millisecond=2832 ) properties (out of 1) seen :0
[2023-03-09 04:11:56] [INFO ] Flow matrix only has 168 transitions (discarded 13 similar events)
// Phase 1: matrix 168 rows 77 cols
[2023-03-09 04:11:56] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-09 04:11:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 04:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:56] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-09 04:11:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:11:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 04:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:11:56] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-09 04:11:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 04:11:56] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2023-03-09 04:11:56] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 5 ms to minimize.
[2023-03-09 04:11:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2023-03-09 04:11:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 96 ms
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA CloudReconfiguration-PT-317-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 104156 ms.
ITS solved all properties within timeout

BK_STOP 1678335117472

--------------------
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-317"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is CloudReconfiguration-PT-317, 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 r106-tall-167814482300133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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