About the Execution of ITS-Tools for BusinessProcesses-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 398.287 | 65792.00 | 85126.00 | 60.20 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399900605.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399900605
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 192K May 18 16:42 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-20-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716338193446
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 00:36:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:36:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:36:34] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-22 00:36:34] [INFO ] Transformed 782 places.
[2024-05-22 00:36:34] [INFO ] Transformed 697 transitions.
[2024-05-22 00:36:34] [INFO ] Found NUPN structural information;
[2024-05-22 00:36:34] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 63 places in 11 ms
Reduce places removed 63 places and 59 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 638 rows 719 cols
[2024-05-22 00:36:34] [INFO ] Computed 121 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (51 resets) in 59 ms. (166 steps per ms)
FORMULA BusinessProcesses-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (94 resets) in 138 ms. (719 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-22 00:36:35] [INFO ] Invariant cache hit.
[2024-05-22 00:36:35] [INFO ] [Real]Absence check using 78 positive place invariants in 42 ms returned sat
[2024-05-22 00:36:35] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 15 ms returned sat
[2024-05-22 00:36:35] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2024-05-22 00:36:36] [INFO ] Deduced a trap composed of 18 places in 246 ms of which 33 ms to minimize.
[2024-05-22 00:36:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:36:36] [INFO ] [Nat]Absence check using 78 positive place invariants in 26 ms returned sat
[2024-05-22 00:36:36] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 22 ms returned sat
[2024-05-22 00:36:36] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-05-22 00:36:36] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 4 ms to minimize.
[2024-05-22 00:36:36] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 6 ms to minimize.
[2024-05-22 00:36:37] [INFO ] Deduced a trap composed of 155 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:36:37] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 3 ms to minimize.
[2024-05-22 00:36:37] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 4 ms to minimize.
[2024-05-22 00:36:37] [INFO ] Deduced a trap composed of 162 places in 237 ms of which 6 ms to minimize.
[2024-05-22 00:36:38] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 3 ms to minimize.
[2024-05-22 00:36:38] [INFO ] Deduced a trap composed of 170 places in 233 ms of which 5 ms to minimize.
[2024-05-22 00:36:38] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 5 ms to minimize.
[2024-05-22 00:36:38] [INFO ] Deduced a trap composed of 150 places in 242 ms of which 4 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 163 places in 223 ms of which 4 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 4 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 5 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 165 places in 228 ms of which 4 ms to minimize.
[2024-05-22 00:36:40] [INFO ] Deduced a trap composed of 154 places in 226 ms of which 3 ms to minimize.
[2024-05-22 00:36:40] [INFO ] Deduced a trap composed of 45 places in 435 ms of which 3 ms to minimize.
[2024-05-22 00:36:40] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:36:41] [INFO ] Deduced a trap composed of 159 places in 256 ms of which 6 ms to minimize.
[2024-05-22 00:36:41] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:36:41] [INFO ] Trap strengthening (SAT) tested/added 19/19 trap constraints in 4662 ms
[2024-05-22 00:36:41] [INFO ] [Real]Absence check using 78 positive place invariants in 24 ms returned sat
[2024-05-22 00:36:41] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2024-05-22 00:36:41] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-22 00:36:41] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:36:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:36:41] [INFO ] [Nat]Absence check using 78 positive place invariants in 27 ms returned sat
[2024-05-22 00:36:41] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2024-05-22 00:36:42] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-22 00:36:42] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 3 ms to minimize.
[2024-05-22 00:36:42] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:36:42] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:36:42] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:36:42] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 4 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 8 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2204 ms
[2024-05-22 00:36:44] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 50 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-22 00:36:46] [INFO ] [Real]Absence check using 78 positive place invariants in 26 ms returned sat
[2024-05-22 00:36:46] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2024-05-22 00:36:47] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2024-05-22 00:36:47] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:36:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:36:47] [INFO ] [Nat]Absence check using 78 positive place invariants in 48 ms returned sat
[2024-05-22 00:36:47] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 20 ms returned sat
[2024-05-22 00:36:47] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2024-05-22 00:36:48] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:36:48] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:36:48] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 4 ms to minimize.
[2024-05-22 00:36:48] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:36:48] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:36:48] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:36:49] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:36:49] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:36:49] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:36:49] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:36:49] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:36:50] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 2 ms to minimize.
[2024-05-22 00:36:50] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 4 ms to minimize.
[2024-05-22 00:36:50] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:36:50] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:36:50] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:36:50] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:36:51] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 14 ms to minimize.
[2024-05-22 00:36:51] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:36:51] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:36:51] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:36:51] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:36:51] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:36:52] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:36:52] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:36:52] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:36:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 00:36:52] [INFO ] [Real]Absence check using 78 positive place invariants in 35 ms returned sat
[2024-05-22 00:36:52] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 14 ms returned sat
[2024-05-22 00:36:52] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2024-05-22 00:36:53] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:36:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:36:53] [INFO ] [Nat]Absence check using 78 positive place invariants in 36 ms returned sat
[2024-05-22 00:36:53] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 12 ms returned sat
[2024-05-22 00:36:53] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2024-05-22 00:36:53] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:36:54] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:36:54] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:36:54] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:36:54] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:54] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:36:54] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:36:55] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:36:56] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:36:56] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 4 ms to minimize.
[2024-05-22 00:36:56] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 4 ms to minimize.
[2024-05-22 00:36:56] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 4 ms to minimize.
[2024-05-22 00:36:57] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 5 ms to minimize.
[2024-05-22 00:36:57] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 4 ms to minimize.
[2024-05-22 00:36:57] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 4 ms to minimize.
[2024-05-22 00:36:57] [INFO ] Deduced a trap composed of 153 places in 211 ms of which 4 ms to minimize.
[2024-05-22 00:36:57] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:36:57] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 4 ms to minimize.
[2024-05-22 00:36:58] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 4 ms to minimize.
[2024-05-22 00:36:58] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 6 ms to minimize.
[2024-05-22 00:36:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 00:36:58] [INFO ] [Real]Absence check using 78 positive place invariants in 40 ms returned sat
[2024-05-22 00:36:58] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 15 ms returned sat
[2024-05-22 00:36:58] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:36:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:36:59] [INFO ] [Nat]Absence check using 78 positive place invariants in 28 ms returned sat
[2024-05-22 00:36:59] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2024-05-22 00:36:59] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 4 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 147 places in 239 ms of which 4 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 5 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 5 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 5 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 159 places in 246 ms of which 4 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 4 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 154 places in 238 ms of which 5 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 4 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 4 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 4 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 5 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 4 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 4 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 34 places in 230 ms of which 5 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 157 places in 226 ms of which 4 ms to minimize.
[2024-05-22 00:37:04] [INFO ] Deduced a trap composed of 167 places in 233 ms of which 4 ms to minimize.
[2024-05-22 00:37:04] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 5 ms to minimize.
[2024-05-22 00:37:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 00:37:04] [INFO ] [Real]Absence check using 78 positive place invariants in 34 ms returned sat
[2024-05-22 00:37:04] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 14 ms returned sat
[2024-05-22 00:37:04] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2024-05-22 00:37:05] [INFO ] Deduced a trap composed of 151 places in 231 ms of which 4 ms to minimize.
[2024-05-22 00:37:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:37:05] [INFO ] [Nat]Absence check using 78 positive place invariants in 34 ms returned sat
[2024-05-22 00:37:05] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2024-05-22 00:37:05] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2024-05-22 00:37:05] [INFO ] Deduced a trap composed of 151 places in 226 ms of which 5 ms to minimize.
[2024-05-22 00:37:05] [INFO ] Deduced a trap composed of 159 places in 196 ms of which 4 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 5 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 5 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 5 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 4 ms to minimize.
[2024-05-22 00:37:07] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 4 ms to minimize.
[2024-05-22 00:37:07] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 4 ms to minimize.
[2024-05-22 00:37:07] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 3 ms to minimize.
[2024-05-22 00:37:07] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 4 ms to minimize.
[2024-05-22 00:37:08] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 5 ms to minimize.
[2024-05-22 00:37:08] [INFO ] Deduced a trap composed of 151 places in 211 ms of which 4 ms to minimize.
[2024-05-22 00:37:08] [INFO ] Deduced a trap composed of 151 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:37:08] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 4 ms to minimize.
[2024-05-22 00:37:08] [INFO ] Deduced a trap composed of 153 places in 196 ms of which 4 ms to minimize.
[2024-05-22 00:37:09] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 5 ms to minimize.
[2024-05-22 00:37:09] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 4 ms to minimize.
[2024-05-22 00:37:09] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 4 ms to minimize.
[2024-05-22 00:37:09] [INFO ] Deduced a trap composed of 144 places in 219 ms of which 4 ms to minimize.
[2024-05-22 00:37:10] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 4 ms to minimize.
[2024-05-22 00:37:10] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 00:37:10] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2024-05-22 00:37:10] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 14 ms returned sat
[2024-05-22 00:37:10] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2024-05-22 00:37:10] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 5 ms to minimize.
[2024-05-22 00:37:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:37:11] [INFO ] [Nat]Absence check using 78 positive place invariants in 34 ms returned sat
[2024-05-22 00:37:11] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 21 ms returned sat
[2024-05-22 00:37:11] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2024-05-22 00:37:11] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 5 ms to minimize.
[2024-05-22 00:37:11] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 4 ms to minimize.
[2024-05-22 00:37:12] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 4 ms to minimize.
[2024-05-22 00:37:12] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 4 ms to minimize.
[2024-05-22 00:37:12] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 5 ms to minimize.
[2024-05-22 00:37:12] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 4 ms to minimize.
[2024-05-22 00:37:13] [INFO ] Deduced a trap composed of 144 places in 218 ms of which 4 ms to minimize.
[2024-05-22 00:37:13] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 4 ms to minimize.
[2024-05-22 00:37:13] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:37:13] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:37:13] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:37:14] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:37:14] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:37:14] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:37:14] [INFO ] Deduced a trap composed of 155 places in 228 ms of which 4 ms to minimize.
[2024-05-22 00:37:14] [INFO ] Deduced a trap composed of 161 places in 229 ms of which 4 ms to minimize.
[2024-05-22 00:37:15] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:37:15] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:37:15] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 5 ms to minimize.
[2024-05-22 00:37:15] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:37:15] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:37:15] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:37:15] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:37:15] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4493 ms
[2024-05-22 00:37:15] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 33 ms.
[2024-05-22 00:37:15] [INFO ] Added : 0 causal constraints over 0 iterations in 35 ms. Result :unknown
[2024-05-22 00:37:16] [INFO ] [Real]Absence check using 78 positive place invariants in 31 ms returned sat
[2024-05-22 00:37:16] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 14 ms returned sat
[2024-05-22 00:37:16] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-05-22 00:37:16] [INFO ] Deduced a trap composed of 16 places in 258 ms of which 5 ms to minimize.
[2024-05-22 00:37:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:37:16] [INFO ] [Nat]Absence check using 78 positive place invariants in 28 ms returned sat
[2024-05-22 00:37:16] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2024-05-22 00:37:17] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2024-05-22 00:37:17] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 5 ms to minimize.
[2024-05-22 00:37:17] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 4 ms to minimize.
[2024-05-22 00:37:17] [INFO ] Deduced a trap composed of 135 places in 238 ms of which 5 ms to minimize.
[2024-05-22 00:37:18] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 5 ms to minimize.
[2024-05-22 00:37:18] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 5 ms to minimize.
[2024-05-22 00:37:18] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 4 ms to minimize.
[2024-05-22 00:37:18] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 4 ms to minimize.
[2024-05-22 00:37:19] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 4 ms to minimize.
[2024-05-22 00:37:19] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 4 ms to minimize.
[2024-05-22 00:37:19] [INFO ] Deduced a trap composed of 159 places in 227 ms of which 5 ms to minimize.
[2024-05-22 00:37:19] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 4 ms to minimize.
[2024-05-22 00:37:20] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 5 ms to minimize.
[2024-05-22 00:37:20] [INFO ] Deduced a trap composed of 173 places in 210 ms of which 4 ms to minimize.
[2024-05-22 00:37:20] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 4 ms to minimize.
[2024-05-22 00:37:20] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:37:20] [INFO ] Deduced a trap composed of 155 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:37:21] [INFO ] Deduced a trap composed of 161 places in 183 ms of which 4 ms to minimize.
[2024-05-22 00:37:21] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:37:21] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 4 ms to minimize.
[2024-05-22 00:37:21] [INFO ] Deduced a trap composed of 152 places in 162 ms of which 4 ms to minimize.
[2024-05-22 00:37:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 00:37:21] [INFO ] [Real]Absence check using 78 positive place invariants in 23 ms returned sat
[2024-05-22 00:37:21] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 12 ms returned sat
[2024-05-22 00:37:22] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-22 00:37:22] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:37:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:37:22] [INFO ] [Nat]Absence check using 78 positive place invariants in 34 ms returned sat
[2024-05-22 00:37:22] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 14 ms returned sat
[2024-05-22 00:37:22] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-05-22 00:37:22] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:37:23] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:37:23] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:37:23] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:37:23] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:37:23] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:23] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:37:23] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:37:24] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:37:24] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:37:24] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:37:24] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:37:24] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:37:24] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:37:24] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1936 ms
[2024-05-22 00:37:24] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 58 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-22 00:37:27] [INFO ] [Real]Absence check using 78 positive place invariants in 34 ms returned sat
[2024-05-22 00:37:27] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 14 ms returned sat
[2024-05-22 00:37:27] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-05-22 00:37:27] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:37:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:37:28] [INFO ] [Nat]Absence check using 78 positive place invariants in 32 ms returned sat
[2024-05-22 00:37:28] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 12 ms returned sat
[2024-05-22 00:37:28] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2024-05-22 00:37:28] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 4 ms to minimize.
[2024-05-22 00:37:28] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:37:28] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:37:29] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:37:29] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:37:29] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:37:29] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:37:29] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:37:30] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:37:30] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:37:30] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:37:30] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:37:30] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:37:30] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:37:30] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:37:30] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:37:31] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 4 ms to minimize.
[2024-05-22 00:37:31] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:37:31] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:37:31] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2968 ms
[2024-05-22 00:37:31] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 67 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 401 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 686 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.3 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 686 transition count 456
Reduce places removed 161 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 165 rules applied. Total rules applied 328 place count 525 transition count 452
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 332 place count 521 transition count 452
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 332 place count 521 transition count 350
Deduced a syphon composed of 102 places in 2 ms
Ensure Unique test removed 21 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 225 rules applied. Total rules applied 557 place count 398 transition count 350
Discarding 89 places :
Symmetric choice reduction at 3 with 89 rule applications. Total rules 646 place count 309 transition count 261
Iterating global reduction 3 with 89 rules applied. Total rules applied 735 place count 309 transition count 261
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 735 place count 309 transition count 253
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 752 place count 300 transition count 253
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 956 place count 197 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 960 place count 195 transition count 159
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 962 place count 195 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 964 place count 193 transition count 157
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 965 place count 193 transition count 157
Applied a total of 965 rules in 202 ms. Remains 193 /719 variables (removed 526) and now considering 157/638 (removed 481) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 193/719 places, 157/638 transitions.
[2024-05-22 00:37:33] [INFO ] Flow matrix only has 156 transitions (discarded 1 similar events)
// Phase 1: matrix 156 rows 193 cols
[2024-05-22 00:37:33] [INFO ] Computed 83 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (48461 resets) in 3443 ms. (290 steps per ms)
FORMULA BusinessProcesses-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (17909 resets) in 1884 ms. (530 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-22 00:37:39] [INFO ] Flatten gal took : 73 ms
[2024-05-22 00:37:39] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:37:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6452419547904171090.gal : 13 ms
[2024-05-22 00:37:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10994663991317404665.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6452419547904171090.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10994663991317404665.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 64580 ms.
BK_STOP 1716338259238
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-20, 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 r048-tajo-171620399900605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 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 '
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 ;