MCC'2021- Execution of r026-tajo-162038143900427

About the Execution of ITS-Tools for BusinessProcesses-PT-14

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
403.703	47158.00	69964.00	73.00	1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143900427.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 156K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620546179928

Running Version 0
[2021-05-09 07:43:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:43:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:43:02] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2021-05-09 07:43:02] [INFO ] Transformed 624 places.
[2021-05-09 07:43:02] [INFO ] Transformed 564 transitions.
[2021-05-09 07:43:02] [INFO ] Found NUPN structural information;
[2021-05-09 07:43:02] [INFO ] Parsed PT model containing 624 places and 564 transitions in 152 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
// Phase 1: matrix 556 rows 616 cols
[2021-05-09 07:43:02] [INFO ] Computed 99 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 67 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :8
FORMULA BusinessProcesses-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
// Phase 1: matrix 556 rows 616 cols
[2021-05-09 07:43:02] [INFO ] Computed 99 place invariants in 11 ms
[2021-05-09 07:43:02] [INFO ] [Real]Absence check using 60 positive place invariants in 23 ms returned sat
[2021-05-09 07:43:02] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-09 07:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:03] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2021-05-09 07:43:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:43:03] [INFO ] [Nat]Absence check using 60 positive place invariants in 19 ms returned sat
[2021-05-09 07:43:03] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:03] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2021-05-09 07:43:03] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 5 ms to minimize.
[2021-05-09 07:43:03] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2021-05-09 07:43:04] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:43:04] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:43:04] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 15 ms to minimize.
[2021-05-09 07:43:04] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 0 ms to minimize.
[2021-05-09 07:43:04] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 0 ms to minimize.
[2021-05-09 07:43:05] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:43:05] [INFO ] Deduced a trap composed of 142 places in 161 ms of which 0 ms to minimize.
[2021-05-09 07:43:05] [INFO ] Deduced a trap composed of 133 places in 167 ms of which 1 ms to minimize.
[2021-05-09 07:43:05] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:43:05] [INFO ] Deduced a trap composed of 148 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:43:05] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:43:05] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:43:06] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:43:06] [INFO ] Deduced a trap composed of 140 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:43:06] [INFO ] Deduced a trap composed of 146 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:43:06] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:43:06] [INFO ] Deduced a trap composed of 168 places in 185 ms of which 1 ms to minimize.
[2021-05-09 07:43:06] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 1 ms to minimize.
[2021-05-09 07:43:07] [INFO ] Deduced a trap composed of 142 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:43:07] [INFO ] Deduced a trap composed of 134 places in 184 ms of which 14 ms to minimize.
[2021-05-09 07:43:07] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 0 ms to minimize.
[2021-05-09 07:43:07] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:43:07] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:43:07] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:43:08] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:43:08] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2021-05-09 07:43:08] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 1 ms to minimize.
[2021-05-09 07:43:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2021-05-09 07:43:08] [INFO ] [Real]Absence check using 60 positive place invariants in 18 ms returned sat
[2021-05-09 07:43:08] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 27 ms returned sat
[2021-05-09 07:43:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:08] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-09 07:43:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:43:08] [INFO ] [Nat]Absence check using 60 positive place invariants in 20 ms returned sat
[2021-05-09 07:43:08] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 07:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:09] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2021-05-09 07:43:09] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 1 ms to minimize.
[2021-05-09 07:43:09] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:43:09] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:43:09] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:43:10] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:43:10] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 5 ms to minimize.
[2021-05-09 07:43:10] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 0 ms to minimize.
[2021-05-09 07:43:10] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 2 ms to minimize.
[2021-05-09 07:43:10] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:43:10] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2021-05-09 07:43:11] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:43:11] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:43:11] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 1 ms to minimize.
[2021-05-09 07:43:11] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:43:11] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:43:11] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 0 ms to minimize.
[2021-05-09 07:43:12] [INFO ] Deduced a trap composed of 143 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:43:12] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2021-05-09 07:43:12] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2021-05-09 07:43:12] [INFO ] Deduced a trap composed of 154 places in 137 ms of which 0 ms to minimize.
[2021-05-09 07:43:12] [INFO ] Deduced a trap composed of 142 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:43:12] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2021-05-09 07:43:12] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:43:12] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:43:12] [INFO ] Deduced a trap composed of 160 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:43:13] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:43:13] [INFO ] Deduced a trap composed of 138 places in 113 ms of which 11 ms to minimize.
[2021-05-09 07:43:13] [INFO ] Deduced a trap composed of 143 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:43:13] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 0 ms to minimize.
[2021-05-09 07:43:13] [INFO ] Deduced a trap composed of 142 places in 155 ms of which 1 ms to minimize.
[2021-05-09 07:43:13] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4625 ms
[2021-05-09 07:43:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:671)
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)
[2021-05-09 07:43:13] [INFO ] [Real]Absence check using 60 positive place invariants in 17 ms returned sat
[2021-05-09 07:43:13] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 07:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:14] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-09 07:43:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:43:14] [INFO ] [Nat]Absence check using 60 positive place invariants in 21 ms returned sat
[2021-05-09 07:43:14] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 07:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:14] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-09 07:43:14] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:43:14] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:43:14] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:43:14] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:43:14] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:43:15] [INFO ] Deduced a trap composed of 117 places in 144 ms of which 1 ms to minimize.
[2021-05-09 07:43:15] [INFO ] Deduced a trap composed of 142 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:43:15] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 3 ms to minimize.
[2021-05-09 07:43:15] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 2 ms to minimize.
[2021-05-09 07:43:15] [INFO ] Deduced a trap composed of 138 places in 115 ms of which 5 ms to minimize.
[2021-05-09 07:43:15] [INFO ] Deduced a trap composed of 142 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:43:16] [INFO ] Deduced a trap composed of 124 places in 151 ms of which 1 ms to minimize.
[2021-05-09 07:43:16] [INFO ] Deduced a trap composed of 143 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:43:16] [INFO ] Deduced a trap composed of 134 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:43:16] [INFO ] Deduced a trap composed of 139 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:43:16] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:43:16] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:43:16] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:43:16] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:43:17] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:43:17] [INFO ] Deduced a trap composed of 134 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:43:17] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 8 ms to minimize.
[2021-05-09 07:43:17] [INFO ] Deduced a trap composed of 140 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:43:17] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2021-05-09 07:43:17] [INFO ] Deduced a trap composed of 132 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:43:17] [INFO ] Deduced a trap composed of 124 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:43:18] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:43:18] [INFO ] Deduced a trap composed of 137 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:43:18] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:43:18] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:43:18] [INFO ] Deduced a trap composed of 139 places in 111 ms of which 0 ms to minimize.
[2021-05-09 07:43:18] [INFO ] Deduced a trap composed of 136 places in 216 ms of which 1 ms to minimize.
[2021-05-09 07:43:18] [INFO ] Deduced a trap composed of 135 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:43:19] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:43:19] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2021-05-09 07:43:19] [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)
[2021-05-09 07:43:19] [INFO ] [Real]Absence check using 60 positive place invariants in 16 ms returned sat
[2021-05-09 07:43:19] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 7 ms returned sat
[2021-05-09 07:43:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:19] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-09 07:43:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:43:19] [INFO ] [Nat]Absence check using 60 positive place invariants in 17 ms returned sat
[2021-05-09 07:43:19] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:43:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:19] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-09 07:43:20] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:43:20] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:43:20] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:43:20] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:43:20] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:43:20] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:43:20] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:43:20] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:43:20] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 0 ms to minimize.
[2021-05-09 07:43:21] [INFO ] Deduced a trap composed of 81 places in 173 ms of which 0 ms to minimize.
[2021-05-09 07:43:21] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:43:21] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:43:21] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:43:21] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:43:21] [INFO ] Deduced a trap composed of 102 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:43:21] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:43:21] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:43:21] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:43:21] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 1 ms to minimize.
[2021-05-09 07:43:22] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:43:22] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2125 ms
[2021-05-09 07:43:22] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 31 ms.
[2021-05-09 07:43:23] [INFO ] Added : 253 causal constraints over 51 iterations in 1664 ms. Result :sat
Minimization took 85 ms.
[2021-05-09 07:43:23] [INFO ] [Real]Absence check using 60 positive place invariants in 44 ms returned sat
[2021-05-09 07:43:24] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 14 ms returned sat
[2021-05-09 07:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:24] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2021-05-09 07:43:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:43:24] [INFO ] [Nat]Absence check using 60 positive place invariants in 18 ms returned sat
[2021-05-09 07:43:24] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 07:43:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:24] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-09 07:43:24] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:43:24] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:43:24] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 0 ms to minimize.
[2021-05-09 07:43:25] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:43:25] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:43:25] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 1 ms to minimize.
[2021-05-09 07:43:25] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 1 ms to minimize.
[2021-05-09 07:43:25] [INFO ] Deduced a trap composed of 152 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:43:25] [INFO ] Deduced a trap composed of 146 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:43:26] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 1 ms to minimize.
[2021-05-09 07:43:26] [INFO ] Deduced a trap composed of 146 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:43:26] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:43:26] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:43:26] [INFO ] Deduced a trap composed of 132 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:43:26] [INFO ] Deduced a trap composed of 131 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:43:26] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 0 ms to minimize.
[2021-05-09 07:43:26] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:43:27] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2532 ms
[2021-05-09 07:43:27] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 33 ms.
[2021-05-09 07:43:28] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:43:29] [INFO ] Deduced a trap composed of 155 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:43:29] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:43:29] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 0 ms to minimize.
[2021-05-09 07:43:29] [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)
[2021-05-09 07:43:29] [INFO ] [Real]Absence check using 60 positive place invariants in 16 ms returned sat
[2021-05-09 07:43:29] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 07:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:29] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-09 07:43:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:43:29] [INFO ] [Nat]Absence check using 60 positive place invariants in 39 ms returned sat
[2021-05-09 07:43:29] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 14 ms returned sat
[2021-05-09 07:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:29] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2021-05-09 07:43:30] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:43:30] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:43:30] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:43:30] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:43:30] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 0 ms to minimize.
[2021-05-09 07:43:30] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:43:31] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:43:31] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:43:31] [INFO ] Deduced a trap composed of 133 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:43:31] [INFO ] Deduced a trap composed of 158 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:43:31] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:43:31] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 0 ms to minimize.
[2021-05-09 07:43:32] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 1 ms to minimize.
[2021-05-09 07:43:32] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:43:32] [INFO ] Deduced a trap composed of 149 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:43:32] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:43:32] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:43:32] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:43:32] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:43:33] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:43:33] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2021-05-09 07:43:33] [INFO ] Deduced a trap composed of 143 places in 138 ms of which 1 ms to minimize.
[2021-05-09 07:43:33] [INFO ] Deduced a trap composed of 162 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:43:33] [INFO ] Deduced a trap composed of 150 places in 138 ms of which 1 ms to minimize.
[2021-05-09 07:43:33] [INFO ] Deduced a trap composed of 146 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:43:33] [INFO ] Deduced a trap composed of 144 places in 123 ms of which 0 ms to minimize.
[2021-05-09 07:43:34] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:43:34] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:43:34] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:43:34] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4490 ms
[2021-05-09 07:43:34] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 34 ms.
[2021-05-09 07:43:34] [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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
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)
[2021-05-09 07:43:34] [INFO ] [Real]Absence check using 60 positive place invariants in 27 ms returned sat
[2021-05-09 07:43:34] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:34] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2021-05-09 07:43:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:43:35] [INFO ] [Nat]Absence check using 60 positive place invariants in 26 ms returned sat
[2021-05-09 07:43:35] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:35] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2021-05-09 07:43:35] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:43:35] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:43:35] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:43:35] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:43:35] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:43:35] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:43:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 431 ms
[2021-05-09 07:43:35] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 42 ms.
[2021-05-09 07:43:37] [INFO ] Added : 244 causal constraints over 49 iterations in 1258 ms. Result :sat
Minimization took 147 ms.
[2021-05-09 07:43:37] [INFO ] [Real]Absence check using 60 positive place invariants in 17 ms returned sat
[2021-05-09 07:43:37] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 8 ms returned sat
[2021-05-09 07:43:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:37] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-09 07:43:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:43:37] [INFO ] [Nat]Absence check using 60 positive place invariants in 19 ms returned sat
[2021-05-09 07:43:37] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:43:37] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-09 07:43:37] [INFO ] Deduced a trap composed of 124 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:43:38] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:43:38] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2021-05-09 07:43:38] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:43:38] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:43:38] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:43:38] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 1 ms to minimize.
[2021-05-09 07:43:38] [INFO ] Deduced a trap composed of 148 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:43:39] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 0 ms to minimize.
[2021-05-09 07:43:39] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:43:39] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2021-05-09 07:43:39] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:43:39] [INFO ] Deduced a trap composed of 136 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:43:39] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 0 ms to minimize.
[2021-05-09 07:43:39] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:43:40] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 1 ms to minimize.
[2021-05-09 07:43:40] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2021-05-09 07:43:40] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:43:40] [INFO ] Deduced a trap composed of 113 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:43:40] [INFO ] Deduced a trap composed of 130 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:43:40] [INFO ] Deduced a trap composed of 126 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:43:41] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:43:41] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:43:41] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:43:41] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 12 ms to minimize.
[2021-05-09 07:43:41] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:43:41] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2021-05-09 07:43:41] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:43:41] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2021-05-09 07:43:41] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:43:41] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:43:42] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:43:42] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2021-05-09 07:43:42] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:43:42] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2021-05-09 07:43:42] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2021-05-09 07:43:42] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 4697 ms
[2021-05-09 07:43:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "line 4517 column 0: unexpected character; line 4517 column 1: ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "line 4517 column 0: unexpected character; line 4517 column 1: ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:671)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 27200 steps, including 119 resets, run finished after 71 ms. (steps per millisecond=383 ) properties (out of 8) seen :4 could not realise parikh vector
FORMULA BusinessProcesses-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 26500 steps, including 169 resets, run finished after 62 ms. (steps per millisecond=427 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 352 edges and 616 vertex of which 7 / 616 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1252 edges and 610 vertex of which 604 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 604 transition count 409
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 278 place count 466 transition count 409
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 278 place count 466 transition count 319
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 197 rules applied. Total rules applied 475 place count 359 transition count 319
Discarding 83 places :
Symmetric choice reduction at 2 with 83 rule applications. Total rules 558 place count 276 transition count 236
Iterating global reduction 2 with 83 rules applied. Total rules applied 641 place count 276 transition count 236
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 641 place count 276 transition count 227
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 662 place count 264 transition count 227
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 848 place count 170 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 850 place count 169 transition count 139
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 852 place count 169 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 854 place count 167 transition count 137
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 855 place count 167 transition count 137
Applied a total of 855 rules in 258 ms. Remains 167 /616 variables (removed 449) and now considering 137/556 (removed 419) transitions.
Finished structural reductions, in 1 iterations. Remains : 167/616 places, 137/556 transitions.
// Phase 1: matrix 137 rows 167 cols
[2021-05-09 07:43:42] [INFO ] Computed 72 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 41925 resets, run finished after 2455 ms. (steps per millisecond=407 ) properties (out of 3) seen :2
FORMULA BusinessProcesses-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 21127 resets, run finished after 1391 ms. (steps per millisecond=718 ) properties (out of 1) seen :1
FORMULA BusinessProcesses-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620546227086

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-14, 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 r026-tajo-162038143900427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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