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

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

=== Now, execution of the tool begins

BK_START 1620544714446

Running Version 0
[2021-05-09 07:18:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:18:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:18:36] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2021-05-09 07:18:36] [INFO ] Transformed 518 places.
[2021-05-09 07:18:36] [INFO ] Transformed 471 transitions.
[2021-05-09 07:18:36] [INFO ] Found NUPN structural information;
[2021-05-09 07:18:36] [INFO ] Parsed PT model containing 518 places and 471 transitions in 124 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 471 rows 518 cols
[2021-05-09 07:18:36] [INFO ] Computed 85 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 79 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :4
FORMULA BusinessProcesses-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_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 10001 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
// Phase 1: matrix 471 rows 518 cols
[2021-05-09 07:18:36] [INFO ] Computed 85 place invariants in 23 ms
[2021-05-09 07:18:36] [INFO ] [Real]Absence check using 48 positive place invariants in 20 ms returned sat
[2021-05-09 07:18:36] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 9 ms returned sat
[2021-05-09 07:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:18:37] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-09 07:18:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:18:37] [INFO ] [Nat]Absence check using 48 positive place invariants in 16 ms returned sat
[2021-05-09 07:18:37] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 7 ms returned sat
[2021-05-09 07:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:18:37] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-09 07:18:37] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 5 ms to minimize.
[2021-05-09 07:18:38] [INFO ] Deduced a trap composed of 116 places in 288 ms of which 1 ms to minimize.
[2021-05-09 07:18:38] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2021-05-09 07:18:38] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 1 ms to minimize.
[2021-05-09 07:18:38] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:18:38] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:18:38] [INFO ] Deduced a trap composed of 119 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:18:39] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:18:39] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:18:39] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2021-05-09 07:18:39] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 1 ms to minimize.
[2021-05-09 07:18:39] [INFO ] Deduced a trap composed of 114 places in 161 ms of which 1 ms to minimize.
[2021-05-09 07:18:40] [INFO ] Deduced a trap composed of 121 places in 138 ms of which 1 ms to minimize.
[2021-05-09 07:18:40] [INFO ] Deduced a trap composed of 116 places in 202 ms of which 1 ms to minimize.
[2021-05-09 07:18:40] [INFO ] Deduced a trap composed of 116 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:18:40] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 0 ms to minimize.
[2021-05-09 07:18:40] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:18:41] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 1 ms to minimize.
[2021-05-09 07:18:41] [INFO ] Deduced a trap composed of 121 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:18:41] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:18:41] [INFO ] Deduced a trap composed of 116 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:18:41] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:18:41] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2021-05-09 07:18:42] [INFO ] Deduced a trap composed of 121 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:18:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:18:42] [INFO ] [Real]Absence check using 48 positive place invariants in 26 ms returned sat
[2021-05-09 07:18:42] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 12 ms returned sat
[2021-05-09 07:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:18:42] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-09 07:18:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:18:42] [INFO ] [Nat]Absence check using 48 positive place invariants in 19 ms returned sat
[2021-05-09 07:18:42] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2021-05-09 07:18:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:18:42] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2021-05-09 07:18:42] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 0 ms to minimize.
[2021-05-09 07:18:43] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:18:43] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 1 ms to minimize.
[2021-05-09 07:18:43] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 0 ms to minimize.
[2021-05-09 07:18:43] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:18:43] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:18:44] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 0 ms to minimize.
[2021-05-09 07:18:44] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:18:44] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:18:44] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2021-05-09 07:18:44] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 4 ms to minimize.
[2021-05-09 07:18:44] [INFO ] Deduced a trap composed of 133 places in 196 ms of which 1 ms to minimize.
[2021-05-09 07:18:45] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 1 ms to minimize.
[2021-05-09 07:18:45] [INFO ] Deduced a trap composed of 118 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:18:45] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:18:45] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2021-05-09 07:18:45] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:18:45] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 1 ms to minimize.
[2021-05-09 07:18:45] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:18:46] [INFO ] Deduced a trap composed of 106 places in 202 ms of which 0 ms to minimize.
[2021-05-09 07:18:46] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 0 ms to minimize.
[2021-05-09 07:18:46] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 0 ms to minimize.
[2021-05-09 07:18:46] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 1 ms to minimize.
[2021-05-09 07:18:46] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:18:47] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 1 ms to minimize.
[2021-05-09 07:18:47] [INFO ] Deduced a trap composed of 121 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:18:47] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:18:47] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:18:47] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:18: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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:18:47] [INFO ] [Real]Absence check using 48 positive place invariants in 18 ms returned sat
[2021-05-09 07:18:47] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 11 ms returned sat
[2021-05-09 07:18:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:18:47] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2021-05-09 07:18:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:18:47] [INFO ] [Nat]Absence check using 48 positive place invariants in 19 ms returned sat
[2021-05-09 07:18:47] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2021-05-09 07:18:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:18:48] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-09 07:18:48] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:18:48] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 0 ms to minimize.
[2021-05-09 07:18:48] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:18:48] [INFO ] Deduced a trap composed of 115 places in 153 ms of which 8 ms to minimize.
[2021-05-09 07:18:48] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2021-05-09 07:18:49] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:18:49] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:18:49] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:18:49] [INFO ] Deduced a trap composed of 117 places in 140 ms of which 0 ms to minimize.
[2021-05-09 07:18:49] [INFO ] Deduced a trap composed of 119 places in 155 ms of which 1 ms to minimize.
[2021-05-09 07:18:49] [INFO ] Deduced a trap composed of 117 places in 144 ms of which 0 ms to minimize.
[2021-05-09 07:18:50] [INFO ] Deduced a trap composed of 122 places in 172 ms of which 0 ms to minimize.
[2021-05-09 07:18:50] [INFO ] Deduced a trap composed of 127 places in 140 ms of which 2 ms to minimize.
[2021-05-09 07:18:50] [INFO ] Deduced a trap composed of 132 places in 179 ms of which 1 ms to minimize.
[2021-05-09 07:18:50] [INFO ] Deduced a trap composed of 136 places in 158 ms of which 2 ms to minimize.
[2021-05-09 07:18:50] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:18:50] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:18:51] [INFO ] Deduced a trap composed of 121 places in 174 ms of which 1 ms to minimize.
[2021-05-09 07:18:51] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 0 ms to minimize.
[2021-05-09 07:18:51] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 0 ms to minimize.
[2021-05-09 07:18:51] [INFO ] Deduced a trap composed of 121 places in 176 ms of which 2 ms to minimize.
[2021-05-09 07:18:51] [INFO ] Deduced a trap composed of 126 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:18:51] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:18:52] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:18:52] [INFO ] Deduced a trap composed of 120 places in 133 ms of which 0 ms to minimize.
[2021-05-09 07:18:52] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:18:52] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:18:52] [INFO ] Deduced a trap composed of 110 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:18:52] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:18:53] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 0 ms to minimize.
[2021-05-09 07:18:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:18:53] [INFO ] [Real]Absence check using 48 positive place invariants in 20 ms returned sat
[2021-05-09 07:18:53] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 12 ms returned sat
[2021-05-09 07:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:18:53] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2021-05-09 07:18:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:18:53] [INFO ] [Nat]Absence check using 48 positive place invariants in 20 ms returned sat
[2021-05-09 07:18:53] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 11 ms returned sat
[2021-05-09 07:18:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:18:53] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-09 07:18:53] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 0 ms to minimize.
[2021-05-09 07:18:54] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2021-05-09 07:18:54] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 0 ms to minimize.
[2021-05-09 07:18:54] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 1 ms to minimize.
[2021-05-09 07:18:54] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:18:54] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 1 ms to minimize.
[2021-05-09 07:18:54] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 1 ms to minimize.
[2021-05-09 07:18:55] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 0 ms to minimize.
[2021-05-09 07:18:55] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:18:55] [INFO ] Deduced a trap composed of 116 places in 185 ms of which 1 ms to minimize.
[2021-05-09 07:18:55] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 0 ms to minimize.
[2021-05-09 07:18:55] [INFO ] Deduced a trap composed of 115 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:18:56] [INFO ] Deduced a trap composed of 115 places in 177 ms of which 1 ms to minimize.
[2021-05-09 07:18:56] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 0 ms to minimize.
[2021-05-09 07:18:56] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:18:56] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 0 ms to minimize.
[2021-05-09 07:18:56] [INFO ] Deduced a trap composed of 121 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:18:56] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:18:57] [INFO ] Deduced a trap composed of 117 places in 134 ms of which 0 ms to minimize.
[2021-05-09 07:18:57] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:18:57] [INFO ] Deduced a trap composed of 115 places in 174 ms of which 1 ms to minimize.
[2021-05-09 07:18:57] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:18:57] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 0 ms to minimize.
[2021-05-09 07:18:57] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 0 ms to minimize.
[2021-05-09 07:18:58] [INFO ] Deduced a trap composed of 111 places in 171 ms of which 1 ms to minimize.
[2021-05-09 07:18:58] [INFO ] Deduced a trap composed of 110 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:18:58] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2021-05-09 07:18: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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:18:58] [INFO ] [Real]Absence check using 48 positive place invariants in 20 ms returned sat
[2021-05-09 07:18:58] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 21 ms returned sat
[2021-05-09 07:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:18:58] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-09 07:18:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:18:59] [INFO ] [Nat]Absence check using 48 positive place invariants in 19 ms returned sat
[2021-05-09 07:18:59] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2021-05-09 07:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:18:59] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2021-05-09 07:18:59] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:18:59] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 0 ms to minimize.
[2021-05-09 07:18:59] [INFO ] Deduced a trap composed of 108 places in 144 ms of which 0 ms to minimize.
[2021-05-09 07:18:59] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 0 ms to minimize.
[2021-05-09 07:19:00] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:19:00] [INFO ] Deduced a trap composed of 130 places in 178 ms of which 1 ms to minimize.
[2021-05-09 07:19:00] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 0 ms to minimize.
[2021-05-09 07:19:00] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 0 ms to minimize.
[2021-05-09 07:19:00] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 0 ms to minimize.
[2021-05-09 07:19:01] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:19:01] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:19:01] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:19:01] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:19:01] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:19:01] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:19:02] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2021-05-09 07:19:02] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:19:02] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:19:02] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:19:02] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2021-05-09 07:19:02] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3057 ms
[2021-05-09 07:19:02] [INFO ] Computed and/alt/rep : 442/759/442 causal constraints (skipped 28 transitions) in 64 ms.
[2021-05-09 07:19: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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:19:04] [INFO ] [Real]Absence check using 48 positive place invariants in 21 ms returned sat
[2021-05-09 07:19:04] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 11 ms returned sat
[2021-05-09 07:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:04] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2021-05-09 07:19:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:19:04] [INFO ] [Nat]Absence check using 48 positive place invariants in 22 ms returned sat
[2021-05-09 07:19:04] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 11 ms returned sat
[2021-05-09 07:19:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:19:04] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2021-05-09 07:19:04] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 0 ms to minimize.
[2021-05-09 07:19:04] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:19:05] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:19:05] [INFO ] Deduced a trap composed of 116 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:19:05] [INFO ] Deduced a trap composed of 116 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:19:05] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:19:05] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 0 ms to minimize.
[2021-05-09 07:19:05] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:19:06] [INFO ] Deduced a trap composed of 125 places in 153 ms of which 0 ms to minimize.
[2021-05-09 07:19:06] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:19:06] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 0 ms to minimize.
[2021-05-09 07:19:06] [INFO ] Deduced a trap composed of 117 places in 158 ms of which 1 ms to minimize.
[2021-05-09 07:19:06] [INFO ] Deduced a trap composed of 124 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:19:06] [INFO ] Deduced a trap composed of 121 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:19:06] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:19:07] [INFO ] Deduced a trap composed of 116 places in 151 ms of which 1 ms to minimize.
[2021-05-09 07:19:07] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:19:07] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:19:07] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:19:07] [INFO ] Deduced a trap composed of 118 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:19:07] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 1 ms to minimize.
[2021-05-09 07:19:08] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:19:08] [INFO ] Deduced a trap composed of 127 places in 142 ms of which 0 ms to minimize.
[2021-05-09 07:19:08] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:19:08] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 1 ms to minimize.
[2021-05-09 07:19:08] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:19:08] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:19:08] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:19:09] [INFO ] Deduced a trap composed of 140 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:19:09] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:19:09] [INFO ] Deduced a trap composed of 139 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:19:09] [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 5
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 291 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 11 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 111 place count 510 transition count 353
Reduce places removed 109 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 112 rules applied. Total rules applied 223 place count 401 transition count 350
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 226 place count 398 transition count 350
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 226 place count 398 transition count 273
Deduced a syphon composed of 77 places in 9 ms
Ensure Unique test removed 12 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 392 place count 309 transition count 273
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 457 place count 244 transition count 208
Iterating global reduction 3 with 65 rules applied. Total rules applied 522 place count 244 transition count 208
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 522 place count 244 transition count 201
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 537 place count 236 transition count 201
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 161 rules applied. Total rules applied 698 place count 154 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 700 place count 153 transition count 125
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 702 place count 153 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 704 place count 151 transition count 123
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 705 place count 151 transition count 123
Applied a total of 705 rules in 157 ms. Remains 151 /518 variables (removed 367) and now considering 123/471 (removed 348) transitions.
Finished structural reductions, in 1 iterations. Remains : 151/518 places, 123/471 transitions.
// Phase 1: matrix 123 rows 151 cols
[2021-05-09 07:19:09] [INFO ] Computed 68 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 46384 resets, run finished after 3304 ms. (steps per millisecond=302 ) properties (out of 6) seen :6
FORMULA BusinessProcesses-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620544752993

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

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