About the Execution of ITS-Tools for BusinessProcesses-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 301.863 | 33024.00 | 48052.00 | 351.80 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918600477.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 itstools
Input is BusinessProcesses-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600477
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 6.8K Apr 29 23:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 23:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 23:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 23:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:11 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 192K 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-20-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652641894718
Running Version 202205111006
[2022-05-15 19:11:35] [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-15 19:11:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 19:11:36] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2022-05-15 19:11:36] [INFO ] Transformed 782 places.
[2022-05-15 19:11:36] [INFO ] Transformed 697 transitions.
[2022-05-15 19:11:36] [INFO ] Found NUPN structural information;
[2022-05-15 19:11:36] [INFO ] Parsed PT model containing 782 places and 697 transitions in 237 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 63 places in 16 ms
Reduce places removed 63 places and 59 transitions.
// Phase 1: matrix 638 rows 719 cols
[2022-05-15 19:11:36] [INFO ] Computed 121 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 50 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :11
FORMULA BusinessProcesses-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
// Phase 1: matrix 638 rows 719 cols
[2022-05-15 19:11:36] [INFO ] Computed 121 place invariants in 16 ms
[2022-05-15 19:11:36] [INFO ] [Real]Absence check using 78 positive place invariants in 40 ms returned sat
[2022-05-15 19:11:36] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 14 ms returned sat
[2022-05-15 19:11:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:11:36] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2022-05-15 19:11:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:11:37] [INFO ] [Nat]Absence check using 78 positive place invariants in 38 ms returned sat
[2022-05-15 19:11:37] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2022-05-15 19:11:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:11:37] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2022-05-15 19:11:37] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 9 ms to minimize.
[2022-05-15 19:11:37] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 2 ms to minimize.
[2022-05-15 19:11:37] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2022-05-15 19:11:38] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2022-05-15 19:11:38] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 1 ms to minimize.
[2022-05-15 19:11:38] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 0 ms to minimize.
[2022-05-15 19:11:38] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2022-05-15 19:11:38] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2022-05-15 19:11:38] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2022-05-15 19:11:38] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2022-05-15 19:11:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1492 ms
[2022-05-15 19:11:38] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 42 ms.
[2022-05-15 19:11:41] [INFO ] Added : 321 causal constraints over 65 iterations in 2909 ms. Result :sat
Minimization took 153 ms.
[2022-05-15 19:11:42] [INFO ] [Real]Absence check using 78 positive place invariants in 30 ms returned sat
[2022-05-15 19:11:42] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 12 ms returned sat
[2022-05-15 19:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:11:42] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2022-05-15 19:11:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:11:42] [INFO ] [Nat]Absence check using 78 positive place invariants in 36 ms returned sat
[2022-05-15 19:11:42] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2022-05-15 19:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:11:42] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2022-05-15 19:11:43] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2022-05-15 19:11:43] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2022-05-15 19:11:43] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 0 ms to minimize.
[2022-05-15 19:11:43] [INFO ] Deduced a trap composed of 148 places in 182 ms of which 1 ms to minimize.
[2022-05-15 19:11:43] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 1 ms to minimize.
[2022-05-15 19:11:44] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 1 ms to minimize.
[2022-05-15 19:11:44] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 0 ms to minimize.
[2022-05-15 19:11:44] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 1 ms to minimize.
[2022-05-15 19:11:44] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 1 ms to minimize.
[2022-05-15 19:11:44] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2022-05-15 19:11:45] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 1 ms to minimize.
[2022-05-15 19:11:45] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 1 ms to minimize.
[2022-05-15 19:11:45] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 0 ms to minimize.
[2022-05-15 19:11:45] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2022-05-15 19:11:45] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 0 ms to minimize.
[2022-05-15 19:11:45] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 1 ms to minimize.
[2022-05-15 19:11:46] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 1 ms to minimize.
[2022-05-15 19:11:46] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 0 ms to minimize.
[2022-05-15 19:11:46] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2022-05-15 19:11:46] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 0 ms to minimize.
[2022-05-15 19:11:46] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 0 ms to minimize.
[2022-05-15 19:11:46] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2022-05-15 19:11:46] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2022-05-15 19:11:47] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 0 ms to minimize.
[2022-05-15 19:11:47] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 3 ms to minimize.
[2022-05-15 19:11:47] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 0 ms to minimize.
[2022-05-15 19:11:47] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 0 ms to minimize.
[2022-05-15 19:11:47] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 0 ms to minimize.
[2022-05-15 19:11: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 19:11:47] [INFO ] [Real]Absence check using 78 positive place invariants in 28 ms returned sat
[2022-05-15 19:11:47] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 15 ms returned sat
[2022-05-15 19:11:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:11:47] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2022-05-15 19:11:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:11:48] [INFO ] [Nat]Absence check using 78 positive place invariants in 28 ms returned sat
[2022-05-15 19:11:48] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 12 ms returned sat
[2022-05-15 19:11:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:11:48] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2022-05-15 19:11:48] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2022-05-15 19:11:48] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2022-05-15 19:11:48] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 1 ms to minimize.
[2022-05-15 19:11:49] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 1 ms to minimize.
[2022-05-15 19:11:49] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 0 ms to minimize.
[2022-05-15 19:11:49] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 1 ms to minimize.
[2022-05-15 19:11:49] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2022-05-15 19:11:49] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 0 ms to minimize.
[2022-05-15 19:11:50] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 0 ms to minimize.
[2022-05-15 19:11:50] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2022-05-15 19:11:50] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 1 ms to minimize.
[2022-05-15 19:11:50] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2022-05-15 19:11:50] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2022-05-15 19:11:50] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:11:50] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:11:50] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2022-05-15 19:11:50] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:11:51] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:11:51] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 4 ms to minimize.
[2022-05-15 19:11:51] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:11:51] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:11:51] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:11:51] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:11:51] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:11:51] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:11:51] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2022-05-15 19:11:51] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 0 ms to minimize.
[2022-05-15 19:11:51] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3553 ms
[2022-05-15 19:11:51] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 53 ms.
[2022-05-15 19:11:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 19:11:53] [INFO ] [Real]Absence check using 78 positive place invariants in 35 ms returned sat
[2022-05-15 19:11:53] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 12 ms returned sat
[2022-05-15 19:11:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:11:53] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2022-05-15 19:11:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:11:53] [INFO ] [Nat]Absence check using 78 positive place invariants in 27 ms returned sat
[2022-05-15 19:11:53] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2022-05-15 19:11:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:11:53] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2022-05-15 19:11:53] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2022-05-15 19:11:54] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 1 ms to minimize.
[2022-05-15 19:11:54] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 2 ms to minimize.
[2022-05-15 19:11:54] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 3 ms to minimize.
[2022-05-15 19:11:54] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 1 ms to minimize.
[2022-05-15 19:11:54] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 0 ms to minimize.
[2022-05-15 19:11:55] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 0 ms to minimize.
[2022-05-15 19:11:55] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 1 ms to minimize.
[2022-05-15 19:11:55] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2022-05-15 19:11:55] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 1 ms to minimize.
[2022-05-15 19:11:55] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 0 ms to minimize.
[2022-05-15 19:11:55] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2022-05-15 19:11:56] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 0 ms to minimize.
[2022-05-15 19:11:56] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 0 ms to minimize.
[2022-05-15 19:11:56] [INFO ] Deduced a trap composed of 154 places in 168 ms of which 1 ms to minimize.
[2022-05-15 19:11:56] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 0 ms to minimize.
[2022-05-15 19:11:56] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 1 ms to minimize.
[2022-05-15 19:11:57] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2022-05-15 19:11:57] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 0 ms to minimize.
[2022-05-15 19:11:57] [INFO ] Deduced a trap composed of 156 places in 157 ms of which 0 ms to minimize.
[2022-05-15 19:11:57] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 0 ms to minimize.
[2022-05-15 19:11:57] [INFO ] Deduced a trap composed of 151 places in 139 ms of which 0 ms to minimize.
[2022-05-15 19:11:57] [INFO ] Deduced a trap composed of 149 places in 146 ms of which 1 ms to minimize.
[2022-05-15 19:11:58] [INFO ] Deduced a trap composed of 151 places in 143 ms of which 0 ms to minimize.
[2022-05-15 19:11:58] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:11:58] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:11:58] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2022-05-15 19:11:58] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 19:11:58] [INFO ] [Real]Absence check using 78 positive place invariants in 26 ms returned sat
[2022-05-15 19:11:58] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2022-05-15 19:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:11:58] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-05-15 19:11:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:11:58] [INFO ] [Nat]Absence check using 78 positive place invariants in 27 ms returned sat
[2022-05-15 19:11:58] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2022-05-15 19:11:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:11:59] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2022-05-15 19:11:59] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 0 ms to minimize.
[2022-05-15 19:11:59] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 0 ms to minimize.
[2022-05-15 19:11:59] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 0 ms to minimize.
[2022-05-15 19:11:59] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 1 ms to minimize.
[2022-05-15 19:12:00] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 0 ms to minimize.
[2022-05-15 19:12:00] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 1 ms to minimize.
[2022-05-15 19:12:00] [INFO ] Deduced a trap composed of 165 places in 165 ms of which 1 ms to minimize.
[2022-05-15 19:12:00] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 0 ms to minimize.
[2022-05-15 19:12:00] [INFO ] Deduced a trap composed of 166 places in 174 ms of which 1 ms to minimize.
[2022-05-15 19:12:01] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 1 ms to minimize.
[2022-05-15 19:12:01] [INFO ] Deduced a trap composed of 63 places in 159 ms of which 0 ms to minimize.
[2022-05-15 19:12:01] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 0 ms to minimize.
[2022-05-15 19:12:01] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 0 ms to minimize.
[2022-05-15 19:12:01] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 1 ms to minimize.
[2022-05-15 19:12:02] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 1 ms to minimize.
[2022-05-15 19:12:02] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 0 ms to minimize.
[2022-05-15 19:12:02] [INFO ] Deduced a trap composed of 163 places in 164 ms of which 1 ms to minimize.
[2022-05-15 19:12:02] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 0 ms to minimize.
[2022-05-15 19:12:02] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 0 ms to minimize.
[2022-05-15 19:12:02] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 0 ms to minimize.
[2022-05-15 19:12:03] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 1 ms to minimize.
[2022-05-15 19:12:03] [INFO ] Deduced a trap composed of 157 places in 155 ms of which 1 ms to minimize.
[2022-05-15 19:12:03] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 1 ms to minimize.
[2022-05-15 19:12:03] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 1 ms to minimize.
[2022-05-15 19:12:03] [INFO ] Deduced a trap composed of 165 places in 168 ms of which 1 ms to minimize.
[2022-05-15 19:12:03] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 719 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 408 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 686 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.7 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 167 place count 686 transition count 452
Reduce places removed 165 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 166 rules applied. Total rules applied 333 place count 521 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 334 place count 520 transition count 451
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 334 place count 520 transition count 347
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 564 place count 394 transition count 347
Discarding 88 places :
Symmetric choice reduction at 3 with 88 rule applications. Total rules 652 place count 306 transition count 259
Iterating global reduction 3 with 88 rules applied. Total rules applied 740 place count 306 transition count 259
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 740 place count 306 transition count 251
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 758 place count 296 transition count 251
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 972 place count 188 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 976 place count 186 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 978 place count 186 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 980 place count 184 transition count 150
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 981 place count 184 transition count 150
Applied a total of 981 rules in 177 ms. Remains 184 /719 variables (removed 535) and now considering 150/638 (removed 488) transitions.
Finished structural reductions, in 1 iterations. Remains : 184/719 places, 150/638 transitions.
Normalized transition count is 149 out of 150 initially.
// Phase 1: matrix 149 rows 184 cols
[2022-05-15 19:12:04] [INFO ] Computed 81 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 52652 resets, run finished after 3480 ms. (steps per millisecond=287 ) properties (out of 4) seen :4
FORMULA BusinessProcesses-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 31828 ms.
BK_STOP 1652641927742
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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-20"
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-20, 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 r024-tall-165251918600477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 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 '
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 ;