Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 7.1K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 177K May 10 09:33 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 BusinessProcesses-PT-18-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652541444734

Running Version 0
[2022-05-14 15:17:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 15:17:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:17:26] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2022-05-14 15:17:26] [INFO ] Transformed 717 places.
[2022-05-14 15:17:26] [INFO ] Transformed 642 transitions.
[2022-05-14 15:17:26] [INFO ] Found NUPN structural information;
[2022-05-14 15:17:26] [INFO ] Parsed PT model containing 717 places and 642 transitions in 117 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 627 rows 702 cols
[2022-05-14 15:17:26] [INFO ] Computed 114 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 53 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 15) seen :7
FORMULA BusinessProcesses-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :2
FORMULA BusinessProcesses-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
// Phase 1: matrix 627 rows 702 cols
[2022-05-14 15:17:26] [INFO ] Computed 114 place invariants in 31 ms
[2022-05-14 15:17:26] [INFO ] [Real]Absence check using 73 positive place invariants in 38 ms returned sat
[2022-05-14 15:17:26] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2022-05-14 15:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:27] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2022-05-14 15:17:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:27] [INFO ] [Nat]Absence check using 73 positive place invariants in 33 ms returned sat
[2022-05-14 15:17:27] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 8 ms returned sat
[2022-05-14 15:17:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:27] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2022-05-14 15:17:27] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 3 ms to minimize.
[2022-05-14 15:17:28] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 1 ms to minimize.
[2022-05-14 15:17:28] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2022-05-14 15:17:28] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 2 ms to minimize.
[2022-05-14 15:17:28] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 1 ms to minimize.
[2022-05-14 15:17:28] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2022-05-14 15:17:28] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2022-05-14 15:17:28] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2022-05-14 15:17:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1192 ms
[2022-05-14 15:17:28] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 32 ms.
[2022-05-14 15:17:30] [INFO ] Added : 269 causal constraints over 54 iterations in 2178 ms. Result :sat
Minimization took 116 ms.
[2022-05-14 15:17:31] [INFO ] [Real]Absence check using 73 positive place invariants in 27 ms returned sat
[2022-05-14 15:17:31] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 9 ms returned sat
[2022-05-14 15:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:31] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-05-14 15:17:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:31] [INFO ] [Nat]Absence check using 73 positive place invariants in 28 ms returned sat
[2022-05-14 15:17:31] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 9 ms returned sat
[2022-05-14 15:17:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:31] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2022-05-14 15:17:31] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2022-05-14 15:17:32] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 0 ms to minimize.
[2022-05-14 15:17:32] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2022-05-14 15:17:32] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2022-05-14 15:17:32] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2022-05-14 15:17:32] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2022-05-14 15:17:32] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2022-05-14 15:17:32] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2022-05-14 15:17:32] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-05-14 15:17:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 982 ms
[2022-05-14 15:17:32] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 53 ms.
[2022-05-14 15:17:35] [INFO ] Deduced a trap composed of 153 places in 129 ms of which 1 ms to minimize.
[2022-05-14 15:17:35] [INFO ] Deduced a trap composed of 150 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:17:35] [INFO ] Deduced a trap composed of 146 places in 126 ms of which 0 ms to minimize.
[2022-05-14 15:17:35] [INFO ] Deduced a trap composed of 162 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:17:35] [INFO ] Deduced a trap composed of 148 places in 119 ms of which 2 ms to minimize.
[2022-05-14 15:17:35] [INFO ] Deduced a trap composed of 147 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:17:36] [INFO ] Deduced a trap composed of 147 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:17:36] [INFO ] Deduced a trap composed of 145 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:17:36] [INFO ] Deduced a trap composed of 151 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:17:36] [INFO ] Deduced a trap composed of 146 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:17:36] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:17:36] [INFO ] [Real]Absence check using 73 positive place invariants in 27 ms returned sat
[2022-05-14 15:17:36] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 9 ms returned sat
[2022-05-14 15:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:36] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-05-14 15:17:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:37] [INFO ] [Nat]Absence check using 73 positive place invariants in 26 ms returned sat
[2022-05-14 15:17:37] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 8 ms returned sat
[2022-05-14 15:17:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:37] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2022-05-14 15:17:37] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2022-05-14 15:17:37] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2022-05-14 15:17:37] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2022-05-14 15:17:37] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 0 ms to minimize.
[2022-05-14 15:17:38] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:17:38] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:17:38] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 1 ms to minimize.
[2022-05-14 15:17:38] [INFO ] Deduced a trap composed of 145 places in 125 ms of which 5 ms to minimize.
[2022-05-14 15:17:38] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:17:38] [INFO ] Deduced a trap composed of 142 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:17:38] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:17:39] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:17:39] [INFO ] Deduced a trap composed of 136 places in 125 ms of which 1 ms to minimize.
[2022-05-14 15:17:39] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:17:39] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:17:39] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:17:39] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:17:39] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 1 ms to minimize.
[2022-05-14 15:17:40] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:17:40] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:17:40] [INFO ] Deduced a trap composed of 159 places in 126 ms of which 0 ms to minimize.
[2022-05-14 15:17:40] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:17:40] [INFO ] Deduced a trap composed of 167 places in 126 ms of which 0 ms to minimize.
[2022-05-14 15:17:40] [INFO ] Deduced a trap composed of 136 places in 123 ms of which 2 ms to minimize.
[2022-05-14 15:17:41] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:17:41] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:17:41] [INFO ] Deduced a trap composed of 142 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:17:41] [INFO ] Deduced a trap composed of 170 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:17:41] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:17:41] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 8 ms to minimize.
[2022-05-14 15:17:41] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:17:42] [INFO ] Deduced a trap composed of 135 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:17:42] [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 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:17:42] [INFO ] [Real]Absence check using 73 positive place invariants in 27 ms returned sat
[2022-05-14 15:17:42] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2022-05-14 15:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:42] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2022-05-14 15:17:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:42] [INFO ] [Nat]Absence check using 73 positive place invariants in 27 ms returned sat
[2022-05-14 15:17:42] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 9 ms returned sat
[2022-05-14 15:17:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:42] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2022-05-14 15:17:42] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2022-05-14 15:17:43] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2022-05-14 15:17:43] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:17:43] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2022-05-14 15:17:43] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2022-05-14 15:17:43] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
[2022-05-14 15:17:43] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2022-05-14 15:17:43] [INFO ] Deduced a trap composed of 160 places in 126 ms of which 0 ms to minimize.
[2022-05-14 15:17:44] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 0 ms to minimize.
[2022-05-14 15:17:44] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:17:44] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 1 ms to minimize.
[2022-05-14 15:17:44] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2022-05-14 15:17:44] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 1 ms to minimize.
[2022-05-14 15:17:44] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 1 ms to minimize.
[2022-05-14 15:17:45] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:17:45] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:17:45] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2022-05-14 15:17:45] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:17:45] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:17:45] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:17:45] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:17:46] [INFO ] Deduced a trap composed of 164 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:17:46] [INFO ] Deduced a trap composed of 162 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:17:46] [INFO ] Deduced a trap composed of 144 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:17:46] [INFO ] Deduced a trap composed of 160 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:17:46] [INFO ] Deduced a trap composed of 151 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:17:46] [INFO ] Deduced a trap composed of 152 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:17:46] [INFO ] Deduced a trap composed of 162 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:17:47] [INFO ] Deduced a trap composed of 162 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:17:47] [INFO ] Deduced a trap composed of 169 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:17:47] [INFO ] Deduced a trap composed of 161 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:17:47] [INFO ] Deduced a trap composed of 159 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:17:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:17:47] [INFO ] [Real]Absence check using 73 positive place invariants in 26 ms returned sat
[2022-05-14 15:17:47] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 9 ms returned sat
[2022-05-14 15:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:47] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2022-05-14 15:17:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:48] [INFO ] [Nat]Absence check using 73 positive place invariants in 26 ms returned sat
[2022-05-14 15:17:48] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 9 ms returned sat
[2022-05-14 15:17:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:48] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2022-05-14 15:17:48] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2022-05-14 15:17:48] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2022-05-14 15:17:48] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2022-05-14 15:17:48] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2022-05-14 15:17:48] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2022-05-14 15:17:48] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2022-05-14 15:17:48] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 0 ms to minimize.
[2022-05-14 15:17:49] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2022-05-14 15:17:49] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 1 ms to minimize.
[2022-05-14 15:17:49] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 0 ms to minimize.
[2022-05-14 15:17:49] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2022-05-14 15:17:49] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2022-05-14 15:17:49] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2022-05-14 15:17:49] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2022-05-14 15:17:49] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 0 ms to minimize.
[2022-05-14 15:17:49] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2022-05-14 15:17:49] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1510 ms
[2022-05-14 15:17:49] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 33 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-05-14 15:17:53] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2022-05-14 15:17:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 15:17:53] [INFO ] [Real]Absence check using 73 positive place invariants in 26 ms returned sat
[2022-05-14 15:17:53] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 10 ms returned sat
[2022-05-14 15:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:53] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-05-14 15:17:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:17:53] [INFO ] [Nat]Absence check using 73 positive place invariants in 26 ms returned sat
[2022-05-14 15:17:53] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 9 ms returned sat
[2022-05-14 15:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:17:53] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2022-05-14 15:17:53] [INFO ] Deduced a trap composed of 157 places in 126 ms of which 1 ms to minimize.
[2022-05-14 15:17:54] [INFO ] Deduced a trap composed of 155 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:17:54] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:17:54] [INFO ] Deduced a trap composed of 121 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:17:54] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:17:54] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:17:54] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:17:54] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2022-05-14 15:17:55] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2022-05-14 15:17:55] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2022-05-14 15:17:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1336 ms
[2022-05-14 15:17:55] [INFO ] Computed and/alt/rep : 589/934/589 causal constraints (skipped 37 transitions) in 29 ms.
[2022-05-14 15:17:57] [INFO ] Added : 278 causal constraints over 56 iterations in 2136 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 21500 steps, including 106 resets, run finished after 62 ms. (steps per millisecond=346 ) properties (out of 6) seen :2 could not realise parikh vector
FORMULA BusinessProcesses-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 21500 steps, including 108 resets, run finished after 54 ms. (steps per millisecond=398 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 702 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 408 edges and 702 vertex of which 8 / 702 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1408 edges and 695 vertex of which 686 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 686 transition count 455
Reduce places removed 161 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 162 rules applied. Total rules applied 325 place count 525 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 326 place count 524 transition count 454
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 326 place count 524 transition count 350
Deduced a syphon composed of 104 places in 2 ms
Ensure Unique test removed 24 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 558 place count 396 transition count 350
Discarding 91 places :
Symmetric choice reduction at 3 with 91 rule applications. Total rules 649 place count 305 transition count 259
Iterating global reduction 3 with 91 rules applied. Total rules applied 740 place count 305 transition count 259
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 740 place count 305 transition count 249
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 763 place count 292 transition count 249
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 764 place count 291 transition count 248
Iterating global reduction 3 with 1 rules applied. Total rules applied 765 place count 291 transition count 248
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 983 place count 182 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 985 place count 181 transition count 142
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 986 place count 181 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 987 place count 180 transition count 141
Applied a total of 987 rules in 138 ms. Remains 180 /702 variables (removed 522) and now considering 141/627 (removed 486) transitions.
Finished structural reductions, in 1 iterations. Remains : 180/702 places, 141/627 transitions.
// Phase 1: matrix 141 rows 180 cols
[2022-05-14 15:17:57] [INFO ] Computed 79 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 53700 resets, run finished after 3179 ms. (steps per millisecond=314 ) properties (out of 3) seen :3
FORMULA BusinessProcesses-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652541481870

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is BusinessProcesses-PT-18, 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 r028-tall-165251936100172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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