fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r045-oct2-162038291800355
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for CloudDeployment-PT-7b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2007.852 44455.00 60241.00 117.50 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/fko/mcc2021-input.r045-oct2-162038291800355.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CloudDeployment-PT-7b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291800355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 20M May 5 16:51 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 CloudDeployment-PT-7b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-7b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620576932096

Running Version 0
[2021-05-09 16:15:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 16:15:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 16:15:36] [INFO ] Load time of PNML (sax parser for PT used): 1260 ms
[2021-05-09 16:15:36] [INFO ] Transformed 2271 places.
[2021-05-09 16:15:36] [INFO ] Transformed 19752 transitions.
[2021-05-09 16:15:36] [INFO ] Found NUPN structural information;
[2021-05-09 16:15:36] [INFO ] Parsed PT model containing 2271 places and 19752 transitions in 1453 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
// Phase 1: matrix 19752 rows 2271 cols
[2021-05-09 16:15:37] [INFO ] Computed 29 place invariants in 540 ms
Incomplete random walk after 10000 steps, including 44 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 16) seen :5
FORMULA CloudDeployment-PT-7b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :1
FORMULA CloudDeployment-PT-7b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :1
FORMULA CloudDeployment-PT-7b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :2
FORMULA CloudDeployment-PT-7b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 19752 rows 2271 cols
[2021-05-09 16:15:38] [INFO ] Computed 29 place invariants in 385 ms
[2021-05-09 16:15:38] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 52 ms returned sat
[2021-05-09 16:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:15:43] [INFO ] [Real]Absence check using state equation in 4454 ms returned unknown
[2021-05-09 16:15:43] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 64 ms returned sat
[2021-05-09 16:15:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:15:48] [INFO ] [Real]Absence check using state equation in 4362 ms returned unknown
[2021-05-09 16:15:48] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 42 ms returned sat
[2021-05-09 16:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:15:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 16:15:53] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 41 ms returned sat
[2021-05-09 16:15:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:15:58] [INFO ] [Real]Absence check using state equation in 4701 ms returned unknown
[2021-05-09 16:15:58] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 42 ms returned sat
[2021-05-09 16:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:16:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 16:16:03] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 44 ms returned sat
[2021-05-09 16:16:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:16:08] [INFO ] [Real]Absence check using state equation in 4633 ms returned unknown
[2021-05-09 16:16:08] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 43 ms returned sat
[2021-05-09 16:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:16:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 2271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2271/2271 places, 19752/19752 transitions.
Graph (trivial) has 2276 edges and 2271 vertex of which 580 / 2271 are part of one of the 56 SCC in 59 ms
Free SCC test removed 524 places
Drop transitions removed 17025 transitions
Reduce isomorphic transitions removed 17025 transitions.
Graph (complete) has 5482 edges and 1747 vertex of which 1696 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.10 ms
Discarding 51 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 803 transitions
Trivial Post-agglo rules discarded 803 transitions
Performed 803 trivial Post agglomeration. Transition count delta: 803
Iterating post reduction 0 with 831 rules applied. Total rules applied 833 place count 1696 transition count 1889
Reduce places removed 803 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 807 rules applied. Total rules applied 1640 place count 893 transition count 1885
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1644 place count 889 transition count 1885
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 1644 place count 889 transition count 1857
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1700 place count 861 transition count 1857
Discarding 418 places :
Symmetric choice reduction at 3 with 418 rule applications. Total rules 2118 place count 443 transition count 1439
Iterating global reduction 3 with 418 rules applied. Total rules applied 2536 place count 443 transition count 1439
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 2578 place count 443 transition count 1397
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 2578 place count 443 transition count 1363
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 2646 place count 409 transition count 1363
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 2651 place count 404 transition count 1358
Iterating global reduction 4 with 5 rules applied. Total rules applied 2656 place count 404 transition count 1358
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2660 place count 400 transition count 1354
Iterating global reduction 4 with 4 rules applied. Total rules applied 2664 place count 400 transition count 1354
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2667 place count 397 transition count 1351
Iterating global reduction 4 with 3 rules applied. Total rules applied 2670 place count 397 transition count 1351
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2672 place count 395 transition count 1349
Iterating global reduction 4 with 2 rules applied. Total rules applied 2674 place count 395 transition count 1349
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2675 place count 394 transition count 1348
Iterating global reduction 4 with 1 rules applied. Total rules applied 2676 place count 394 transition count 1348
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 2874 place count 295 transition count 1249
Performed 42 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 2958 place count 253 transition count 1550
Drop transitions removed 20 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 2985 place count 253 transition count 1523
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 2999 place count 246 transition count 1607
Drop transitions removed 283 transitions
Redundant transition composition rules discarded 283 transitions
Iterating global reduction 5 with 283 rules applied. Total rules applied 3282 place count 246 transition count 1324
Free-agglomeration rule applied 73 times with reduction of 42 identical transitions.
Iterating global reduction 5 with 73 rules applied. Total rules applied 3355 place count 246 transition count 1209
Reduce places removed 73 places and 0 transitions.
Drop transitions removed 188 transitions
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 279 transitions.
Graph (complete) has 1596 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 353 rules applied. Total rules applied 3708 place count 172 transition count 930
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3709 place count 172 transition count 929
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 3714 place count 167 transition count 889
Iterating global reduction 7 with 5 rules applied. Total rules applied 3719 place count 167 transition count 889
Drop transitions removed 148 transitions
Redundant transition composition rules discarded 148 transitions
Iterating global reduction 7 with 148 rules applied. Total rules applied 3867 place count 167 transition count 741
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3868 place count 166 transition count 740
Applied a total of 3868 rules in 674 ms. Remains 166 /2271 variables (removed 2105) and now considering 740/19752 (removed 19012) transitions.
Finished structural reductions, in 1 iterations. Remains : 166/2271 places, 740/19752 transitions.
Normalized transition count is 355 out of 740 initially.
// Phase 1: matrix 355 rows 166 cols
[2021-05-09 16:16:14] [INFO ] Computed 27 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 10937 resets, run finished after 2273 ms. (steps per millisecond=439 ) properties (out of 7) seen :7
FORMULA CloudDeployment-PT-7b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620576976551

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-7b, 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 r045-oct2-162038291800355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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