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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K 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.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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.8K 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 100K 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-07-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620543483855

Running Version 0
[2021-05-09 06:58: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:58:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:58:05] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-09 06:58:05] [INFO ] Transformed 386 places.
[2021-05-09 06:58:05] [INFO ] Transformed 360 transitions.
[2021-05-09 06:58:05] [INFO ] Found NUPN structural information;
[2021-05-09 06:58:05] [INFO ] Parsed PT model containing 386 places and 360 transitions in 101 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 360 rows 386 cols
[2021-05-09 06:58:05] [INFO ] Computed 62 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 110 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :11
FORMULA BusinessProcesses-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :1
FORMULA BusinessProcesses-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 360 rows 386 cols
[2021-05-09 06:58:05] [INFO ] Computed 62 place invariants in 15 ms
[2021-05-09 06:58:06] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned sat
[2021-05-09 06:58:06] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-09 06:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:06] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2021-05-09 06:58:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:58:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2021-05-09 06:58:06] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 10 ms returned sat
[2021-05-09 06:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:06] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-09 06:58:06] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 3 ms to minimize.
[2021-05-09 06:58:06] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2021-05-09 06:58:06] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2021-05-09 06:58:07] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 1 ms to minimize.
[2021-05-09 06:58:07] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 1 ms to minimize.
[2021-05-09 06:58:07] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 1 ms to minimize.
[2021-05-09 06:58:07] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 1 ms to minimize.
[2021-05-09 06:58:07] [INFO ] Deduced a trap composed of 105 places in 94 ms of which 1 ms to minimize.
[2021-05-09 06:58:07] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 0 ms to minimize.
[2021-05-09 06:58:07] [INFO ] Deduced a trap composed of 107 places in 79 ms of which 0 ms to minimize.
[2021-05-09 06:58:07] [INFO ] Deduced a trap composed of 91 places in 75 ms of which 0 ms to minimize.
[2021-05-09 06:58:07] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 1 ms to minimize.
[2021-05-09 06:58:07] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 0 ms to minimize.
[2021-05-09 06:58:08] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2021-05-09 06:58:08] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 1 ms to minimize.
[2021-05-09 06:58:08] [INFO ] Deduced a trap composed of 100 places in 88 ms of which 1 ms to minimize.
[2021-05-09 06:58:08] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 1 ms to minimize.
[2021-05-09 06:58:08] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 1 ms to minimize.
[2021-05-09 06:58:08] [INFO ] Deduced a trap composed of 103 places in 76 ms of which 0 ms to minimize.
[2021-05-09 06:58:08] [INFO ] Deduced a trap composed of 97 places in 75 ms of which 0 ms to minimize.
[2021-05-09 06:58:08] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 1 ms to minimize.
[2021-05-09 06:58:08] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2021-05-09 06:58:08] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2397 ms
[2021-05-09 06:58:08] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 41 ms.
[2021-05-09 06:58:09] [INFO ] Added : 144 causal constraints over 29 iterations in 787 ms. Result :sat
Minimization took 90 ms.
[2021-05-09 06:58:09] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned sat
[2021-05-09 06:58:09] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 10 ms returned sat
[2021-05-09 06:58:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:10] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-09 06:58:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:58:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2021-05-09 06:58:10] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-09 06:58:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:10] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2021-05-09 06:58:10] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 1 ms to minimize.
[2021-05-09 06:58:10] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2021-05-09 06:58:10] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 0 ms to minimize.
[2021-05-09 06:58:10] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 1 ms to minimize.
[2021-05-09 06:58:11] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 1 ms to minimize.
[2021-05-09 06:58:11] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2021-05-09 06:58:11] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 0 ms to minimize.
[2021-05-09 06:58:11] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 0 ms to minimize.
[2021-05-09 06:58:11] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 0 ms to minimize.
[2021-05-09 06:58:11] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 1 ms to minimize.
[2021-05-09 06:58:11] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 0 ms to minimize.
[2021-05-09 06:58:11] [INFO ] Deduced a trap composed of 110 places in 79 ms of which 1 ms to minimize.
[2021-05-09 06:58:11] [INFO ] Deduced a trap composed of 105 places in 82 ms of which 1 ms to minimize.
[2021-05-09 06:58:12] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 1 ms to minimize.
[2021-05-09 06:58:12] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 0 ms to minimize.
[2021-05-09 06:58:12] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 1 ms to minimize.
[2021-05-09 06:58:12] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 0 ms to minimize.
[2021-05-09 06:58:12] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 1 ms to minimize.
[2021-05-09 06:58:12] [INFO ] Deduced a trap composed of 105 places in 89 ms of which 1 ms to minimize.
[2021-05-09 06:58:12] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 0 ms to minimize.
[2021-05-09 06:58:12] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 0 ms to minimize.
[2021-05-09 06:58:12] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 1 ms to minimize.
[2021-05-09 06:58:13] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 0 ms to minimize.
[2021-05-09 06:58:13] [INFO ] Deduced a trap composed of 102 places in 80 ms of which 1 ms to minimize.
[2021-05-09 06:58:13] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 1 ms to minimize.
[2021-05-09 06:58:13] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2021-05-09 06:58:13] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 0 ms to minimize.
[2021-05-09 06:58:13] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2021-05-09 06:58:13] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2021-05-09 06:58:14] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 0 ms to minimize.
[2021-05-09 06:58:14] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 0 ms to minimize.
[2021-05-09 06:58:14] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 0 ms to minimize.
[2021-05-09 06:58:14] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 0 ms to minimize.
[2021-05-09 06:58:14] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 0 ms to minimize.
[2021-05-09 06:58:14] [INFO ] Deduced a trap composed of 103 places in 94 ms of which 1 ms to minimize.
[2021-05-09 06:58:14] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 1 ms to minimize.
[2021-05-09 06:58:14] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2021-05-09 06:58:15] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 1 ms to minimize.
[2021-05-09 06:58:15] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 1 ms to minimize.
[2021-05-09 06:58:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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:58:15] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2021-05-09 06:58:15] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-09 06:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:15] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-09 06:58:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:58:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2021-05-09 06:58:15] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-09 06:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:15] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-09 06:58:15] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2021-05-09 06:58:15] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
[2021-05-09 06:58:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2021-05-09 06:58:15] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 26 ms.
[2021-05-09 06:58:16] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 1 ms to minimize.
[2021-05-09 06:58:17] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2021-05-09 06:58:17] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 0 ms to minimize.
[2021-05-09 06:58:17] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 0 ms to minimize.
[2021-05-09 06:58:17] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2021-05-09 06:58:17] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 1 ms to minimize.
[2021-05-09 06:58:17] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 1 ms to minimize.
[2021-05-09 06:58:18] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 1 ms to minimize.
[2021-05-09 06:58:18] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 0 ms to minimize.
[2021-05-09 06:58:18] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 1 ms to minimize.
[2021-05-09 06:58:18] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 0 ms to minimize.
[2021-05-09 06:58:18] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 1 ms to minimize.
[2021-05-09 06:58:18] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 1 ms to minimize.
[2021-05-09 06:58:18] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 1 ms to minimize.
[2021-05-09 06:58:18] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 1 ms to minimize.
[2021-05-09 06:58:19] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 1 ms to minimize.
[2021-05-09 06:58:19] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 1 ms to minimize.
[2021-05-09 06:58:19] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 1 ms to minimize.
[2021-05-09 06:58:19] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 0 ms to minimize.
[2021-05-09 06:58:19] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 1 ms to minimize.
[2021-05-09 06:58:19] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 1 ms to minimize.
[2021-05-09 06:58:19] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 0 ms to minimize.
[2021-05-09 06:58:20] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 1 ms to minimize.
[2021-05-09 06:58:20] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 1 ms to minimize.
[2021-05-09 06:58:20] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 1 ms to minimize.
[2021-05-09 06:58:20] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2021-05-09 06:58:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 06:58:20] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2021-05-09 06:58:20] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-09 06:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:20] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-09 06:58:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:58:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2021-05-09 06:58:21] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-09 06:58:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:58:21] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-09 06:58:21] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2021-05-09 06:58:21] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 1 ms to minimize.
[2021-05-09 06:58:21] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2021-05-09 06:58:21] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2021-05-09 06:58:21] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2021-05-09 06:58:21] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2021-05-09 06:58:22] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 1 ms to minimize.
[2021-05-09 06:58:22] [INFO ] Deduced a trap composed of 104 places in 86 ms of which 1 ms to minimize.
[2021-05-09 06:58:22] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 0 ms to minimize.
[2021-05-09 06:58:22] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 0 ms to minimize.
[2021-05-09 06:58:22] [INFO ] Deduced a trap composed of 115 places in 84 ms of which 0 ms to minimize.
[2021-05-09 06:58:22] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 0 ms to minimize.
[2021-05-09 06:58:22] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 0 ms to minimize.
[2021-05-09 06:58:22] [INFO ] Deduced a trap composed of 97 places in 72 ms of which 0 ms to minimize.
[2021-05-09 06:58:22] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 0 ms to minimize.
[2021-05-09 06:58:22] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 0 ms to minimize.
[2021-05-09 06:58:22] [INFO ] Deduced a trap composed of 112 places in 93 ms of which 0 ms to minimize.
[2021-05-09 06:58:23] [INFO ] Deduced a trap composed of 101 places in 85 ms of which 0 ms to minimize.
[2021-05-09 06:58:23] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2021-05-09 06:58:23] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2021-05-09 06:58:23] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2021-05-09 06:58:23] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2021-05-09 06:58:23] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2021-05-09 06:58:23] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2021-05-09 06:58:23] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2021-05-09 06:58:23] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2021-05-09 06:58:23] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2021-05-09 06:58:23] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2021-05-09 06:58:24] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2021-05-09 06:58:24] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2021-05-09 06:58:24] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2021-05-09 06:58:24] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2021-05-09 06:58:24] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2021-05-09 06:58:24] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:58:24] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:58:24] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 3342 ms
[2021-05-09 06:58:24] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 29 ms.
[2021-05-09 06:58:25] [INFO ] Added : 177 causal constraints over 36 iterations in 917 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 9500 steps, including 125 resets, run finished after 31 ms. (steps per millisecond=306 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA BusinessProcesses-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 8800 steps, including 100 resets, run finished after 23 ms. (steps per millisecond=382 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 386 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 386/386 places, 359/359 transitions.
Graph (trivial) has 216 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 803 edges and 380 vertex of which 376 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 375 transition count 267
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 165 place count 294 transition count 267
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 165 place count 294 transition count 210
Deduced a syphon composed of 57 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 288 place count 228 transition count 210
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 333 place count 183 transition count 165
Iterating global reduction 2 with 45 rules applied. Total rules applied 378 place count 183 transition count 165
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 378 place count 183 transition count 159
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 391 place count 176 transition count 159
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 509 place count 116 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 511 place count 115 transition count 104
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 513 place count 115 transition count 102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 515 place count 113 transition count 102
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 516 place count 113 transition count 102
Applied a total of 516 rules in 99 ms. Remains 113 /386 variables (removed 273) and now considering 102/359 (removed 257) transitions.
Finished structural reductions, in 1 iterations. Remains : 113/386 places, 102/359 transitions.
// Phase 1: matrix 102 rows 113 cols
[2021-05-09 06:58:25] [INFO ] Computed 48 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 73693 resets, run finished after 2484 ms. (steps per millisecond=402 ) properties (out of 1) seen :1
FORMULA BusinessProcesses-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620543508472

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

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