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-162038143800355.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-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.1K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:14 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 85K 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-05-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620543003880

Running Version 0
[2021-05-09 06:50:05] [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 06:50:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:50:05] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-09 06:50:05] [INFO ] Transformed 368 places.
[2021-05-09 06:50:05] [INFO ] Transformed 319 transitions.
[2021-05-09 06:50:05] [INFO ] Found NUPN structural information;
[2021-05-09 06:50:05] [INFO ] Parsed PT model containing 368 places and 319 transitions in 101 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
// Phase 1: matrix 318 rows 367 cols
[2021-05-09 06:50:05] [INFO ] Computed 57 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 92 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :10
FORMULA BusinessProcesses-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :2
FORMULA BusinessProcesses-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 318 rows 367 cols
[2021-05-09 06:50:05] [INFO ] Computed 57 place invariants in 6 ms
[2021-05-09 06:50:06] [INFO ] [Real]Absence check using 41 positive place invariants in 18 ms returned sat
[2021-05-09 06:50:06] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-09 06:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:06] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-09 06:50:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:50:06] [INFO ] [Nat]Absence check using 41 positive place invariants in 29 ms returned sat
[2021-05-09 06:50:06] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-09 06:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:06] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-09 06:50:07] [INFO ] Deduced a trap composed of 9 places in 338 ms of which 9 ms to minimize.
[2021-05-09 06:50:07] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 14 ms to minimize.
[2021-05-09 06:50:07] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2021-05-09 06:50:07] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 2 ms to minimize.
[2021-05-09 06:50:07] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 1 ms to minimize.
[2021-05-09 06:50:08] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 0 ms to minimize.
[2021-05-09 06:50:08] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 1 ms to minimize.
[2021-05-09 06:50:08] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2021-05-09 06:50:08] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 0 ms to minimize.
[2021-05-09 06:50:08] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2021-05-09 06:50:08] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2021-05-09 06:50:08] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2021-05-09 06:50:08] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 1 ms to minimize.
[2021-05-09 06:50:08] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2021-05-09 06:50:09] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2021-05-09 06:50:09] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 0 ms to minimize.
[2021-05-09 06:50:11] [INFO ] Deduced a trap composed of 15 places in 2268 ms of which 0 ms to minimize.
[2021-05-09 06:50:11] [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 06:50:11] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned sat
[2021-05-09 06:50:11] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-09 06:50:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:11] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-09 06:50:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:50:11] [INFO ] [Nat]Absence check using 41 positive place invariants in 18 ms returned sat
[2021-05-09 06:50:11] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-09 06:50:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:12] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2021-05-09 06:50:12] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 0 ms to minimize.
[2021-05-09 06:50:12] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2021-05-09 06:50:12] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2021-05-09 06:50:12] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2021-05-09 06:50:12] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 0 ms to minimize.
[2021-05-09 06:50:12] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2021-05-09 06:50:12] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2021-05-09 06:50:12] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:50:12] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:50:12] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2021-05-09 06:50:13] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2021-05-09 06:50:13] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2021-05-09 06:50:13] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2021-05-09 06:50:13] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2021-05-09 06:50:13] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2021-05-09 06:50:13] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:50:13] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2021-05-09 06:50:13] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 8 ms to minimize.
[2021-05-09 06:50:13] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2021-05-09 06:50:13] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2021-05-09 06:50:13] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 0 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 10 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 2 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 39 places in 26 ms of which 1 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2021-05-09 06:50:14] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 2832 ms
[2021-05-09 06:50:14] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 34 ms.
[2021-05-09 06:50:15] [INFO ] Added : 163 causal constraints over 33 iterations in 1104 ms. Result :sat
Minimization took 64 ms.
[2021-05-09 06:50:16] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned sat
[2021-05-09 06:50:16] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-09 06:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:16] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-09 06:50:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:50:16] [INFO ] [Nat]Absence check using 41 positive place invariants in 19 ms returned sat
[2021-05-09 06:50:16] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-09 06:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:16] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-09 06:50:16] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2021-05-09 06:50:16] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2021-05-09 06:50:16] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2021-05-09 06:50:17] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2021-05-09 06:50:17] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2021-05-09 06:50:17] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 2 ms to minimize.
[2021-05-09 06:50:17] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:50:17] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2021-05-09 06:50:17] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2021-05-09 06:50:17] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
[2021-05-09 06:50:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 925 ms
[2021-05-09 06:50:17] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 13 ms.
[2021-05-09 06:50:18] [INFO ] Added : 175 causal constraints over 35 iterations in 894 ms. Result :sat
Minimization took 44 ms.
[2021-05-09 06:50:18] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned sat
[2021-05-09 06:50:18] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2021-05-09 06:50:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:18] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-09 06:50:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:50:18] [INFO ] [Nat]Absence check using 41 positive place invariants in 12 ms returned sat
[2021-05-09 06:50:18] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 2 ms returned sat
[2021-05-09 06:50:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:50:18] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-09 06:50:18] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2021-05-09 06:50:19] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2021-05-09 06:50:19] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2021-05-09 06:50:19] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2021-05-09 06:50:19] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2021-05-09 06:50:19] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 1 ms to minimize.
[2021-05-09 06:50:19] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 0 ms to minimize.
[2021-05-09 06:50:19] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2021-05-09 06:50:19] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2021-05-09 06:50:19] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2021-05-09 06:50:19] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2021-05-09 06:50:20] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 1 ms to minimize.
[2021-05-09 06:50:20] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 1 ms to minimize.
[2021-05-09 06:50:20] [INFO ] Deduced a trap composed of 92 places in 68 ms of which 0 ms to minimize.
[2021-05-09 06:50:20] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2021-05-09 06:50:20] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 1 ms to minimize.
[2021-05-09 06:50:20] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 0 ms to minimize.
[2021-05-09 06:50:20] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 0 ms to minimize.
[2021-05-09 06:50:20] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 0 ms to minimize.
[2021-05-09 06:50:20] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
[2021-05-09 06:50:20] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 1 ms to minimize.
[2021-05-09 06:50:20] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 0 ms to minimize.
[2021-05-09 06:50:21] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 0 ms to minimize.
[2021-05-09 06:50:21] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2021-05-09 06:50:21] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2021-05-09 06:50:21] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2245 ms
[2021-05-09 06:50:21] [INFO ] Computed and/alt/rep : 291/355/291 causal constraints (skipped 26 transitions) in 18 ms.
[2021-05-09 06:50:21] [INFO ] Added : 216 causal constraints over 44 iterations in 796 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 20200 steps, including 112 resets, run finished after 69 ms. (steps per millisecond=292 ) properties (out of 4) seen :3 could not realise parikh vector
FORMULA BusinessProcesses-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 17800 steps, including 108 resets, run finished after 42 ms. (steps per millisecond=423 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16900 steps, including 108 resets, run finished after 41 ms. (steps per millisecond=412 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 367 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 367/367 places, 317/317 transitions.
Graph (trivial) has 233 edges and 367 vertex of which 8 / 367 are part of one of the 1 SCC in 6 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 699 edges and 360 vertex of which 357 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 356 transition count 216
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 180 place count 268 transition count 216
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 180 place count 268 transition count 167
Deduced a syphon composed of 49 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 111 rules applied. Total rules applied 291 place count 206 transition count 167
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 350 place count 147 transition count 108
Iterating global reduction 2 with 59 rules applied. Total rules applied 409 place count 147 transition count 108
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 409 place count 147 transition count 101
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 426 place count 137 transition count 101
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 538 place count 81 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 539 place count 80 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 540 place count 79 transition count 44
Applied a total of 540 rules in 118 ms. Remains 79 /367 variables (removed 288) and now considering 44/317 (removed 273) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/367 places, 44/317 transitions.
// Phase 1: matrix 44 rows 79 cols
[2021-05-09 06:50:22] [INFO ] Computed 39 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 42431 resets, run finished after 1619 ms. (steps per millisecond=617 ) properties (out of 1) seen :1
FORMULA BusinessProcesses-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620543024294

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

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