Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r028-tall-165251936100157.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BusinessProcesses-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 6.3K Apr 29 23:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 23:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 23:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 23:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 148K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652541330891

Running Version 0
[2022-05-14 15:15:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 15:15:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:15:32] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2022-05-14 15:15:32] [INFO ] Transformed 593 places.
[2022-05-14 15:15:32] [INFO ] Transformed 536 transitions.
[2022-05-14 15:15:32] [INFO ] Found NUPN structural information;
[2022-05-14 15:15:32] [INFO ] Parsed PT model containing 593 places and 536 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
// Phase 1: matrix 528 rows 585 cols
[2022-05-14 15:15:32] [INFO ] Computed 95 place invariants in 43 ms
Incomplete random walk after 10000 steps, including 70 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
// Phase 1: matrix 528 rows 585 cols
[2022-05-14 15:15:33] [INFO ] Computed 95 place invariants in 14 ms
[2022-05-14 15:15:33] [INFO ] [Real]Absence check using 57 positive place invariants in 26 ms returned sat
[2022-05-14 15:15:33] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2022-05-14 15:15:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:33] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2022-05-14 15:15:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:15:33] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2022-05-14 15:15:33] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2022-05-14 15:15:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:33] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2022-05-14 15:15:34] [INFO ] Deduced a trap composed of 15 places in 331 ms of which 4 ms to minimize.
[2022-05-14 15:15:34] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 1 ms to minimize.
[2022-05-14 15:15:34] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 1 ms to minimize.
[2022-05-14 15:15:35] [INFO ] Deduced a trap composed of 21 places in 319 ms of which 2 ms to minimize.
[2022-05-14 15:15:35] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2022-05-14 15:15:35] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2022-05-14 15:15:35] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-05-14 15:15:35] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2022-05-14 15:15:35] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2022-05-14 15:15:35] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 0 ms to minimize.
[2022-05-14 15:15:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1778 ms
[2022-05-14 15:15:35] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 36 ms.
[2022-05-14 15:15:38] [INFO ] Added : 307 causal constraints over 62 iterations in 2367 ms. Result :sat
Minimization took 145 ms.
[2022-05-14 15:15:38] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-14 15:15:38] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-14 15:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:38] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-05-14 15:15:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:15:38] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2022-05-14 15:15:38] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2022-05-14 15:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:38] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2022-05-14 15:15:39] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2022-05-14 15:15:39] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2022-05-14 15:15:39] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2022-05-14 15:15:39] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2022-05-14 15:15:39] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2022-05-14 15:15:39] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 0 ms to minimize.
[2022-05-14 15:15:40] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 0 ms to minimize.
[2022-05-14 15:15:40] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 0 ms to minimize.
[2022-05-14 15:15:40] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:15:40] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 0 ms to minimize.
[2022-05-14 15:15:40] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 0 ms to minimize.
[2022-05-14 15:15:40] [INFO ] Deduced a trap composed of 141 places in 131 ms of which 1 ms to minimize.
[2022-05-14 15:15:41] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 0 ms to minimize.
[2022-05-14 15:15:41] [INFO ] Deduced a trap composed of 140 places in 130 ms of which 1 ms to minimize.
[2022-05-14 15:15:41] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:15:41] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2022-05-14 15:15:41] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 1 ms to minimize.
[2022-05-14 15:15:41] [INFO ] Deduced a trap composed of 145 places in 122 ms of which 2 ms to minimize.
[2022-05-14 15:15:41] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:15:42] [INFO ] Deduced a trap composed of 146 places in 154 ms of which 1 ms to minimize.
[2022-05-14 15:15:42] [INFO ] Deduced a trap composed of 140 places in 125 ms of which 0 ms to minimize.
[2022-05-14 15:15:42] [INFO ] Deduced a trap composed of 148 places in 131 ms of which 0 ms to minimize.
[2022-05-14 15:15:42] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:15:42] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:15:42] [INFO ] Deduced a trap composed of 133 places in 120 ms of which 5 ms to minimize.
[2022-05-14 15:15:42] [INFO ] Deduced a trap composed of 133 places in 124 ms of which 1 ms to minimize.
[2022-05-14 15:15:43] [INFO ] Deduced a trap composed of 135 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:15:43] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:15:43] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:15:43] [INFO ] Deduced a trap composed of 147 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:15:43] [INFO ] Deduced a trap composed of 136 places in 128 ms of which 1 ms to minimize.
[2022-05-14 15:15:43] [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)
[2022-05-14 15:15:43] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-14 15:15:43] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-14 15:15:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:44] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2022-05-14 15:15:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:15:44] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-14 15:15:44] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2022-05-14 15:15:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:44] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2022-05-14 15:15:44] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2022-05-14 15:15:44] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2022-05-14 15:15:44] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2022-05-14 15:15:44] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 0 ms to minimize.
[2022-05-14 15:15:45] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 0 ms to minimize.
[2022-05-14 15:15:45] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2022-05-14 15:15:45] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2022-05-14 15:15:45] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2022-05-14 15:15:45] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:15:45] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2022-05-14 15:15:45] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2022-05-14 15:15:45] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2022-05-14 15:15:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1648 ms
[2022-05-14 15:15:45] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 25 ms.
[2022-05-14 15:15:47] [INFO ] Added : 226 causal constraints over 46 iterations in 1599 ms. Result :sat
Minimization took 84 ms.
[2022-05-14 15:15:47] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-14 15:15:47] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-14 15:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:47] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2022-05-14 15:15:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:15:48] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2022-05-14 15:15:48] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-14 15:15:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:48] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2022-05-14 15:15:48] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 1 ms to minimize.
[2022-05-14 15:15:48] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2022-05-14 15:15:48] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2022-05-14 15:15:48] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 2 ms to minimize.
[2022-05-14 15:15:49] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2022-05-14 15:15:49] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:15:49] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2022-05-14 15:15:49] [INFO ] Deduced a trap composed of 137 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:15:49] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 1 ms to minimize.
[2022-05-14 15:15:49] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2022-05-14 15:15:49] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 1 ms to minimize.
[2022-05-14 15:15:50] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:15:50] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2022-05-14 15:15:50] [INFO ] Deduced a trap composed of 149 places in 126 ms of which 2 ms to minimize.
[2022-05-14 15:15:50] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 9 ms to minimize.
[2022-05-14 15:15:50] [INFO ] Deduced a trap composed of 130 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:15:50] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2022-05-14 15:15:51] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:15:51] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 1 ms to minimize.
[2022-05-14 15:15:51] [INFO ] Deduced a trap composed of 135 places in 125 ms of which 1 ms to minimize.
[2022-05-14 15:15:51] [INFO ] Deduced a trap composed of 136 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:15:51] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:15:51] [INFO ] Deduced a trap composed of 130 places in 114 ms of which 1 ms to minimize.
[2022-05-14 15:15:51] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:15:52] [INFO ] Deduced a trap composed of 127 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:15:52] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:15:52] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 0 ms to minimize.
[2022-05-14 15:15:52] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:15:52] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:15:52] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:15:52] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:15:53] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:15: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 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)
[2022-05-14 15:15:53] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-14 15:15:53] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-14 15:15:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:53] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2022-05-14 15:15:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:15:53] [INFO ] [Nat]Absence check using 57 positive place invariants in 22 ms returned sat
[2022-05-14 15:15:53] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 16 ms returned sat
[2022-05-14 15:15:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:53] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2022-05-14 15:15:53] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2022-05-14 15:15:53] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2022-05-14 15:15:53] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2022-05-14 15:15:54] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2022-05-14 15:15:54] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2022-05-14 15:15:54] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-14 15:15:54] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2022-05-14 15:15:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 726 ms
[2022-05-14 15:15:54] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 26 ms.
[2022-05-14 15:15:55] [INFO ] Added : 220 causal constraints over 45 iterations in 1518 ms. Result :sat
Minimization took 78 ms.
[2022-05-14 15:15:56] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2022-05-14 15:15:56] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-14 15:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:56] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-05-14 15:15:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:15:56] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2022-05-14 15:15:56] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2022-05-14 15:15:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:15:56] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2022-05-14 15:15:56] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 0 ms to minimize.
[2022-05-14 15:15:56] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2022-05-14 15:15:57] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 1 ms to minimize.
[2022-05-14 15:15:57] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2022-05-14 15:15:57] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2022-05-14 15:15:57] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2022-05-14 15:15:57] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2022-05-14 15:15:57] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2022-05-14 15:15:58] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2022-05-14 15:15:58] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2022-05-14 15:15:58] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 1 ms to minimize.
[2022-05-14 15:15:58] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2022-05-14 15:15:58] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 1 ms to minimize.
[2022-05-14 15:15:58] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2022-05-14 15:15:59] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 1 ms to minimize.
[2022-05-14 15:15:59] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2022-05-14 15:15:59] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2022-05-14 15:15:59] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 0 ms to minimize.
[2022-05-14 15:15:59] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2022-05-14 15:15:59] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 0 ms to minimize.
[2022-05-14 15:15:59] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:16:00] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 0 ms to minimize.
[2022-05-14 15:16:00] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 0 ms to minimize.
[2022-05-14 15:16:00] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 0 ms to minimize.
[2022-05-14 15:16:00] [INFO ] Deduced a trap composed of 143 places in 127 ms of which 1 ms to minimize.
[2022-05-14 15:16:00] [INFO ] Deduced a trap composed of 127 places in 137 ms of which 1 ms to minimize.
[2022-05-14 15:16:00] [INFO ] Deduced a trap composed of 140 places in 125 ms of which 0 ms to minimize.
[2022-05-14 15:16:01] [INFO ] Deduced a trap composed of 135 places in 127 ms of which 1 ms to minimize.
[2022-05-14 15:16:01] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:16:01] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2022-05-14 15:16:01] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2022-05-14 15:16:01] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2022-05-14 15:16: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 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)
[2022-05-14 15:16:01] [INFO ] [Real]Absence check using 57 positive place invariants in 51 ms returned sat
[2022-05-14 15:16:01] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 15 ms returned sat
[2022-05-14 15:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:01] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2022-05-14 15:16:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:01] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2022-05-14 15:16:01] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-14 15:16:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:02] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-05-14 15:16:02] [INFO ] Deduced a trap composed of 137 places in 139 ms of which 0 ms to minimize.
[2022-05-14 15:16:02] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2022-05-14 15:16:02] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:16:02] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2022-05-14 15:16:02] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-05-14 15:16:03] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 1 ms to minimize.
[2022-05-14 15:16:03] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2022-05-14 15:16:03] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2022-05-14 15:16:03] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 1 ms to minimize.
[2022-05-14 15:16:03] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2022-05-14 15:16:03] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 0 ms to minimize.
[2022-05-14 15:16:04] [INFO ] Deduced a trap composed of 131 places in 166 ms of which 1 ms to minimize.
[2022-05-14 15:16:04] [INFO ] Deduced a trap composed of 133 places in 134 ms of which 1 ms to minimize.
[2022-05-14 15:16:04] [INFO ] Deduced a trap composed of 113 places in 138 ms of which 0 ms to minimize.
[2022-05-14 15:16:04] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:16:04] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 0 ms to minimize.
[2022-05-14 15:16:04] [INFO ] Deduced a trap composed of 116 places in 125 ms of which 0 ms to minimize.
[2022-05-14 15:16:04] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:16:05] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:16:05] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 0 ms to minimize.
[2022-05-14 15:16:05] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:16:05] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:16:05] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 1 ms to minimize.
[2022-05-14 15:16:05] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:16:06] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 1 ms to minimize.
[2022-05-14 15:16:06] [INFO ] Deduced a trap composed of 135 places in 148 ms of which 0 ms to minimize.
[2022-05-14 15:16:06] [INFO ] Deduced a trap composed of 149 places in 144 ms of which 0 ms to minimize.
[2022-05-14 15:16:06] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:16:06] [INFO ] Deduced a trap composed of 132 places in 136 ms of which 0 ms to minimize.
[2022-05-14 15:16:06] [INFO ] Deduced a trap composed of 144 places in 136 ms of which 0 ms to minimize.
[2022-05-14 15:16: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 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: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)
[2022-05-14 15:16:06] [INFO ] [Real]Absence check using 57 positive place invariants in 29 ms returned sat
[2022-05-14 15:16:06] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-14 15:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:07] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2022-05-14 15:16:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:07] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2022-05-14 15:16:07] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-14 15:16:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:07] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2022-05-14 15:16:07] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2022-05-14 15:16:07] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2022-05-14 15:16:07] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 0 ms to minimize.
[2022-05-14 15:16:08] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2022-05-14 15:16:08] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2022-05-14 15:16:08] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 0 ms to minimize.
[2022-05-14 15:16:08] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 0 ms to minimize.
[2022-05-14 15:16:08] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2022-05-14 15:16:08] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2022-05-14 15:16:08] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2022-05-14 15:16:08] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2022-05-14 15:16:09] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2022-05-14 15:16:09] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2022-05-14 15:16:09] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1753 ms
[2022-05-14 15:16:09] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 26 ms.
[2022-05-14 15:16:10] [INFO ] Added : 220 causal constraints over 45 iterations in 1512 ms. Result :sat
Minimization took 88 ms.
[2022-05-14 15:16:10] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2022-05-14 15:16:10] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 17 ms returned sat
[2022-05-14 15:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:11] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-05-14 15:16:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:11] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2022-05-14 15:16:11] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2022-05-14 15:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:11] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2022-05-14 15:16:11] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 0 ms to minimize.
[2022-05-14 15:16:11] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2022-05-14 15:16:12] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 1 ms to minimize.
[2022-05-14 15:16:12] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2022-05-14 15:16:12] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 0 ms to minimize.
[2022-05-14 15:16:12] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2022-05-14 15:16:12] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2022-05-14 15:16:12] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 1 ms to minimize.
[2022-05-14 15:16:13] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 0 ms to minimize.
[2022-05-14 15:16:13] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:16:13] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:16:13] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 0 ms to minimize.
[2022-05-14 15:16:13] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:16:13] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:16:13] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:16:14] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 0 ms to minimize.
[2022-05-14 15:16:14] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:16:14] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:16:14] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:16:14] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:16:14] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 1 ms to minimize.
[2022-05-14 15:16:14] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 1 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 0 ms to minimize.
[2022-05-14 15:16:15] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 1 ms to minimize.
[2022-05-14 15:16:16] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 1 ms to minimize.
[2022-05-14 15:16:16] [INFO ] Deduced a trap composed of 135 places in 127 ms of which 0 ms to minimize.
[2022-05-14 15:16:16] [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 8
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)
[2022-05-14 15:16:16] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2022-05-14 15:16:16] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2022-05-14 15:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:16] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2022-05-14 15:16:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:16] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2022-05-14 15:16:16] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2022-05-14 15:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:16] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2022-05-14 15:16:16] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:16:17] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2022-05-14 15:16:17] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:16:17] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2022-05-14 15:16:17] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2022-05-14 15:16:17] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2022-05-14 15:16:17] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2022-05-14 15:16:17] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2022-05-14 15:16:17] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2022-05-14 15:16:17] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 0 ms to minimize.
[2022-05-14 15:16:17] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2022-05-14 15:16:18] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2022-05-14 15:16:18] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2022-05-14 15:16:18] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 0 ms to minimize.
[2022-05-14 15:16:18] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1406 ms
[2022-05-14 15:16:18] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 39 ms.
[2022-05-14 15:16:19] [INFO ] Added : 218 causal constraints over 44 iterations in 1535 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 28300 steps, including 128 resets, run finished after 79 ms. (steps per millisecond=358 ) properties (out of 10) seen :3 could not realise parikh vector
FORMULA BusinessProcesses-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 24200 steps, including 116 resets, run finished after 62 ms. (steps per millisecond=390 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26900 steps, including 134 resets, run finished after 75 ms. (steps per millisecond=358 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 27600 steps, including 143 resets, run finished after 75 ms. (steps per millisecond=368 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 33200 steps, including 139 resets, run finished after 87 ms. (steps per millisecond=381 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 333 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 10 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 573 transition count 390
Reduce places removed 129 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 444 transition count 388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 264 place count 442 transition count 388
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 264 place count 442 transition count 301
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 455 place count 338 transition count 301
Discarding 75 places :
Symmetric choice reduction at 3 with 75 rule applications. Total rules 530 place count 263 transition count 226
Iterating global reduction 3 with 75 rules applied. Total rules applied 605 place count 263 transition count 226
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 605 place count 263 transition count 219
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 621 place count 254 transition count 219
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 803 place count 162 transition count 129
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 805 place count 161 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 807 place count 161 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 809 place count 159 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 810 place count 159 transition count 131
Applied a total of 810 rules in 152 ms. Remains 159 /585 variables (removed 426) and now considering 131/528 (removed 397) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/585 places, 131/528 transitions.
// Phase 1: matrix 131 rows 159 cols
[2022-05-14 15:16:20] [INFO ] Computed 69 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 44852 resets, run finished after 2646 ms. (steps per millisecond=377 ) properties (out of 4) seen :3
FORMULA BusinessProcesses-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 26123 resets, run finished after 1681 ms. (steps per millisecond=594 ) properties (out of 1) seen :0
// Phase 1: matrix 131 rows 159 cols
[2022-05-14 15:16:24] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-14 15:16:24] [INFO ] [Real]Absence check using 52 positive place invariants in 9 ms returned sat
[2022-05-14 15:16:24] [INFO ] [Real]Absence check using 52 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-14 15:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:24] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-14 15:16:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:24] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2022-05-14 15:16:24] [INFO ] [Nat]Absence check using 52 positive and 17 generalized place invariants in 2 ms returned sat
[2022-05-14 15:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:24] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-05-14 15:16:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-14 15:16:24] [INFO ] [Nat]Added 12 Read/Feed constraints in 8 ms returned sat
[2022-05-14 15:16:24] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 9 ms to minimize.
[2022-05-14 15:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2022-05-14 15:16:25] [INFO ] Computed and/alt/rep : 83/395/83 causal constraints (skipped 46 transitions) in 8 ms.
[2022-05-14 15:16:25] [INFO ] Added : 26 causal constraints over 6 iterations in 89 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4500 steps, including 135 resets, run finished after 15 ms. (steps per millisecond=300 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 159/159 places, 131/131 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 159 transition count 130
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 157 transition count 129
Applied a total of 4 rules in 14 ms. Remains 157 /159 variables (removed 2) and now considering 129/131 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/159 places, 129/131 transitions.
// Phase 1: matrix 129 rows 157 cols
[2022-05-14 15:16:25] [INFO ] Computed 69 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 44944 resets, run finished after 2489 ms. (steps per millisecond=401 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 26412 resets, run finished after 1710 ms. (steps per millisecond=584 ) properties (out of 1) seen :0
// Phase 1: matrix 129 rows 157 cols
[2022-05-14 15:16:29] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-14 15:16:29] [INFO ] [Real]Absence check using 52 positive place invariants in 7 ms returned sat
[2022-05-14 15:16:29] [INFO ] [Real]Absence check using 52 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-14 15:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:29] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-14 15:16:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:29] [INFO ] [Nat]Absence check using 52 positive place invariants in 7 ms returned sat
[2022-05-14 15:16:29] [INFO ] [Nat]Absence check using 52 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-14 15:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:29] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-14 15:16:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-14 15:16:29] [INFO ] [Nat]Added 12 Read/Feed constraints in 6 ms returned sat
[2022-05-14 15:16:29] [INFO ] Computed and/alt/rep : 81/390/81 causal constraints (skipped 46 transitions) in 9 ms.
[2022-05-14 15:16:29] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2022-05-14 15:16:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-05-14 15:16:29] [INFO ] Added : 29 causal constraints over 7 iterations in 156 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4400 steps, including 262 resets, run finished after 14 ms. (steps per millisecond=314 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 157/157 places, 129/129 transitions.
Applied a total of 0 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 129/129 transitions.
Starting structural reductions, iteration 0 : 157/157 places, 129/129 transitions.
Applied a total of 0 rules in 10 ms. Remains 157 /157 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 157 cols
[2022-05-14 15:16:29] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-14 15:16:29] [INFO ] Implicit Places using invariants in 188 ms returned [1, 2, 3, 4, 5, 6, 15, 16, 18, 19, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 196 ms to find 21 implicit places.
[2022-05-14 15:16:29] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 129 rows 136 cols
[2022-05-14 15:16:29] [INFO ] Computed 48 place invariants in 2 ms
[2022-05-14 15:16:30] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Starting structural reductions, iteration 1 : 136/157 places, 129/129 transitions.
Applied a total of 0 rules in 7 ms. Remains 136 /136 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2022-05-14 15:16:30] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 129 rows 136 cols
[2022-05-14 15:16:30] [INFO ] Computed 48 place invariants in 2 ms
[2022-05-14 15:16:30] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 2 iterations. Remains : 136/157 places, 129/129 transitions.
Successfully produced net in file /tmp/petri1000_2958645274997825748.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 128 rows 136 cols
[2022-05-14 15:16:30] [INFO ] Computed 49 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 44646 resets, run finished after 1640 ms. (steps per millisecond=609 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 26556 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 1) seen :0
// Phase 1: matrix 128 rows 136 cols
[2022-05-14 15:16:32] [INFO ] Computed 49 place invariants in 2 ms
[2022-05-14 15:16:33] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2022-05-14 15:16:33] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 2 ms returned sat
[2022-05-14 15:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:33] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-14 15:16:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:33] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2022-05-14 15:16:33] [INFO ] [Nat]Absence check using 32 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-14 15:16:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:33] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-14 15:16:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-14 15:16:33] [INFO ] [Nat]Added 12 Read/Feed constraints in 19 ms returned sat
[2022-05-14 15:16:33] [INFO ] Computed and/alt/rep : 81/387/81 causal constraints (skipped 45 transitions) in 10 ms.
[2022-05-14 15:16:33] [INFO ] Added : 26 causal constraints over 6 iterations in 99 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 5600 steps, including 346 resets, run finished after 12 ms. (steps per millisecond=466 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 128/128 transitions.
Graph (complete) has 535 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 135 /136 variables (removed 1) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/136 places, 128/128 transitions.
// Phase 1: matrix 128 rows 135 cols
[2022-05-14 15:16:33] [INFO ] Computed 48 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 44728 resets, run finished after 1555 ms. (steps per millisecond=643 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 26464 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties (out of 1) seen :0
// Phase 1: matrix 128 rows 135 cols
[2022-05-14 15:16:35] [INFO ] Computed 48 place invariants in 4 ms
[2022-05-14 15:16:36] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2022-05-14 15:16:36] [INFO ] [Real]Absence check using 32 positive and 16 generalized place invariants in 3 ms returned sat
[2022-05-14 15:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:36] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-14 15:16:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:36] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2022-05-14 15:16:36] [INFO ] [Nat]Absence check using 32 positive and 16 generalized place invariants in 4 ms returned sat
[2022-05-14 15:16:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:36] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-14 15:16:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-14 15:16:36] [INFO ] [Nat]Added 12 Read/Feed constraints in 5 ms returned sat
[2022-05-14 15:16:36] [INFO ] Computed and/alt/rep : 81/387/81 causal constraints (skipped 45 transitions) in 10 ms.
[2022-05-14 15:16:36] [INFO ] Added : 26 causal constraints over 6 iterations in 91 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4800 steps, including 178 resets, run finished after 10 ms. (steps per millisecond=480 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 128/128 transitions.
Starting structural reductions, iteration 0 : 135/135 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 135 cols
[2022-05-14 15:16:36] [INFO ] Computed 48 place invariants in 2 ms
[2022-05-14 15:16:36] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 128 rows 135 cols
[2022-05-14 15:16:36] [INFO ] Computed 48 place invariants in 2 ms
[2022-05-14 15:16:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-14 15:16:36] [INFO ] Implicit Places using invariants and state equation in 303 ms returned [1, 3, 9, 32, 33, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 58, 60, 62, 64, 66, 68, 70, 72, 80, 82, 84, 86, 88]
Discarding 29 places :
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 439 ms to find 29 implicit places.
[2022-05-14 15:16:36] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 124 rows 106 cols
[2022-05-14 15:16:36] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-14 15:16:36] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 106/135 places, 124/128 transitions.
Graph (complete) has 342 edges and 106 vertex of which 97 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 97 transition count 115
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 88 transition count 115
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 31 place count 76 transition count 75
Iterating global reduction 2 with 12 rules applied. Total rules applied 43 place count 76 transition count 75
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 76 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 74 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 73 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 73 transition count 72
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 66 place count 64 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 63 transition count 63
Applied a total of 68 rules in 14 ms. Remains 63 /106 variables (removed 43) and now considering 63/124 (removed 61) transitions.
// Phase 1: matrix 63 rows 63 cols
[2022-05-14 15:16:36] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-14 15:16:36] [INFO ] Implicit Places using invariants in 43 ms returned [7, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions, iteration 2 : 60/135 places, 63/128 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 60 transition count 60
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 60
Applied a total of 6 rules in 5 ms. Remains 57 /60 variables (removed 3) and now considering 60/63 (removed 3) transitions.
// Phase 1: matrix 60 rows 57 cols
[2022-05-14 15:16:36] [INFO ] Computed 12 place invariants in 10 ms
[2022-05-14 15:16:36] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 60 rows 57 cols
[2022-05-14 15:16:36] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-14 15:16:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-14 15:16:36] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [26, 28, 30]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 132 ms to find 3 implicit places.
Starting structural reductions, iteration 3 : 54/135 places, 60/128 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 53 transition count 58
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 23 rules applied. Total rules applied 26 place count 39 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 36 transition count 46
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 36 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 36 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 35 transition count 44
Applied a total of 35 rules in 13 ms. Remains 35 /54 variables (removed 19) and now considering 44/60 (removed 16) transitions.
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:36] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 15:16:37] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 15:16:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-14 15:16:37] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Finished structural reductions, in 4 iterations. Remains : 35/135 places, 44/128 transitions.
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:37] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 76294 resets, run finished after 497 ms. (steps per millisecond=2012 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 37620 resets, run finished after 257 ms. (steps per millisecond=3891 ) properties (out of 1) seen :0
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 15:16:37] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-05-14 15:16:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-14 15:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:37] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-14 15:16:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-14 15:16:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-14 15:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:37] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-14 15:16:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-14 15:16:37] [INFO ] [Nat]Added 37 Read/Feed constraints in 3 ms returned sat
[2022-05-14 15:16:37] [INFO ] Computed and/alt/rep : 42/229/42 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-14 15:16:37] [INFO ] Added : 30 causal constraints over 6 iterations in 34 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 3600 steps, including 350 resets, run finished after 6 ms. (steps per millisecond=600 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 44/44 transitions.
Starting structural reductions, iteration 0 : 35/35 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-14 15:16:37] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-14 15:16:38] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-14 15:16:38] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-05-14 15:16:38] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:38] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-14 15:16:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 44/44 transitions.
Starting property specific reduction for BusinessProcesses-PT-13-UpperBounds-09
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:38] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 769 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 363 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:38] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-14 15:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-14 15:16:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-14 15:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-14 15:16:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-14 15:16:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-14 15:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:38] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-14 15:16:38] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-14 15:16:38] [INFO ] [Nat]Added 37 Read/Feed constraints in 3 ms returned sat
[2022-05-14 15:16:38] [INFO ] Computed and/alt/rep : 42/229/42 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-14 15:16:38] [INFO ] Added : 30 causal constraints over 6 iterations in 32 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 3600 steps, including 354 resets, run finished after 6 ms. (steps per millisecond=600 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 44/44 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 44/44 transitions.
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:38] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 76362 resets, run finished after 415 ms. (steps per millisecond=2409 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 37719 resets, run finished after 257 ms. (steps per millisecond=3891 ) properties (out of 1) seen :0
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 15:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-14 15:16:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-14 15:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:38] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-14 15:16:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:16:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-14 15:16:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-14 15:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:16:38] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-14 15:16:38] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-14 15:16:38] [INFO ] [Nat]Added 37 Read/Feed constraints in 3 ms returned sat
[2022-05-14 15:16:38] [INFO ] Computed and/alt/rep : 42/229/42 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-14 15:16:38] [INFO ] Added : 30 causal constraints over 6 iterations in 30 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 3600 steps, including 356 resets, run finished after 5 ms. (steps per millisecond=720 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 44/44 transitions.
Starting structural reductions, iteration 0 : 35/35 places, 44/44 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 44/44 (removed 0) transitions.
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:39] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 15:16:39] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:39] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-14 15:16:39] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-05-14 15:16:39] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-14 15:16:39] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 44 rows 35 cols
[2022-05-14 15:16:39] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-14 15:16:39] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 44/44 transitions.
Ending property specific reduction for BusinessProcesses-PT-13-UpperBounds-09 in 1056 ms.
[2022-05-14 15:16:39] [INFO ] Flatten gal took : 25 ms
[2022-05-14 15:16:39] [INFO ] Applying decomposition
[2022-05-14 15:16:39] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12187678229157413334.txt, -o, /tmp/graph12187678229157413334.bin, -w, /tmp/graph12187678229157413334.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12187678229157413334.bin, -l, -1, -v, -w, /tmp/graph12187678229157413334.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-14 15:16:39] [INFO ] Decomposing Gal with order
[2022-05-14 15:16:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 15:16:39] [INFO ] Removed a total of 32 redundant transitions.
[2022-05-14 15:16:39] [INFO ] Flatten gal took : 28 ms
[2022-05-14 15:16:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 4 ms.
[2022-05-14 15:16:39] [INFO ] Time to serialize gal into /tmp/UpperBounds11644126477998130909.gal : 2 ms
[2022-05-14 15:16:39] [INFO ] Time to serialize properties into /tmp/UpperBounds11228333114205458091.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds11644126477998130909.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11228333114205458091.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds11644126477998130909.gal -t CGAL -reachable-file /tmp/UpperBounds11228333114205458091.prop --nowitness
Loading property file /tmp/UpperBounds11228333114205458091.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,769,0.022437,4280,67,58,822,604,120,1074,75,1525,0
Total reachable state count : 769

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property BusinessProcesses-PT-13-UpperBounds-09 :0 <= i0.u0.p90 <= 1
FORMULA BusinessProcesses-PT-13-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-13-UpperBounds-09,0,0.023052,4280,1,0,822,604,176,1074,97,1525,105

BK_STOP 1652541400497

--------------------
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-13"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is BusinessProcesses-PT-13, 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 r028-tall-165251936100157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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