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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
709.644 84999.00 101268.00 633.90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r107-tall-167814483800141.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is CloudReconfiguration-PT-318, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814483800141
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K Feb 25 11:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 11:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:51 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:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 11:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 11:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 11:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 25 11:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 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-318-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-318-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678336645922

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-318
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 04:37:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 04:37:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 04:37:27] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2023-03-09 04:37:27] [INFO ] Transformed 2587 places.
[2023-03-09 04:37:27] [INFO ] Transformed 3099 transitions.
[2023-03-09 04:37:27] [INFO ] Found NUPN structural information;
[2023-03-09 04:37:27] [INFO ] Parsed PT model containing 2587 places and 3099 transitions and 6479 arcs in 392 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:37:27] [INFO ] Computed 4 place invariants in 58 ms
Incomplete random walk after 10000 steps, including 85 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :2
FORMULA CloudReconfiguration-PT-318-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-318-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 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 23 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 24 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 25 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :1
FORMULA CloudReconfiguration-PT-318-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-09 04:37:28] [INFO ] Invariant cache hit.
[2023-03-09 04:37:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 105 ms returned sat
[2023-03-09 04:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:37:30] [INFO ] [Real]Absence check using state equation in 1236 ms returned sat
[2023-03-09 04:37:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:37:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-09 04:37:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:37:31] [INFO ] [Nat]Absence check using state equation in 1159 ms returned sat
[2023-03-09 04:37:32] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 156 ms.
[2023-03-09 04:37:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 04:37:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:37:36] [INFO ] [Real]Absence check using state equation in 1229 ms returned sat
[2023-03-09 04:37:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:37:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 04:37:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:37:38] [INFO ] [Nat]Absence check using state equation in 1251 ms returned sat
[2023-03-09 04:37:38] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 164 ms.
[2023-03-09 04:37:42] [INFO ] Added : 130 causal constraints over 26 iterations in 3279 ms. Result :unknown
[2023-03-09 04:37:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 04:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:37:43] [INFO ] [Real]Absence check using state equation in 1087 ms returned sat
[2023-03-09 04:37:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:37:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-09 04:37:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:37:45] [INFO ] [Nat]Absence check using state equation in 1096 ms returned sat
[2023-03-09 04:37:45] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 147 ms.
[2023-03-09 04:37:48] [INFO ] Added : 130 causal constraints over 26 iterations in 3461 ms. Result :unknown
[2023-03-09 04:37:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:37:50] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2023-03-09 04:37:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:37:50] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:37:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:37:52] [INFO ] [Nat]Absence check using state equation in 1622 ms returned sat
[2023-03-09 04:37:52] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 154 ms.
[2023-03-09 04:37:55] [INFO ] Added : 110 causal constraints over 22 iterations in 2966 ms. Result :unknown
[2023-03-09 04:37:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:37:57] [INFO ] [Real]Absence check using state equation in 1185 ms returned sat
[2023-03-09 04:37:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:37:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-09 04:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:37:58] [INFO ] [Nat]Absence check using state equation in 1153 ms returned sat
[2023-03-09 04:37:58] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 158 ms.
[2023-03-09 04:38:02] [INFO ] Added : 135 causal constraints over 27 iterations in 3453 ms. Result :unknown
[2023-03-09 04:38:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 04:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:03] [INFO ] [Real]Absence check using state equation in 1096 ms returned sat
[2023-03-09 04:38:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:38:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 04:38:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:05] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2023-03-09 04:38:05] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-09 04:38:08] [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 5
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:38:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 04:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:10] [INFO ] [Real]Absence check using state equation in 1184 ms returned sat
[2023-03-09 04:38:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:38:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:12] [INFO ] [Nat]Absence check using state equation in 1235 ms returned sat
[2023-03-09 04:38:12] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 149 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-09 04:38:15] [INFO ] Added : 120 causal constraints over 24 iterations in 3357 ms. Result :unknown
[2023-03-09 04:38:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 04:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:17] [INFO ] [Real]Absence check using state equation in 1147 ms returned sat
[2023-03-09 04:38:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:38:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 04:38:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:18] [INFO ] [Nat]Absence check using state equation in 1157 ms returned sat
[2023-03-09 04:38:18] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 126 ms.
[2023-03-09 04:38:22] [INFO ] Added : 135 causal constraints over 27 iterations in 3438 ms. Result :unknown
[2023-03-09 04:38:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 04:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:23] [INFO ] [Real]Absence check using state equation in 1056 ms returned sat
[2023-03-09 04:38:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:38:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:38:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:25] [INFO ] [Nat]Absence check using state equation in 1080 ms returned sat
[2023-03-09 04:38:25] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 129 ms.
[2023-03-09 04:38:28] [INFO ] Added : 135 causal constraints over 27 iterations in 3476 ms. Result :unknown
[2023-03-09 04:38:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 04:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:30] [INFO ] [Real]Absence check using state equation in 1077 ms returned sat
[2023-03-09 04:38:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:38:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 04:38:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:31] [INFO ] [Nat]Absence check using state equation in 1145 ms returned sat
[2023-03-09 04:38:32] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 130 ms.
[2023-03-09 04:38:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 04:38:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 04:38:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:36] [INFO ] [Real]Absence check using state equation in 1071 ms returned sat
[2023-03-09 04:38:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:38:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 04:38:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:38] [INFO ] [Nat]Absence check using state equation in 1083 ms returned sat
[2023-03-09 04:38:38] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 131 ms.
[2023-03-09 04:38:41] [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 10
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:38:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-09 04:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:43] [INFO ] [Real]Absence check using state equation in 1126 ms returned sat
[2023-03-09 04:38:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:38:43] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-09 04:38:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:38:44] [INFO ] [Nat]Absence check using state equation in 1139 ms returned sat
[2023-03-09 04:38:45] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 129 ms.
[2023-03-09 04:38:48] [INFO ] Added : 140 causal constraints over 28 iterations in 3463 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-318-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 2587 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Graph (trivial) has 2935 edges and 2587 vertex of which 851 / 2587 are part of one of the 61 SCC in 13 ms
Free SCC test removed 790 places
Drop transitions removed 962 transitions
Reduce isomorphic transitions removed 962 transitions.
Graph (complete) has 2423 edges and 1797 vertex of which 1783 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 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 1192 transitions
Trivial Post-agglo rules discarded 1192 transitions
Performed 1192 trivial Post agglomeration. Transition count delta: 1192
Iterating post reduction 0 with 1201 rules applied. Total rules applied 1203 place count 1783 transition count 927
Reduce places removed 1192 places and 0 transitions.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 1 with 1335 rules applied. Total rules applied 2538 place count 591 transition count 784
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 76 rules applied. Total rules applied 2614 place count 526 transition count 773
Reduce places removed 4 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 12 rules applied. Total rules applied 2626 place count 522 transition count 765
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 2637 place count 517 transition count 759
Reduce places removed 3 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 10 rules applied. Total rules applied 2647 place count 514 transition count 752
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2654 place count 507 transition count 752
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 23 Pre rules applied. Total rules applied 2654 place count 507 transition count 729
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 2700 place count 484 transition count 729
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2777 place count 407 transition count 652
Iterating global reduction 7 with 77 rules applied. Total rules applied 2854 place count 407 transition count 652
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2854 place count 407 transition count 643
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2872 place count 398 transition count 643
Discarding 59 places :
Symmetric choice reduction at 7 with 59 rule applications. Total rules 2931 place count 339 transition count 584
Iterating global reduction 7 with 59 rules applied. Total rules applied 2990 place count 339 transition count 584
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 7 with 34 rules applied. Total rules applied 3024 place count 339 transition count 550
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 8 with 29 rules applied. Total rules applied 3053 place count 322 transition count 538
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 3059 place count 316 transition count 538
Discarding 19 places :
Symmetric choice reduction at 10 with 19 rule applications. Total rules 3078 place count 297 transition count 509
Iterating global reduction 10 with 19 rules applied. Total rules applied 3097 place count 297 transition count 509
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3105 place count 297 transition count 501
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 3113 place count 289 transition count 485
Iterating global reduction 11 with 8 rules applied. Total rules applied 3121 place count 289 transition count 485
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3124 place count 286 transition count 479
Iterating global reduction 11 with 3 rules applied. Total rules applied 3127 place count 286 transition count 479
Performed 149 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 11 with 298 rules applied. Total rules applied 3425 place count 137 transition count 252
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 3427 place count 137 transition count 250
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 3431 place count 135 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 3435 place count 135 transition count 244
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 3439 place count 133 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 3443 place count 133 transition count 238
Performed 35 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 14 with 70 rules applied. Total rules applied 3513 place count 98 transition count 281
Drop transitions removed 10 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 14 with 42 rules applied. Total rules applied 3555 place count 98 transition count 239
Discarding 20 places :
Symmetric choice reduction at 15 with 20 rule applications. Total rules 3575 place count 78 transition count 206
Iterating global reduction 15 with 20 rules applied. Total rules applied 3595 place count 78 transition count 206
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 3605 place count 78 transition count 196
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3609 place count 74 transition count 188
Iterating global reduction 16 with 4 rules applied. Total rules applied 3613 place count 74 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 3615 place count 74 transition count 186
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 17 with 19 rules applied. Total rules applied 3634 place count 74 transition count 167
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 3636 place count 72 transition count 163
Iterating global reduction 17 with 2 rules applied. Total rules applied 3638 place count 72 transition count 163
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3639 place count 71 transition count 162
Iterating global reduction 17 with 1 rules applied. Total rules applied 3640 place count 71 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 3642 place count 71 transition count 160
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3643 place count 71 transition count 159
Free-agglomeration rule applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 3647 place count 71 transition count 155
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 3652 place count 67 transition count 154
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 3655 place count 67 transition count 154
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 3656 place count 67 transition count 153
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3657 place count 67 transition count 152
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 3658 place count 66 transition count 151
Iterating global reduction 20 with 1 rules applied. Total rules applied 3659 place count 66 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 3660 place count 65 transition count 150
Applied a total of 3660 rules in 258 ms. Remains 65 /2587 variables (removed 2522) and now considering 150/3099 (removed 2949) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 65/2587 places, 150/3099 transitions.
Normalized transition count is 140 out of 150 initially.
// Phase 1: matrix 140 rows 65 cols
[2023-03-09 04:38:48] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 9732 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties (out of 11) seen :11
FORMULA CloudReconfiguration-PT-318-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 82706 ms.
ITS solved all properties within timeout

BK_STOP 1678336730921

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-318"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is CloudReconfiguration-PT-318, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r107-tall-167814483800141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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