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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
582.443 86498.00 101140.00 1585.20 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.r101-tall-167814474900093.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 itstools
Input is CloudReconfiguration-PT-312, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814474900093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.8K 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.4K 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 16K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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-312-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-312-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678228164646

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-312
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-07 22:29:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-07 22:29:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 22:29:26] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-07 22:29:26] [INFO ] Transformed 2585 places.
[2023-03-07 22:29:26] [INFO ] Transformed 3095 transitions.
[2023-03-07 22:29:26] [INFO ] Found NUPN structural information;
[2023-03-07 22:29:26] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-07 22:29:26] [INFO ] Computed 4 place invariants in 55 ms
Incomplete random walk after 10000 steps, including 71 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :3
FORMULA CloudReconfiguration-PT-312-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 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 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 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 19 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 21 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 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 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 20 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 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :1
FORMULA CloudReconfiguration-PT-312-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-07 22:29:27] [INFO ] Invariant cache hit.
[2023-03-07 22:29:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:29:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:29:30] [INFO ] [Real]Absence check using state equation in 1055 ms returned sat
[2023-03-07 22:29:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:29:31] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:29:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:29:32] [INFO ] [Nat]Absence check using state equation in 1123 ms returned sat
[2023-03-07 22:29:32] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 149 ms.
[2023-03-07 22:29:35] [INFO ] Added : 124 causal constraints over 25 iterations in 3373 ms. Result :unknown
[2023-03-07 22:29:36] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:29:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:29:37] [INFO ] [Real]Absence check using state equation in 1120 ms returned sat
[2023-03-07 22:29:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:29:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:29:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:29:38] [INFO ] [Nat]Absence check using state equation in 1146 ms returned sat
[2023-03-07 22:29:39] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 148 ms.
[2023-03-07 22:29:42] [INFO ] Added : 135 causal constraints over 27 iterations in 3400 ms. Result :unknown
[2023-03-07 22:29:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:29:43] [INFO ] [Real]Absence check using state equation in 1105 ms returned sat
[2023-03-07 22:29:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:29:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:29:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:29:45] [INFO ] [Nat]Absence check using state equation in 1087 ms returned sat
[2023-03-07 22:29:45] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 130 ms.
[2023-03-07 22:29:48] [INFO ] Added : 136 causal constraints over 28 iterations in 3492 ms. Result :unknown
[2023-03-07 22:29:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:29:50] [INFO ] [Real]Absence check using state equation in 1122 ms returned sat
[2023-03-07 22:29:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:29:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:29:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:29:52] [INFO ] [Nat]Absence check using state equation in 1204 ms returned sat
[2023-03-07 22:29:52] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 151 ms.
[2023-03-07 22:29:55] [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-07 22:29:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:29:57] [INFO ] [Real]Absence check using state equation in 1150 ms returned sat
[2023-03-07 22:29:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:29:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:29:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:29:58] [INFO ] [Nat]Absence check using state equation in 1188 ms returned sat
[2023-03-07 22:29:59] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 129 ms.
[2023-03-07 22:30:02] [INFO ] Added : 135 causal constraints over 27 iterations in 3403 ms. Result :unknown
[2023-03-07 22:30:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 22:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:03] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2023-03-07 22:30:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:30:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:30:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:05] [INFO ] [Nat]Absence check using state equation in 1070 ms returned sat
[2023-03-07 22:30:05] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 128 ms.
[2023-03-07 22:30:08] [INFO ] Added : 140 causal constraints over 28 iterations in 3532 ms. Result :unknown
[2023-03-07 22:30:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:30:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:10] [INFO ] [Real]Absence check using state equation in 1161 ms returned sat
[2023-03-07 22:30:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:30:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:12] [INFO ] [Nat]Absence check using state equation in 1163 ms returned sat
[2023-03-07 22:30:12] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 124 ms.
[2023-03-07 22:30:15] [INFO ] Added : 128 causal constraints over 26 iterations in 3433 ms. Result :unknown
[2023-03-07 22:30:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:17] [INFO ] [Real]Absence check using state equation in 1162 ms returned sat
[2023-03-07 22:30:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:30:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 22:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:18] [INFO ] [Nat]Absence check using state equation in 1158 ms returned sat
[2023-03-07 22:30:18] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 129 ms.
[2023-03-07 22:30:22] [INFO ] Added : 135 causal constraints over 27 iterations in 3417 ms. Result :unknown
[2023-03-07 22:30:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:23] [INFO ] [Real]Absence check using state equation in 1139 ms returned sat
[2023-03-07 22:30:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:30:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:25] [INFO ] [Nat]Absence check using state equation in 1161 ms returned sat
[2023-03-07 22:30:25] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 129 ms.
[2023-03-07 22:30:28] [INFO ] Added : 135 causal constraints over 27 iterations in 3422 ms. Result :unknown
[2023-03-07 22:30:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:30] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2023-03-07 22:30:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:30:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:31] [INFO ] [Nat]Absence check using state equation in 1097 ms returned sat
[2023-03-07 22:30:32] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 135 ms.
[2023-03-07 22:30:35] [INFO ] Added : 145 causal constraints over 29 iterations in 3488 ms. Result :unknown
[2023-03-07 22:30:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 22:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:36] [INFO ] [Real]Absence check using state equation in 1053 ms returned sat
[2023-03-07 22:30:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:30:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 22:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:38] [INFO ] [Nat]Absence check using state equation in 1054 ms returned sat
[2023-03-07 22:30:38] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 131 ms.
[2023-03-07 22:30:42] [INFO ] Added : 145 causal constraints over 29 iterations in 3554 ms. Result :unknown
[2023-03-07 22:30:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-07 22:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:43] [INFO ] [Real]Absence check using state equation in 1127 ms returned sat
[2023-03-07 22:30:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 22:30:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 22:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 22:30:45] [INFO ] [Nat]Absence check using state equation in 1154 ms returned sat
[2023-03-07 22:30:45] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 127 ms.
[2023-03-07 22:30:48] [INFO ] Added : 135 causal constraints over 27 iterations in 3472 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [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]
FORMULA CloudReconfiguration-PT-312-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2936 edges and 2585 vertex of which 847 / 2585 are part of one of the 62 SCC in 13 ms
Free SCC test removed 785 places
Drop transitions removed 956 transitions
Reduce isomorphic transitions removed 956 transitions.
Graph (complete) has 2419 edges and 1800 vertex of which 1786 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 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1207 rules applied. Total rules applied 1209 place count 1786 transition count 923
Reduce places removed 1198 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 1 with 1336 rules applied. Total rules applied 2545 place count 588 transition count 785
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 71 rules applied. Total rules applied 2616 place count 526 transition count 776
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 11 rules applied. Total rules applied 2627 place count 523 transition count 768
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 2638 place count 518 transition count 762
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 5 with 7 rules applied. Total rules applied 2645 place count 515 transition count 758
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2649 place count 511 transition count 758
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 23 Pre rules applied. Total rules applied 2649 place count 511 transition count 735
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 2695 place count 488 transition count 735
Discarding 78 places :
Symmetric choice reduction at 7 with 78 rule applications. Total rules 2773 place count 410 transition count 657
Iterating global reduction 7 with 78 rules applied. Total rules applied 2851 place count 410 transition count 657
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2851 place count 410 transition count 648
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2869 place count 401 transition count 648
Discarding 61 places :
Symmetric choice reduction at 7 with 61 rule applications. Total rules 2930 place count 340 transition count 586
Iterating global reduction 7 with 61 rules applied. Total rules applied 2991 place count 340 transition count 586
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 7 with 32 rules applied. Total rules applied 3023 place count 340 transition count 554
Reduce places removed 16 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 26 rules applied. Total rules applied 3049 place count 324 transition count 544
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3054 place count 319 transition count 544
Discarding 21 places :
Symmetric choice reduction at 10 with 21 rule applications. Total rules 3075 place count 298 transition count 511
Iterating global reduction 10 with 21 rules applied. Total rules applied 3096 place count 298 transition count 511
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3105 place count 298 transition count 502
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 3114 place count 289 transition count 484
Iterating global reduction 11 with 9 rules applied. Total rules applied 3123 place count 289 transition count 484
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3126 place count 286 transition count 478
Iterating global reduction 11 with 3 rules applied. Total rules applied 3129 place count 286 transition count 478
Performed 152 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 11 with 304 rules applied. Total rules applied 3433 place count 134 transition count 244
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3435 place count 134 transition count 242
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 3441 place count 131 transition count 239
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3447 place count 131 transition count 233
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 3453 place count 128 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3459 place count 128 transition count 224
Performed 34 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 14 with 68 rules applied. Total rules applied 3527 place count 94 transition count 257
Drop transitions removed 10 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 14 with 38 rules applied. Total rules applied 3565 place count 94 transition count 219
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 3586 place count 73 transition count 185
Iterating global reduction 15 with 21 rules applied. Total rules applied 3607 place count 73 transition count 185
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 3619 place count 73 transition count 173
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 3624 place count 68 transition count 163
Iterating global reduction 16 with 5 rules applied. Total rules applied 3629 place count 68 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 3634 place count 68 transition count 158
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 17 with 15 rules applied. Total rules applied 3649 place count 68 transition count 143
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 3651 place count 66 transition count 141
Iterating global reduction 17 with 2 rules applied. Total rules applied 3653 place count 66 transition count 141
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 3655 place count 66 transition count 139
Free-agglomeration rule applied 4 times.
Iterating global reduction 17 with 4 rules applied. Total rules applied 3659 place count 66 transition count 135
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 3665 place count 62 transition count 133
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3666 place count 62 transition count 132
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 18 with 8 rules applied. Total rules applied 3674 place count 62 transition count 132
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 3677 place count 62 transition count 129
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3678 place count 61 transition count 128
Iterating global reduction 18 with 1 rules applied. Total rules applied 3679 place count 61 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 3680 place count 60 transition count 127
Applied a total of 3680 rules in 262 ms. Remains 60 /2585 variables (removed 2525) and now considering 127/3095 (removed 2968) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 60/2585 places, 127/3095 transitions.
Normalized transition count is 121 out of 127 initially.
// Phase 1: matrix 121 rows 60 cols
[2023-03-07 22:30:49] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 13833 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties (out of 11) seen :11
FORMULA CloudReconfiguration-PT-312-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-312-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 83862 ms.

BK_STOP 1678228251144

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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