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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 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 189K 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-19-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716337634413

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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 00:27:15] [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:27:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:27:16] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2024-05-22 00:27:16] [INFO ] Transformed 772 places.
[2024-05-22 00:27:16] [INFO ] Transformed 685 transitions.
[2024-05-22 00:27:16] [INFO ] Found NUPN structural information;
[2024-05-22 00:27:16] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 542 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 21 ms.
Deduced a syphon composed of 15 places in 26 ms
Reduce places removed 15 places and 15 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 670 rows 757 cols
[2024-05-22 00:27:16] [INFO ] Computed 125 invariants in 72 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 (55 resets) in 50 ms. (196 steps per ms)
FORMULA BusinessProcesses-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (75 resets) in 143 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-22 00:27:17] [INFO ] Invariant cache hit.
[2024-05-22 00:27:17] [INFO ] [Real]Absence check using 78 positive place invariants in 45 ms returned sat
[2024-05-22 00:27:17] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 42 ms returned sat
[2024-05-22 00:27:18] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 8 places in 417 ms of which 50 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:27:19] [INFO ] [Nat]Absence check using 78 positive place invariants in 45 ms returned sat
[2024-05-22 00:27:19] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 13 ms returned sat
[2024-05-22 00:27:19] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2024-05-22 00:27:19] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 4 ms to minimize.
[2024-05-22 00:27:19] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 11 ms to minimize.
[2024-05-22 00:27:20] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 4 ms to minimize.
[2024-05-22 00:27:22] [INFO ] Deduced a trap composed of 18 places in 2352 ms of which 38 ms to minimize.
[2024-05-22 00:27:22] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 20 ms to minimize.
[2024-05-22 00:27:22] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 4 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 5 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 6 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 5 ms to minimize.
[2024-05-22 00:27:23] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 3 ms to minimize.
[2024-05-22 00:27:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:27:24] [INFO ] [Real]Absence check using 78 positive place invariants in 81 ms returned sat
[2024-05-22 00:27:24] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 23 ms returned sat
[2024-05-22 00:27:26] [INFO ] [Real]Absence check using state equation in 2312 ms returned sat
[2024-05-22 00:27:26] [INFO ] Deduced a trap composed of 14 places in 340 ms of which 4 ms to minimize.
[2024-05-22 00:27:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:27:27] [INFO ] [Nat]Absence check using 78 positive place invariants in 45 ms returned sat
[2024-05-22 00:27:27] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 22 ms returned sat
[2024-05-22 00:27:27] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 3 ms to minimize.
[2024-05-22 00:27:27] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 3 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 12 places in 329 ms of which 3 ms to minimize.
[2024-05-22 00:27:28] [INFO ] Deduced a trap composed of 16 places in 341 ms of which 4 ms to minimize.
[2024-05-22 00:27:29] [INFO ] Deduced a trap composed of 11 places in 355 ms of which 3 ms to minimize.
[2024-05-22 00:27:29] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 4 ms to minimize.
[2024-05-22 00:27:29] [INFO ] Deduced a trap composed of 141 places in 270 ms of which 4 ms to minimize.
[2024-05-22 00:27:29] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 4 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 4 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 3 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:27:31] [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: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:27:32] [INFO ] [Real]Absence check using 78 positive place invariants in 35 ms returned sat
[2024-05-22 00:27:32] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2024-05-22 00:27:32] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2024-05-22 00:27:32] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 7 ms to minimize.
[2024-05-22 00:27:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:27:32] [INFO ] [Nat]Absence check using 78 positive place invariants in 35 ms returned sat
[2024-05-22 00:27:32] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2024-05-22 00:27:33] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 6 ms to minimize.
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 5 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 5 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 4 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 128 places in 265 ms of which 4 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 5 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 4 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 4 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 5 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 4 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 157 places in 222 ms of which 4 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 150 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 151 places in 244 ms of which 5 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 5 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 6 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 4 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:27:37] [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:27:37] [INFO ] [Real]Absence check using 78 positive place invariants in 33 ms returned sat
[2024-05-22 00:27:38] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 18 ms returned sat
[2024-05-22 00:27:38] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 10 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:27:38] [INFO ] [Nat]Absence check using 78 positive place invariants in 36 ms returned sat
[2024-05-22 00:27:38] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2024-05-22 00:27:39] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 5 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 7 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 4 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 5 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 4 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 3 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 136 places in 237 ms of which 4 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 4 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 4 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 5 ms to minimize.
[2024-05-22 00:27:41] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 3 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 138 places in 216 ms of which 4 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 4 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 4 ms to minimize.
[2024-05-22 00:27:42] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 4 ms to minimize.
[2024-05-22 00:27:43] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 4 ms to minimize.
[2024-05-22 00:27:43] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:27:43] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:27:43] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:27: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 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:27:43] [INFO ] [Real]Absence check using 78 positive place invariants in 34 ms returned sat
[2024-05-22 00:27:43] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2024-05-22 00:27:44] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2024-05-22 00:27:44] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 4 ms to minimize.
[2024-05-22 00:27:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:27:44] [INFO ] [Nat]Absence check using 78 positive place invariants in 35 ms returned sat
[2024-05-22 00:27:44] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2024-05-22 00:27:44] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 5 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 5 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 4 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 5 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 4 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 4 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 47 places in 288 ms of which 5 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 168 places in 222 ms of which 4 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 3 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 5 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 149 places in 215 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 144 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 147 places in 207 ms of which 4 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 147 places in 190 ms of which 4 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 5 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 146 places in 181 ms of which 4 ms to minimize.
[2024-05-22 00:27:49] [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:27:49] [INFO ] [Real]Absence check using 78 positive place invariants in 30 ms returned sat
[2024-05-22 00:27:49] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 14 ms returned sat
[2024-05-22 00:27:49] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 4 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:27:50] [INFO ] [Nat]Absence check using 78 positive place invariants in 51 ms returned sat
[2024-05-22 00:27:50] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 12 ms returned sat
[2024-05-22 00:27:50] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 4 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 5 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 4 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 4 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 159 places in 212 ms of which 4 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 4 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 4 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 4 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 154 places in 211 ms of which 4 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 42 places in 300 ms of which 4 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 159 places in 219 ms of which 5 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 170 places in 235 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 4 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 161 places in 221 ms of which 4 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 3 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 4 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 155 places in 190 ms of which 4 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Trap strengthening (SAT) tested/added 20/20 trap constraints in 4439 ms
[2024-05-22 00:27:55] [INFO ] [Real]Absence check using 78 positive place invariants in 33 ms returned sat
[2024-05-22 00:27:55] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 18 ms returned sat
[2024-05-22 00:27:55] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 5 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:27:56] [INFO ] [Nat]Absence check using 78 positive place invariants in 47 ms returned sat
[2024-05-22 00:27:56] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 24 ms returned sat
[2024-05-22 00:27:56] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 5 ms to minimize.
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 5 ms to minimize.
[2024-05-22 00:27:57] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 5 ms to minimize.
[2024-05-22 00:27:58] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 3 ms to minimize.
[2024-05-22 00:27:58] [INFO ] Deduced a trap composed of 13 places in 289 ms of which 5 ms to minimize.
[2024-05-22 00:27:58] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 5 ms to minimize.
[2024-05-22 00:27:59] [INFO ] Deduced a trap composed of 16 places in 333 ms of which 5 ms to minimize.
[2024-05-22 00:27:59] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 5 ms to minimize.
[2024-05-22 00:27:59] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 4 ms to minimize.
[2024-05-22 00:27:59] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 4 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 4 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 4 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 4 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 4 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 5 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 8 places in 597 ms of which 18 ms to minimize.
[2024-05-22 00:28: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 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: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:28:02] [INFO ] [Real]Absence check using 78 positive place invariants in 38 ms returned sat
[2024-05-22 00:28:02] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 23 ms returned sat
[2024-05-22 00:28:02] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 5 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:28:03] [INFO ] [Nat]Absence check using 78 positive place invariants in 28 ms returned sat
[2024-05-22 00:28:03] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 14 ms returned sat
[2024-05-22 00:28:03] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 5 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 8 places in 297 ms of which 5 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 12 places in 285 ms of which 4 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 3 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 4 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 5 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 5 ms to minimize.
[2024-05-22 00:28:06] [INFO ] Deduced a trap composed of 26 places in 396 ms of which 8 ms to minimize.
[2024-05-22 00:28:06] [INFO ] Deduced a trap composed of 25 places in 331 ms of which 6 ms to minimize.
[2024-05-22 00:28:06] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 5 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 26 places in 325 ms of which 7 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 20 places in 313 ms of which 6 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 4 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 20 places in 313 ms of which 31 ms to minimize.
[2024-05-22 00:28:08] [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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 430 edges and 757 vertex of which 7 / 757 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 1512 edges and 751 vertex of which 742 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 742 transition count 492
Reduce places removed 169 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 172 rules applied. Total rules applied 343 place count 573 transition count 489
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 346 place count 570 transition count 489
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 346 place count 570 transition count 376
Deduced a syphon composed of 113 places in 3 ms
Ensure Unique test removed 23 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 249 rules applied. Total rules applied 595 place count 434 transition count 376
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 691 place count 338 transition count 280
Iterating global reduction 3 with 96 rules applied. Total rules applied 787 place count 338 transition count 280
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 787 place count 338 transition count 273
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 801 place count 331 transition count 273
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 802 place count 330 transition count 272
Iterating global reduction 3 with 1 rules applied. Total rules applied 803 place count 330 transition count 272
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1045 place count 208 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1047 place count 207 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1049 place count 207 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1051 place count 205 transition count 153
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 1052 place count 205 transition count 153
Applied a total of 1052 rules in 238 ms. Remains 205 /757 variables (removed 552) and now considering 153/670 (removed 517) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 205/757 places, 153/670 transitions.
// Phase 1: matrix 153 rows 205 cols
[2024-05-22 00:28:08] [INFO ] Computed 92 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (46144 resets) in 3224 ms. (310 steps per ms)
FORMULA BusinessProcesses-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (23728 resets) in 2197 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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:28:14] [INFO ] Flatten gal took : 83 ms
[2024-05-22 00:28:14] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:28:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2650404865765432752.gal : 15 ms
[2024-05-22 00:28:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10644558635572451911.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/ReachabilityCardinality2650404865765432752.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10644558635572451911.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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 58413 ms.

BK_STOP 1716337694439

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-19"
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-19, 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-171620399800597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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