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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
622.615 85050.00 102608.00 495.30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 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-167814483700045.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-306, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814483700045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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.9K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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-306-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-306-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678317863130

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-306
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-08 23:24:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 23:24:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 23:24:24] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-08 23:24:24] [INFO ] Transformed 2584 places.
[2023-03-08 23:24:25] [INFO ] Transformed 3094 transitions.
[2023-03-08 23:24:25] [INFO ] Found NUPN structural information;
[2023-03-08 23:24:25] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 3094 rows 2584 cols
[2023-03-08 23:24:25] [INFO ] Computed 4 place invariants in 52 ms
Incomplete random walk after 10000 steps, including 106 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :1
FORMULA CloudReconfiguration-PT-306-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :1
FORMULA CloudReconfiguration-PT-306-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 39 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 41 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :2
FORMULA CloudReconfiguration-PT-306-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
[2023-03-08 23:24:25] [INFO ] Invariant cache hit.
[2023-03-08 23:24:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2023-03-08 23:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:24:27] [INFO ] [Real]Absence check using state equation in 1169 ms returned sat
[2023-03-08 23:24:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:24:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 23:24:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:24:28] [INFO ] [Nat]Absence check using state equation in 1082 ms returned sat
[2023-03-08 23:24:29] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 172 ms.
[2023-03-08 23:24:32] [INFO ] Added : 120 causal constraints over 24 iterations in 3449 ms. Result :unknown
[2023-03-08 23:24:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 23:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:24:34] [INFO ] [Real]Absence check using state equation in 1260 ms returned sat
[2023-03-08 23:24:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:24:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 23:24:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:24:35] [INFO ] [Nat]Absence check using state equation in 1169 ms returned sat
[2023-03-08 23:24:36] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 150 ms.
[2023-03-08 23:24:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 23:24:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-08 23:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:24:40] [INFO ] [Real]Absence check using state equation in 1133 ms returned sat
[2023-03-08 23:24:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:24:41] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 23:24:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:24:42] [INFO ] [Nat]Absence check using state equation in 1150 ms returned sat
[2023-03-08 23:24:42] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 128 ms.
[2023-03-08 23:24:45] [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: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-08 23:24:46] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 23:24:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:24:47] [INFO ] [Real]Absence check using state equation in 1102 ms returned sat
[2023-03-08 23:24:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:24:47] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 23:24:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:24:48] [INFO ] [Nat]Absence check using state equation in 1068 ms returned sat
[2023-03-08 23:24:49] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 126 ms.
[2023-03-08 23:24:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 23:24:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 23:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:24:54] [INFO ] [Real]Absence check using state equation in 1167 ms returned sat
[2023-03-08 23:24:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:24:54] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 23:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:24:55] [INFO ] [Nat]Absence check using state equation in 1142 ms returned sat
[2023-03-08 23:24:55] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 138 ms.
[2023-03-08 23:24:59] [INFO ] Added : 140 causal constraints over 28 iterations in 3475 ms. Result :unknown
[2023-03-08 23:24:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 23:24:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:00] [INFO ] [Real]Absence check using state equation in 1101 ms returned sat
[2023-03-08 23:25:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:25:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 23:25:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:02] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2023-03-08 23:25:02] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 130 ms.
[2023-03-08 23:25:05] [INFO ] Added : 133 causal constraints over 27 iterations in 3432 ms. Result :unknown
[2023-03-08 23:25:06] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 23:25:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:07] [INFO ] [Real]Absence check using state equation in 1125 ms returned sat
[2023-03-08 23:25:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:25:07] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 23:25:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:08] [INFO ] [Nat]Absence check using state equation in 1121 ms returned sat
[2023-03-08 23:25:09] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 132 ms.
[2023-03-08 23:25:12] [INFO ] Added : 140 causal constraints over 28 iterations in 3478 ms. Result :unknown
[2023-03-08 23:25:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 23:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:14] [INFO ] [Real]Absence check using state equation in 1215 ms returned sat
[2023-03-08 23:25:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:25:14] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 23:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:15] [INFO ] [Nat]Absence check using state equation in 1252 ms returned sat
[2023-03-08 23:25:16] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-08 23:25:19] [INFO ] Added : 135 causal constraints over 27 iterations in 3336 ms. Result :unknown
[2023-03-08 23:25:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 23:25:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:20] [INFO ] [Real]Absence check using state equation in 1118 ms returned sat
[2023-03-08 23:25:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:25:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 23:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:22] [INFO ] [Nat]Absence check using state equation in 1118 ms returned sat
[2023-03-08 23:25:22] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 132 ms.
[2023-03-08 23:25:25] [INFO ] Added : 138 causal constraints over 28 iterations in 3497 ms. Result :unknown
[2023-03-08 23:25:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 23:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:27] [INFO ] [Real]Absence check using state equation in 1146 ms returned sat
[2023-03-08 23:25:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:25:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 23:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:28] [INFO ] [Nat]Absence check using state equation in 1143 ms returned sat
[2023-03-08 23:25:29] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 124 ms.
[2023-03-08 23:25:32] [INFO ] Added : 140 causal constraints over 28 iterations in 3476 ms. Result :unknown
[2023-03-08 23:25:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-08 23:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:34] [INFO ] [Real]Absence check using state equation in 1133 ms returned sat
[2023-03-08 23:25:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:25:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 23:25:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:35] [INFO ] [Nat]Absence check using state equation in 1112 ms returned sat
[2023-03-08 23:25:35] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 148 ms.
[2023-03-08 23:25:39] [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-08 23:25:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 23:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:40] [INFO ] [Real]Absence check using state equation in 1133 ms returned sat
[2023-03-08 23:25:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:25:41] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 23:25:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:42] [INFO ] [Nat]Absence check using state equation in 1126 ms returned sat
[2023-03-08 23:25:42] [INFO ] Computed and/alt/rep : 3085/3789/3085 causal constraints (skipped 8 transitions) in 132 ms.
[2023-03-08 23:25:45] [INFO ] Added : 140 causal constraints over 28 iterations in 3482 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]
Support contains 12 out of 2584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Graph (trivial) has 2932 edges and 2584 vertex of which 850 / 2584 are part of one of the 64 SCC in 13 ms
Free SCC test removed 786 places
Drop transitions removed 961 transitions
Reduce isomorphic transitions removed 961 transitions.
Graph (complete) has 2411 edges and 1798 vertex of which 1784 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 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1205 rules applied. Total rules applied 1207 place count 1784 transition count 919
Reduce places removed 1196 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 1 with 1338 rules applied. Total rules applied 2545 place count 588 transition count 777
Reduce places removed 66 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 75 rules applied. Total rules applied 2620 place count 522 transition count 768
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 12 rules applied. Total rules applied 2632 place count 519 transition count 759
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 11 rules applied. Total rules applied 2643 place count 513 transition count 754
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 9 rules applied. Total rules applied 2652 place count 511 transition count 747
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2659 place count 504 transition count 747
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 2659 place count 504 transition count 726
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 2701 place count 483 transition count 726
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2778 place count 406 transition count 649
Iterating global reduction 7 with 77 rules applied. Total rules applied 2855 place count 406 transition count 649
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 2855 place count 406 transition count 641
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 2871 place count 398 transition count 641
Discarding 58 places :
Symmetric choice reduction at 7 with 58 rule applications. Total rules 2929 place count 340 transition count 583
Iterating global reduction 7 with 58 rules applied. Total rules applied 2987 place count 340 transition count 583
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 3021 place count 340 transition count 549
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 27 rules applied. Total rules applied 3048 place count 323 transition count 539
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3053 place count 318 transition count 539
Discarding 19 places :
Symmetric choice reduction at 10 with 19 rule applications. Total rules 3072 place count 299 transition count 510
Iterating global reduction 10 with 19 rules applied. Total rules applied 3091 place count 299 transition count 510
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3100 place count 299 transition count 501
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 3107 place count 292 transition count 487
Iterating global reduction 11 with 7 rules applied. Total rules applied 3114 place count 292 transition count 487
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3117 place count 289 transition count 481
Iterating global reduction 11 with 3 rules applied. Total rules applied 3120 place count 289 transition count 481
Performed 154 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 11 with 308 rules applied. Total rules applied 3428 place count 135 transition count 247
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3430 place count 135 transition count 245
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 3436 place count 132 transition count 242
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3442 place count 132 transition count 236
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 3448 place count 129 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3454 place count 129 transition count 227
Performed 32 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 14 with 64 rules applied. Total rules applied 3518 place count 97 transition count 265
Drop transitions removed 18 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 14 with 43 rules applied. Total rules applied 3561 place count 97 transition count 222
Discarding 22 places :
Symmetric choice reduction at 15 with 22 rule applications. Total rules 3583 place count 75 transition count 192
Iterating global reduction 15 with 22 rules applied. Total rules applied 3605 place count 75 transition count 192
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 15 with 13 rules applied. Total rules applied 3618 place count 75 transition count 179
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3622 place count 71 transition count 171
Iterating global reduction 16 with 4 rules applied. Total rules applied 3626 place count 71 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 3630 place count 71 transition count 167
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 17 with 17 rules applied. Total rules applied 3647 place count 71 transition count 150
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 3649 place count 69 transition count 145
Iterating global reduction 17 with 2 rules applied. Total rules applied 3651 place count 69 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 3652 place count 69 transition count 144
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3653 place count 69 transition count 143
Free-agglomeration rule applied 5 times.
Iterating global reduction 18 with 5 rules applied. Total rules applied 3658 place count 69 transition count 138
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 3664 place count 64 transition count 137
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3665 place count 64 transition count 136
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 19 with 4 rules applied. Total rules applied 3669 place count 64 transition count 136
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 3670 place count 64 transition count 135
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3671 place count 64 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 3672 place count 63 transition count 133
Applied a total of 3672 rules in 277 ms. Remains 63 /2584 variables (removed 2521) and now considering 133/3094 (removed 2961) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 63/2584 places, 133/3094 transitions.
Normalized transition count is 128 out of 133 initially.
// Phase 1: matrix 128 rows 63 cols
[2023-03-08 23:25:46] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 23071 resets, run finished after 865 ms. (steps per millisecond=1156 ) properties (out of 12) seen :11
FORMULA CloudReconfiguration-PT-306-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-306-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5614 resets, run finished after 262 ms. (steps per millisecond=3816 ) properties (out of 1) seen :0
[2023-03-08 23:25:47] [INFO ] Flow matrix only has 128 transitions (discarded 5 similar events)
// Phase 1: matrix 128 rows 63 cols
[2023-03-08 23:25:47] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 23:25:47] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 23:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:47] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 23:25:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:25:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 23:25:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:25:47] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-08 23:25:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 23:25:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 23:25:47] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 11 ms to minimize.
[2023-03-08 23:25:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA CloudReconfiguration-PT-306-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 82784 ms.
ITS solved all properties within timeout

BK_STOP 1678317948180

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-306"
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-306, 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-167814483700045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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