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-167814483700037.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-305, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814483700037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.4K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 11:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K 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-305-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678314539121

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-305
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-08 22:29:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 22:29:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 22:29:00] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-08 22:29:00] [INFO ] Transformed 2585 places.
[2023-03-08 22:29:00] [INFO ] Transformed 3095 transitions.
[2023-03-08 22:29:00] [INFO ] Found NUPN structural information;
[2023-03-08 22:29:00] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-08 22:29:00] [INFO ] Computed 4 place invariants in 51 ms
Incomplete random walk after 10000 steps, including 82 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :1
FORMULA CloudReconfiguration-PT-305-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :1
FORMULA CloudReconfiguration-PT-305-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 27 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 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 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 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 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 25 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 25 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 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
[2023-03-08 22:29:01] [INFO ] Invariant cache hit.
[2023-03-08 22:29:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 22:29:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:02] [INFO ] [Real]Absence check using state equation in 1147 ms returned sat
[2023-03-08 22:29:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:29:03] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 22:29:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:04] [INFO ] [Nat]Absence check using state equation in 1088 ms returned sat
[2023-03-08 22:29:05] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 173 ms.
[2023-03-08 22:29:08] [INFO ] Added : 121 causal constraints over 25 iterations in 3347 ms. Result :unknown
[2023-03-08 22:29:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:29:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:09] [INFO ] [Real]Absence check using state equation in 1100 ms returned sat
[2023-03-08 22:29:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:29:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:29:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:11] [INFO ] [Nat]Absence check using state equation in 1097 ms returned sat
[2023-03-08 22:29:11] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 158 ms.
[2023-03-08 22:29:14] [INFO ] Added : 129 causal constraints over 26 iterations in 3519 ms. Result :unknown
[2023-03-08 22:29:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-08 22:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:16] [INFO ] [Real]Absence check using state equation in 1122 ms returned sat
[2023-03-08 22:29:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:29:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:29:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:18] [INFO ] [Nat]Absence check using state equation in 1198 ms returned sat
[2023-03-08 22:29:18] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 165 ms.
[2023-03-08 22:29:21] [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 22:29:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-08 22:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:23] [INFO ] [Real]Absence check using state equation in 1040 ms returned sat
[2023-03-08 22:29:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:29:23] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:29:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:24] [INFO ] [Nat]Absence check using state equation in 1048 ms returned sat
[2023-03-08 22:29:24] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 136 ms.
[2023-03-08 22:29:28] [INFO ] Added : 145 causal constraints over 29 iterations in 3534 ms. Result :unknown
[2023-03-08 22:29:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-08 22:29:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:29] [INFO ] [Real]Absence check using state equation in 1212 ms returned sat
[2023-03-08 22:29:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:29:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:29:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:31] [INFO ] [Nat]Absence check using state equation in 1194 ms returned sat
[2023-03-08 22:29:31] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-08 22:29:34] [INFO ] Added : 135 causal constraints over 27 iterations in 3386 ms. Result :unknown
[2023-03-08 22:29:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-08 22:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:36] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2023-03-08 22:29:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:29:36] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:38] [INFO ] [Nat]Absence check using state equation in 1480 ms returned sat
[2023-03-08 22:29:38] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 135 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-08 22:29:41] [INFO ] Added : 125 causal constraints over 25 iterations in 3117 ms. Result :unknown
[2023-03-08 22:29:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-08 22:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:43] [INFO ] [Real]Absence check using state equation in 1101 ms returned sat
[2023-03-08 22:29:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:29:43] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:44] [INFO ] [Nat]Absence check using state equation in 1119 ms returned sat
[2023-03-08 22:29:44] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 132 ms.
[2023-03-08 22:29:48] [INFO ] Added : 135 causal constraints over 27 iterations in 3464 ms. Result :unknown
[2023-03-08 22:29:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-08 22:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:49] [INFO ] [Real]Absence check using state equation in 1203 ms returned sat
[2023-03-08 22:29:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:29:50] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 22:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:51] [INFO ] [Nat]Absence check using state equation in 1187 ms returned sat
[2023-03-08 22:29:51] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 137 ms.
[2023-03-08 22:29:54] [INFO ] Added : 135 causal constraints over 27 iterations in 3437 ms. Result :unknown
[2023-03-08 22:29:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-08 22:29:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:56] [INFO ] [Real]Absence check using state equation in 1191 ms returned sat
[2023-03-08 22:29:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:29:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:29:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:29:58] [INFO ] [Nat]Absence check using state equation in 1608 ms returned sat
[2023-03-08 22:29:58] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 135 ms.
[2023-03-08 22:30:01] [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 8
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 22:30:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-08 22:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:30:03] [INFO ] [Real]Absence check using state equation in 1099 ms returned sat
[2023-03-08 22:30:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:30:03] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 22:30:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:30:04] [INFO ] [Nat]Absence check using state equation in 1137 ms returned sat
[2023-03-08 22:30:04] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 127 ms.
[2023-03-08 22:30:08] [INFO ] Added : 135 causal constraints over 27 iterations in 3461 ms. Result :unknown
[2023-03-08 22:30:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-08 22:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:30:09] [INFO ] [Real]Absence check using state equation in 1143 ms returned sat
[2023-03-08 22:30:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:30:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 22:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:30:11] [INFO ] [Nat]Absence check using state equation in 1145 ms returned sat
[2023-03-08 22:30:11] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 127 ms.
[2023-03-08 22:30:14] [INFO ] Added : 140 causal constraints over 28 iterations in 3448 ms. Result :unknown
[2023-03-08 22:30:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-08 22:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:30:16] [INFO ] [Real]Absence check using state equation in 1068 ms returned sat
[2023-03-08 22:30:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:30:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-08 22:30:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:30:17] [INFO ] [Nat]Absence check using state equation in 1074 ms returned sat
[2023-03-08 22:30:18] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 128 ms.
[2023-03-08 22:30:21] [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 11
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 22:30:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 22:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:30:23] [INFO ] [Real]Absence check using state equation in 1122 ms returned sat
[2023-03-08 22:30:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:30:23] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:30:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:30:24] [INFO ] [Nat]Absence check using state equation in 1141 ms returned sat
[2023-03-08 22:30:24] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 130 ms.
[2023-03-08 22:30:28] [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 12
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 22:30:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-08 22:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 22:30:29] [INFO ] [Real]Absence check using state equation in 1130 ms returned sat
[2023-03-08 22:30:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 22:30:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 22:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 22:30:31] [INFO ] [Nat]Absence check using state equation in 1176 ms returned sat
[2023-03-08 22:30:31] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 135 ms.
[2023-03-08 22:30:34] [INFO ] Added : 140 causal constraints over 28 iterations in 3432 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 14 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2927 edges and 2585 vertex of which 847 / 2585 are part of one of the 61 SCC in 17 ms
Free SCC test removed 786 places
Drop transitions removed 958 transitions
Reduce isomorphic transitions removed 958 transitions.
Graph (complete) has 2417 edges and 1799 vertex of which 1785 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1184 transitions
Trivial Post-agglo rules discarded 1184 transitions
Performed 1184 trivial Post agglomeration. Transition count delta: 1184
Iterating post reduction 0 with 1193 rules applied. Total rules applied 1195 place count 1785 transition count 935
Reduce places removed 1184 places and 0 transitions.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 1319 rules applied. Total rules applied 2514 place count 601 transition count 800
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 2 with 68 rules applied. Total rules applied 2582 place count 541 transition count 792
Reduce places removed 2 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 3 with 16 rules applied. Total rules applied 2598 place count 539 transition count 778
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 2613 place count 525 transition count 777
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 22 Pre rules applied. Total rules applied 2613 place count 525 transition count 755
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 2657 place count 503 transition count 755
Discarding 78 places :
Symmetric choice reduction at 5 with 78 rule applications. Total rules 2735 place count 425 transition count 677
Iterating global reduction 5 with 78 rules applied. Total rules applied 2813 place count 425 transition count 677
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 2813 place count 425 transition count 668
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 2831 place count 416 transition count 668
Discarding 62 places :
Symmetric choice reduction at 5 with 62 rule applications. Total rules 2893 place count 354 transition count 606
Iterating global reduction 5 with 62 rules applied. Total rules applied 2955 place count 354 transition count 606
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 5 with 36 rules applied. Total rules applied 2991 place count 354 transition count 570
Reduce places removed 18 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 6 with 30 rules applied. Total rules applied 3021 place count 336 transition count 558
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 3027 place count 330 transition count 558
Discarding 21 places :
Symmetric choice reduction at 8 with 21 rule applications. Total rules 3048 place count 309 transition count 525
Iterating global reduction 8 with 21 rules applied. Total rules applied 3069 place count 309 transition count 525
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 3078 place count 309 transition count 516
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 3087 place count 300 transition count 498
Iterating global reduction 9 with 9 rules applied. Total rules applied 3096 place count 300 transition count 498
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 3099 place count 297 transition count 492
Iterating global reduction 9 with 3 rules applied. Total rules applied 3102 place count 297 transition count 492
Performed 150 Post agglomeration using F-continuation condition with reduction of 79 identical transitions.
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 9 with 300 rules applied. Total rules applied 3402 place count 147 transition count 263
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 3405 place count 147 transition count 260
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 10 with 6 rules applied. Total rules applied 3411 place count 144 transition count 257
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3417 place count 144 transition count 251
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 11 with 6 rules applied. Total rules applied 3423 place count 141 transition count 248
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3429 place count 141 transition count 242
Performed 37 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 12 with 74 rules applied. Total rules applied 3503 place count 104 transition count 274
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 12 with 23 rules applied. Total rules applied 3526 place count 104 transition count 251
Discarding 21 places :
Symmetric choice reduction at 13 with 21 rule applications. Total rules 3547 place count 83 transition count 209
Iterating global reduction 13 with 21 rules applied. Total rules applied 3568 place count 83 transition count 209
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 3575 place count 83 transition count 202
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 3577 place count 81 transition count 198
Iterating global reduction 14 with 2 rules applied. Total rules applied 3579 place count 81 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 3581 place count 81 transition count 196
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 15 with 7 rules applied. Total rules applied 3588 place count 81 transition count 189
Free-agglomeration rule applied 6 times.
Iterating global reduction 15 with 6 rules applied. Total rules applied 3594 place count 81 transition count 183
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 3602 place count 75 transition count 181
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 3604 place count 75 transition count 179
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 16 with 4 rules applied. Total rules applied 3608 place count 75 transition count 179
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 3609 place count 75 transition count 178
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 3610 place count 74 transition count 177
Iterating global reduction 16 with 1 rules applied. Total rules applied 3611 place count 74 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 3612 place count 73 transition count 176
Applied a total of 3612 rules in 254 ms. Remains 73 /2585 variables (removed 2512) and now considering 176/3095 (removed 2919) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 73/2585 places, 176/3095 transitions.
Normalized transition count is 165 out of 176 initially.
// Phase 1: matrix 165 rows 73 cols
[2023-03-08 22:30:35] [INFO ] Computed 4 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 12781 resets, run finished after 1221 ms. (steps per millisecond=819 ) properties (out of 14) seen :14
FORMULA CloudReconfiguration-PT-305-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 95813 ms.
ITS solved all properties within timeout

BK_STOP 1678314637151

--------------------
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-305"
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-305, 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-167814483700037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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