Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 159K Mar 5 18:22 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-16-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678363891666

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 12:11:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 12:11:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:11:33] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-09 12:11:33] [INFO ] Transformed 638 places.
[2023-03-09 12:11:33] [INFO ] Transformed 578 transitions.
[2023-03-09 12:11:33] [INFO ] Found NUPN structural information;
[2023-03-09 12:11:33] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
// Phase 1: matrix 570 rows 630 cols
[2023-03-09 12:11:33] [INFO ] Computed 100 place invariants in 38 ms
Incomplete random walk after 10000 steps, including 65 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :8
FORMULA BusinessProcesses-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
[2023-03-09 12:11:33] [INFO ] Invariant cache hit.
[2023-03-09 12:11:33] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2023-03-09 12:11:33] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 24 ms returned sat
[2023-03-09 12:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:11:34] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2023-03-09 12:11:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:11:34] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2023-03-09 12:11:34] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-09 12:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:11:34] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2023-03-09 12:11:34] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 4 ms to minimize.
[2023-03-09 12:11:34] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2023-03-09 12:11:34] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2023-03-09 12:11:34] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2023-03-09 12:11:35] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2023-03-09 12:11:35] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2023-03-09 12:11:35] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 0 ms to minimize.
[2023-03-09 12:11:35] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2023-03-09 12:11:35] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2023-03-09 12:11:35] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2023-03-09 12:11:35] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 0 ms to minimize.
[2023-03-09 12:11:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1225 ms
[2023-03-09 12:11:35] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 47 ms.
[2023-03-09 12:11:38] [INFO ] Added : 363 causal constraints over 73 iterations in 2950 ms. Result :sat
Minimization took 264 ms.
[2023-03-09 12:11:39] [INFO ] [Real]Absence check using 62 positive place invariants in 19 ms returned sat
[2023-03-09 12:11:39] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-09 12:11:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:11:39] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-09 12:11:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:11:39] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2023-03-09 12:11:39] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-09 12:11:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:11:39] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-03-09 12:11:39] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2023-03-09 12:11:39] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2023-03-09 12:11:40] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2023-03-09 12:11:40] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2023-03-09 12:11:40] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2023-03-09 12:11:40] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2023-03-09 12:11:40] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2023-03-09 12:11:40] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 1 ms to minimize.
[2023-03-09 12:11:41] [INFO ] Deduced a trap composed of 139 places in 179 ms of which 1 ms to minimize.
[2023-03-09 12:11:41] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2023-03-09 12:11:41] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2023-03-09 12:11:41] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2023-03-09 12:11:41] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 1 ms to minimize.
[2023-03-09 12:11:41] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2023-03-09 12:11:42] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 1 ms to minimize.
[2023-03-09 12:11:42] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 0 ms to minimize.
[2023-03-09 12:11:42] [INFO ] Deduced a trap composed of 156 places in 128 ms of which 1 ms to minimize.
[2023-03-09 12:11:42] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2023-03-09 12:11:42] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2864 ms
[2023-03-09 12:11:42] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 29 ms.
[2023-03-09 12:11:44] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 0 ms to minimize.
[2023-03-09 12:11:44] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 12:11:44] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2023-03-09 12:11:44] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2023-03-09 12:11:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:11:44] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2023-03-09 12:11:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:11:45] [INFO ] [Nat]Absence check using 62 positive place invariants in 19 ms returned sat
[2023-03-09 12:11:45] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 10 ms returned sat
[2023-03-09 12:11:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:11:45] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2023-03-09 12:11:45] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2023-03-09 12:11:45] [INFO ] Deduced a trap composed of 123 places in 123 ms of which 1 ms to minimize.
[2023-03-09 12:11:45] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2023-03-09 12:11:45] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2023-03-09 12:11:46] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2023-03-09 12:11:46] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 0 ms to minimize.
[2023-03-09 12:11:46] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2023-03-09 12:11:46] [INFO ] Deduced a trap composed of 143 places in 129 ms of which 0 ms to minimize.
[2023-03-09 12:11:46] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 0 ms to minimize.
[2023-03-09 12:11:46] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 1 ms to minimize.
[2023-03-09 12:11:47] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2023-03-09 12:11:47] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 0 ms to minimize.
[2023-03-09 12:11:47] [INFO ] Deduced a trap composed of 146 places in 118 ms of which 0 ms to minimize.
[2023-03-09 12:11:47] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2023-03-09 12:11:47] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 0 ms to minimize.
[2023-03-09 12:11:47] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 0 ms to minimize.
[2023-03-09 12:11:47] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 1 ms to minimize.
[2023-03-09 12:11:48] [INFO ] Deduced a trap composed of 148 places in 118 ms of which 0 ms to minimize.
[2023-03-09 12:11:48] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 0 ms to minimize.
[2023-03-09 12:11:48] [INFO ] Deduced a trap composed of 136 places in 116 ms of which 1 ms to minimize.
[2023-03-09 12:11:48] [INFO ] Deduced a trap composed of 139 places in 121 ms of which 1 ms to minimize.
[2023-03-09 12:11:48] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2023-03-09 12:11:48] [INFO ] Deduced a trap composed of 140 places in 123 ms of which 1 ms to minimize.
[2023-03-09 12:11:48] [INFO ] Deduced a trap composed of 141 places in 116 ms of which 0 ms to minimize.
[2023-03-09 12:11:48] [INFO ] Deduced a trap composed of 147 places in 111 ms of which 1 ms to minimize.
[2023-03-09 12:11:49] [INFO ] Deduced a trap composed of 138 places in 106 ms of which 1 ms to minimize.
[2023-03-09 12:11:49] [INFO ] Deduced a trap composed of 138 places in 121 ms of which 4 ms to minimize.
[2023-03-09 12:11:49] [INFO ] Deduced a trap composed of 135 places in 111 ms of which 1 ms to minimize.
[2023-03-09 12:11:49] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 0 ms to minimize.
[2023-03-09 12:11:49] [INFO ] Deduced a trap composed of 147 places in 110 ms of which 1 ms to minimize.
[2023-03-09 12:11:49] [INFO ] Deduced a trap composed of 149 places in 110 ms of which 0 ms to minimize.
[2023-03-09 12:11:49] [INFO ] Deduced a trap composed of 136 places in 107 ms of which 0 ms to minimize.
[2023-03-09 12:11:50] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2023-03-09 12:11:50] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 1 ms to minimize.
[2023-03-09 12:11:50] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 12:11:50] [INFO ] [Real]Absence check using 62 positive place invariants in 17 ms returned sat
[2023-03-09 12:11:50] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-09 12:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:11:50] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2023-03-09 12:11:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:11:50] [INFO ] [Nat]Absence check using 62 positive place invariants in 20 ms returned sat
[2023-03-09 12:11:50] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 10 ms returned sat
[2023-03-09 12:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:11:50] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2023-03-09 12:11:50] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 0 ms to minimize.
[2023-03-09 12:11:51] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2023-03-09 12:11:51] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 1 ms to minimize.
[2023-03-09 12:11:51] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 2 ms to minimize.
[2023-03-09 12:11:51] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2023-03-09 12:11:51] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2023-03-09 12:11:51] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 0 ms to minimize.
[2023-03-09 12:11:52] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-09 12:11:52] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 0 ms to minimize.
[2023-03-09 12:11:52] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 0 ms to minimize.
[2023-03-09 12:11:52] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 0 ms to minimize.
[2023-03-09 12:11:52] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2023-03-09 12:11:52] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 1 ms to minimize.
[2023-03-09 12:11:53] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2023-03-09 12:11:53] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2023-03-09 12:11:53] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-03-09 12:11:53] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 7 ms to minimize.
[2023-03-09 12:11:53] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2023-03-09 12:11:53] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2023-03-09 12:11:53] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2023-03-09 12:11:53] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2724 ms
[2023-03-09 12:11:53] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 26 ms.
[2023-03-09 12:11:55] [INFO ] Added : 340 causal constraints over 68 iterations in 1979 ms. Result :unknown
[2023-03-09 12:11:55] [INFO ] [Real]Absence check using 62 positive place invariants in 18 ms returned sat
[2023-03-09 12:11:55] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 16 ms returned sat
[2023-03-09 12:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:11:55] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2023-03-09 12:11:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:11:55] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2023-03-09 12:11:55] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 9 ms returned sat
[2023-03-09 12:11:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:11:56] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-09 12:11:56] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2023-03-09 12:11:56] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2023-03-09 12:11:56] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 1 ms to minimize.
[2023-03-09 12:11:56] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 0 ms to minimize.
[2023-03-09 12:11:56] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2023-03-09 12:11:57] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 0 ms to minimize.
[2023-03-09 12:11:57] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 0 ms to minimize.
[2023-03-09 12:11:57] [INFO ] Deduced a trap composed of 138 places in 127 ms of which 0 ms to minimize.
[2023-03-09 12:11:57] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 1 ms to minimize.
[2023-03-09 12:11:57] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2023-03-09 12:11:57] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 0 ms to minimize.
[2023-03-09 12:11:57] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 0 ms to minimize.
[2023-03-09 12:11:58] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 1 ms to minimize.
[2023-03-09 12:11:58] [INFO ] Deduced a trap composed of 163 places in 122 ms of which 1 ms to minimize.
[2023-03-09 12:11:58] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 0 ms to minimize.
[2023-03-09 12:11:58] [INFO ] Deduced a trap composed of 158 places in 145 ms of which 1 ms to minimize.
[2023-03-09 12:11:58] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2023-03-09 12:11:58] [INFO ] Deduced a trap composed of 145 places in 134 ms of which 0 ms to minimize.
[2023-03-09 12:11:58] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 0 ms to minimize.
[2023-03-09 12:11:59] [INFO ] Deduced a trap composed of 144 places in 122 ms of which 1 ms to minimize.
[2023-03-09 12:11:59] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2896 ms
[2023-03-09 12:11:59] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 31 ms.
[2023-03-09 12:12:01] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2023-03-09 12:12:01] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 12:12:01] [INFO ] [Real]Absence check using 62 positive place invariants in 23 ms returned sat
[2023-03-09 12:12:01] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2023-03-09 12:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:01] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2023-03-09 12:12:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:01] [INFO ] [Nat]Absence check using 62 positive place invariants in 19 ms returned sat
[2023-03-09 12:12:01] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 10 ms returned sat
[2023-03-09 12:12:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:01] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-09 12:12:02] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2023-03-09 12:12:02] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2023-03-09 12:12:02] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 1 ms to minimize.
[2023-03-09 12:12:02] [INFO ] Deduced a trap composed of 146 places in 127 ms of which 0 ms to minimize.
[2023-03-09 12:12:02] [INFO ] Deduced a trap composed of 146 places in 123 ms of which 0 ms to minimize.
[2023-03-09 12:12:02] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2023-03-09 12:12:02] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2023-03-09 12:12:03] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 0 ms to minimize.
[2023-03-09 12:12:03] [INFO ] Deduced a trap composed of 160 places in 113 ms of which 1 ms to minimize.
[2023-03-09 12:12:03] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2023-03-09 12:12:03] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2023-03-09 12:12:03] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2023-03-09 12:12:03] [INFO ] Deduced a trap composed of 141 places in 115 ms of which 0 ms to minimize.
[2023-03-09 12:12:03] [INFO ] Deduced a trap composed of 147 places in 114 ms of which 1 ms to minimize.
[2023-03-09 12:12:04] [INFO ] Deduced a trap composed of 138 places in 102 ms of which 1 ms to minimize.
[2023-03-09 12:12:04] [INFO ] Deduced a trap composed of 150 places in 122 ms of which 0 ms to minimize.
[2023-03-09 12:12:04] [INFO ] Deduced a trap composed of 143 places in 118 ms of which 1 ms to minimize.
[2023-03-09 12:12:04] [INFO ] Deduced a trap composed of 157 places in 113 ms of which 1 ms to minimize.
[2023-03-09 12:12:04] [INFO ] Deduced a trap composed of 144 places in 108 ms of which 0 ms to minimize.
[2023-03-09 12:12:04] [INFO ] Deduced a trap composed of 161 places in 123 ms of which 1 ms to minimize.
[2023-03-09 12:12:04] [INFO ] Deduced a trap composed of 160 places in 107 ms of which 0 ms to minimize.
[2023-03-09 12:12:04] [INFO ] Deduced a trap composed of 154 places in 116 ms of which 1 ms to minimize.
[2023-03-09 12:12:05] [INFO ] Deduced a trap composed of 148 places in 117 ms of which 0 ms to minimize.
[2023-03-09 12:12:05] [INFO ] Deduced a trap composed of 149 places in 118 ms of which 1 ms to minimize.
[2023-03-09 12:12:05] [INFO ] Deduced a trap composed of 155 places in 111 ms of which 1 ms to minimize.
[2023-03-09 12:12:05] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 1 ms to minimize.
[2023-03-09 12:12:05] [INFO ] Deduced a trap composed of 149 places in 111 ms of which 0 ms to minimize.
[2023-03-09 12:12:05] [INFO ] Deduced a trap composed of 155 places in 134 ms of which 0 ms to minimize.
[2023-03-09 12:12:05] [INFO ] Deduced a trap composed of 145 places in 130 ms of which 0 ms to minimize.
[2023-03-09 12:12:06] [INFO ] Deduced a trap composed of 142 places in 133 ms of which 0 ms to minimize.
[2023-03-09 12:12:06] [INFO ] Deduced a trap composed of 153 places in 133 ms of which 1 ms to minimize.
[2023-03-09 12:12:06] [INFO ] Deduced a trap composed of 142 places in 129 ms of which 0 ms to minimize.
[2023-03-09 12:12:06] [INFO ] Deduced a trap composed of 145 places in 123 ms of which 1 ms to minimize.
[2023-03-09 12:12:06] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 12:12:06] [INFO ] [Real]Absence check using 62 positive place invariants in 18 ms returned sat
[2023-03-09 12:12:06] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-09 12:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:06] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2023-03-09 12:12:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:07] [INFO ] [Nat]Absence check using 62 positive place invariants in 21 ms returned sat
[2023-03-09 12:12:07] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-09 12:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:07] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2023-03-09 12:12:07] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2023-03-09 12:12:07] [INFO ] Deduced a trap composed of 147 places in 189 ms of which 0 ms to minimize.
[2023-03-09 12:12:07] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2023-03-09 12:12:08] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-03-09 12:12:08] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 2 ms to minimize.
[2023-03-09 12:12:08] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 1 ms to minimize.
[2023-03-09 12:12:08] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 0 ms to minimize.
[2023-03-09 12:12:08] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 1 ms to minimize.
[2023-03-09 12:12:08] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 1 ms to minimize.
[2023-03-09 12:12:09] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 0 ms to minimize.
[2023-03-09 12:12:09] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 1 ms to minimize.
[2023-03-09 12:12:09] [INFO ] Deduced a trap composed of 163 places in 180 ms of which 1 ms to minimize.
[2023-03-09 12:12:09] [INFO ] Deduced a trap composed of 146 places in 173 ms of which 0 ms to minimize.
[2023-03-09 12:12:09] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 1 ms to minimize.
[2023-03-09 12:12:10] [INFO ] Deduced a trap composed of 156 places in 143 ms of which 0 ms to minimize.
[2023-03-09 12:12:10] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 0 ms to minimize.
[2023-03-09 12:12:10] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 1 ms to minimize.
[2023-03-09 12:12:10] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 1 ms to minimize.
[2023-03-09 12:12:10] [INFO ] Deduced a trap composed of 150 places in 170 ms of which 1 ms to minimize.
[2023-03-09 12:12:10] [INFO ] Deduced a trap composed of 148 places in 139 ms of which 0 ms to minimize.
[2023-03-09 12:12:11] [INFO ] Deduced a trap composed of 151 places in 137 ms of which 1 ms to minimize.
[2023-03-09 12:12:11] [INFO ] Deduced a trap composed of 160 places in 128 ms of which 0 ms to minimize.
[2023-03-09 12:12:11] [INFO ] Deduced a trap composed of 147 places in 134 ms of which 0 ms to minimize.
[2023-03-09 12:12:11] [INFO ] Deduced a trap composed of 147 places in 133 ms of which 0 ms to minimize.
[2023-03-09 12:12:11] [INFO ] Deduced a trap composed of 154 places in 129 ms of which 0 ms to minimize.
[2023-03-09 12:12:11] [INFO ] Deduced a trap composed of 162 places in 130 ms of which 1 ms to minimize.
[2023-03-09 12:12:12] [INFO ] Deduced a trap composed of 154 places in 138 ms of which 0 ms to minimize.
[2023-03-09 12:12:12] [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 6
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 12:12:12] [INFO ] [Real]Absence check using 62 positive place invariants in 19 ms returned sat
[2023-03-09 12:12:12] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-09 12:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:12] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-03-09 12:12:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:12] [INFO ] [Nat]Absence check using 62 positive place invariants in 24 ms returned sat
[2023-03-09 12:12:12] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2023-03-09 12:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:12] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2023-03-09 12:12:12] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2023-03-09 12:12:13] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-09 12:12:13] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2023-03-09 12:12:13] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2023-03-09 12:12:13] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2023-03-09 12:12:13] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2023-03-09 12:12:13] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2023-03-09 12:12:13] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2023-03-09 12:12:13] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2023-03-09 12:12:13] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2023-03-09 12:12:14] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2023-03-09 12:12:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1307 ms
[2023-03-09 12:12:14] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 35 ms.
[2023-03-09 12:12:16] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 0 ms to minimize.
[2023-03-09 12:12:16] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 0 ms to minimize.
[2023-03-09 12:12:16] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 1 ms to minimize.
[2023-03-09 12:12:16] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 1 ms to minimize.
[2023-03-09 12:12:17] [INFO ] Deduced a trap composed of 142 places in 144 ms of which 1 ms to minimize.
[2023-03-09 12:12:17] [INFO ] Deduced a trap composed of 143 places in 166 ms of which 0 ms to minimize.
[2023-03-09 12:12:17] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 1 ms to minimize.
[2023-03-09 12:12:17] [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 7
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 364 edges and 630 vertex of which 7 / 630 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 1283 edges and 624 vertex of which 618 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 144 place count 618 transition count 419
Reduce places removed 142 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 145 rules applied. Total rules applied 289 place count 476 transition count 416
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 292 place count 473 transition count 416
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 292 place count 473 transition count 326
Deduced a syphon composed of 90 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 489 place count 366 transition count 326
Discarding 86 places :
Symmetric choice reduction at 3 with 86 rule applications. Total rules 575 place count 280 transition count 240
Iterating global reduction 3 with 86 rules applied. Total rules applied 661 place count 280 transition count 240
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 661 place count 280 transition count 231
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 682 place count 268 transition count 231
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 874 place count 171 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 876 place count 170 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 878 place count 170 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 880 place count 168 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 881 place count 168 transition count 138
Applied a total of 881 rules in 217 ms. Remains 168 /630 variables (removed 462) and now considering 138/570 (removed 432) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 168/630 places, 138/570 transitions.
// Phase 1: matrix 138 rows 168 cols
[2023-03-09 12:12:18] [INFO ] Computed 73 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 43507 resets, run finished after 2924 ms. (steps per millisecond=341 ) properties (out of 4) seen :2
FORMULA BusinessProcesses-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 24227 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 24050 resets, run finished after 1870 ms. (steps per millisecond=534 ) properties (out of 2) seen :0
[2023-03-09 12:12:24] [INFO ] Invariant cache hit.
[2023-03-09 12:12:24] [INFO ] [Real]Absence check using 56 positive place invariants in 13 ms returned sat
[2023-03-09 12:12:24] [INFO ] [Real]Absence check using 56 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-09 12:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:24] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-09 12:12:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:25] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2023-03-09 12:12:25] [INFO ] [Nat]Absence check using 56 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-09 12:12:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:25] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-09 12:12:25] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-09 12:12:25] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-09 12:12:25] [INFO ] Computed and/alt/rep : 87/407/87 causal constraints (skipped 49 transitions) in 14 ms.
[2023-03-09 12:12:25] [INFO ] Added : 35 causal constraints over 7 iterations in 136 ms. Result :sat
Minimization took 46 ms.
[2023-03-09 12:12:25] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2023-03-09 12:12:25] [INFO ] [Real]Absence check using 56 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-09 12:12:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:25] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-09 12:12:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:25] [INFO ] [Nat]Absence check using 56 positive place invariants in 35 ms returned sat
[2023-03-09 12:12:25] [INFO ] [Nat]Absence check using 56 positive and 17 generalized place invariants in 28 ms returned sat
[2023-03-09 12:12:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:25] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-09 12:12:25] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-09 12:12:25] [INFO ] Computed and/alt/rep : 87/407/87 causal constraints (skipped 49 transitions) in 10 ms.
[2023-03-09 12:12:25] [INFO ] Added : 29 causal constraints over 6 iterations in 109 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA BusinessProcesses-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 52612 ms.

BK_STOP 1678363947007

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-16"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-16, 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 r037-tajo-167813690500573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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