Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r041-smll-174853822500012.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is BusinessProcesses-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-smll-174853822500012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 146K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748547123740

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:32:05] [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]
[2025-05-29 19:32:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:32:06] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2025-05-29 19:32:06] [INFO ] Transformed 586 places.
[2025-05-29 19:32:06] [INFO ] Transformed 525 transitions.
[2025-05-29 19:32:06] [INFO ] Found NUPN structural information;
[2025-05-29 19:32:06] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 521 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 28 ms.
Deduced a syphon composed of 4 places in 22 ms
Reduce places removed 4 places and 4 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 521 rows 582 cols
[2025-05-29 19:32:06] [INFO ] Computed 98 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 (75 resets) in 107 ms. (92 steps per ms)
FORMULA BusinessProcesses-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (118 resets) in 206 ms. (434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-29 19:32:07] [INFO ] Invariant cache hit.
[2025-05-29 19:32:07] [INFO ] [Real]Absence check using 55 positive place invariants in 49 ms returned sat
[2025-05-29 19:32:08] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 30 ms returned sat
[2025-05-29 19:32:08] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2025-05-29 19:32:09] [INFO ] Deduced a trap composed of 18 places in 581 ms of which 83 ms to minimize.
[2025-05-29 19:32:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:32:09] [INFO ] [Nat]Absence check using 55 positive place invariants in 51 ms returned sat
[2025-05-29 19:32:09] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 48 ms returned sat
[2025-05-29 19:32:10] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2025-05-29 19:32:10] [INFO ] Deduced a trap composed of 18 places in 428 ms of which 9 ms to minimize.
[2025-05-29 19:32:11] [INFO ] Deduced a trap composed of 16 places in 504 ms of which 8 ms to minimize.
[2025-05-29 19:32:11] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 6 ms to minimize.
[2025-05-29 19:32:12] [INFO ] Deduced a trap composed of 8 places in 342 ms of which 5 ms to minimize.
[2025-05-29 19:32:12] [INFO ] Deduced a trap composed of 14 places in 339 ms of which 5 ms to minimize.
[2025-05-29 19:32:12] [INFO ] Deduced a trap composed of 24 places in 315 ms of which 6 ms to minimize.
[2025-05-29 19:32:13] [INFO ] Deduced a trap composed of 23 places in 321 ms of which 5 ms to minimize.
[2025-05-29 19:32:13] [INFO ] Deduced a trap composed of 16 places in 358 ms of which 6 ms to minimize.
[2025-05-29 19:32:13] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 4 ms to minimize.
[2025-05-29 19:32:14] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 4 ms to minimize.
[2025-05-29 19:32:14] [INFO ] Deduced a trap composed of 17 places in 362 ms of which 5 ms to minimize.
[2025-05-29 19:32:14] [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)
[2025-05-29 19:32:14] [INFO ] [Real]Absence check using 55 positive place invariants in 39 ms returned sat
[2025-05-29 19:32:14] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 28 ms returned sat
[2025-05-29 19:32:15] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2025-05-29 19:32:15] [INFO ] Deduced a trap composed of 18 places in 324 ms of which 5 ms to minimize.
[2025-05-29 19:32:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:32:15] [INFO ] [Nat]Absence check using 55 positive place invariants in 41 ms returned sat
[2025-05-29 19:32:15] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 33 ms returned sat
[2025-05-29 19:32:16] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2025-05-29 19:32:16] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 4 ms to minimize.
[2025-05-29 19:32:16] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 4 ms to minimize.
[2025-05-29 19:32:16] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 4 ms to minimize.
[2025-05-29 19:32:17] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 6 ms to minimize.
[2025-05-29 19:32:17] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 5 ms to minimize.
[2025-05-29 19:32:17] [INFO ] Deduced a trap composed of 28 places in 281 ms of which 5 ms to minimize.
[2025-05-29 19:32:18] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 6 ms to minimize.
[2025-05-29 19:32:18] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 3 ms to minimize.
[2025-05-29 19:32:18] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 5 ms to minimize.
[2025-05-29 19:32:18] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 4 ms to minimize.
[2025-05-29 19:32:19] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 5 ms to minimize.
[2025-05-29 19:32:19] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 3 ms to minimize.
[2025-05-29 19:32:19] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 5 ms to minimize.
[2025-05-29 19:32:19] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 4 ms to minimize.
[2025-05-29 19:32:20] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 5 ms to minimize.
[2025-05-29 19:32:20] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 6 ms to minimize.
[2025-05-29 19:32:20] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 4 ms to minimize.
[2025-05-29 19:32:20] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 4 ms to minimize.
[2025-05-29 19:32:20] [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)
[2025-05-29 19:32:21] [INFO ] [Real]Absence check using 55 positive place invariants in 50 ms returned sat
[2025-05-29 19:32:21] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 33 ms returned sat
[2025-05-29 19:32:21] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2025-05-29 19:32:21] [INFO ] Deduced a trap composed of 111 places in 422 ms of which 7 ms to minimize.
[2025-05-29 19:32:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:32:22] [INFO ] [Nat]Absence check using 55 positive place invariants in 56 ms returned sat
[2025-05-29 19:32:22] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 33 ms returned sat
[2025-05-29 19:32:22] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2025-05-29 19:32:23] [INFO ] Deduced a trap composed of 111 places in 399 ms of which 8 ms to minimize.
[2025-05-29 19:32:23] [INFO ] Deduced a trap composed of 13 places in 443 ms of which 8 ms to minimize.
[2025-05-29 19:32:24] [INFO ] Deduced a trap composed of 11 places in 453 ms of which 8 ms to minimize.
[2025-05-29 19:32:24] [INFO ] Deduced a trap composed of 12 places in 461 ms of which 7 ms to minimize.
[2025-05-29 19:32:25] [INFO ] Deduced a trap composed of 26 places in 447 ms of which 7 ms to minimize.
[2025-05-29 19:32:25] [INFO ] Deduced a trap composed of 21 places in 447 ms of which 7 ms to minimize.
[2025-05-29 19:32:26] [INFO ] Deduced a trap composed of 11 places in 447 ms of which 9 ms to minimize.
[2025-05-29 19:32:26] [INFO ] Deduced a trap composed of 14 places in 476 ms of which 7 ms to minimize.
[2025-05-29 19:32:27] [INFO ] Deduced a trap composed of 106 places in 475 ms of which 7 ms to minimize.
[2025-05-29 19:32:27] [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)
[2025-05-29 19:32:27] [INFO ] [Real]Absence check using 55 positive place invariants in 67 ms returned sat
[2025-05-29 19:32:27] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 37 ms returned sat
[2025-05-29 19:32:28] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2025-05-29 19:32:28] [INFO ] Deduced a trap composed of 15 places in 441 ms of which 7 ms to minimize.
[2025-05-29 19:32:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:32:28] [INFO ] [Nat]Absence check using 55 positive place invariants in 52 ms returned sat
[2025-05-29 19:32:28] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 27 ms returned sat
[2025-05-29 19:32:29] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2025-05-29 19:32:29] [INFO ] Deduced a trap composed of 15 places in 414 ms of which 6 ms to minimize.
[2025-05-29 19:32:30] [INFO ] Deduced a trap composed of 12 places in 439 ms of which 7 ms to minimize.
[2025-05-29 19:32:30] [INFO ] Deduced a trap composed of 17 places in 475 ms of which 7 ms to minimize.
[2025-05-29 19:32:31] [INFO ] Deduced a trap composed of 31 places in 497 ms of which 7 ms to minimize.
[2025-05-29 19:32:31] [INFO ] Deduced a trap composed of 23 places in 488 ms of which 7 ms to minimize.
[2025-05-29 19:32:32] [INFO ] Deduced a trap composed of 18 places in 431 ms of which 7 ms to minimize.
[2025-05-29 19:32:32] [INFO ] Deduced a trap composed of 121 places in 421 ms of which 16 ms to minimize.
[2025-05-29 19:32:33] [INFO ] Deduced a trap composed of 20 places in 414 ms of which 7 ms to minimize.
[2025-05-29 19:32:33] [INFO ] Deduced a trap composed of 38 places in 465 ms of which 10 ms to minimize.
[2025-05-29 19:32:33] [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)
[2025-05-29 19:32:33] [INFO ] [Real]Absence check using 55 positive place invariants in 51 ms returned sat
[2025-05-29 19:32:34] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 32 ms returned sat
[2025-05-29 19:32:34] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2025-05-29 19:32:34] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 5 ms to minimize.
[2025-05-29 19:32:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:32:35] [INFO ] [Nat]Absence check using 55 positive place invariants in 55 ms returned sat
[2025-05-29 19:32:35] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 37 ms returned sat
[2025-05-29 19:32:35] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2025-05-29 19:32:36] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 9 ms to minimize.
[2025-05-29 19:32:36] [INFO ] Deduced a trap composed of 14 places in 302 ms of which 5 ms to minimize.
[2025-05-29 19:32:36] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 5 ms to minimize.
[2025-05-29 19:32:37] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 5 ms to minimize.
[2025-05-29 19:32:37] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 6 ms to minimize.
[2025-05-29 19:32:37] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 4 ms to minimize.
[2025-05-29 19:32:37] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 4 ms to minimize.
[2025-05-29 19:32:37] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 4 ms to minimize.
[2025-05-29 19:32:38] [INFO ] Deduced a trap composed of 39 places in 282 ms of which 5 ms to minimize.
[2025-05-29 19:32:38] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 5 ms to minimize.
[2025-05-29 19:32:38] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 5 ms to minimize.
[2025-05-29 19:32:39] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 5 ms to minimize.
[2025-05-29 19:32:39] [INFO ] Deduced a trap composed of 36 places in 303 ms of which 5 ms to minimize.
[2025-05-29 19:32:39] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 5 ms to minimize.
[2025-05-29 19:32:40] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 5 ms to minimize.
[2025-05-29 19:32:40] [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)
[2025-05-29 19:32:40] [INFO ] [Real]Absence check using 55 positive place invariants in 48 ms returned sat
[2025-05-29 19:32:40] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 32 ms returned sat
[2025-05-29 19:32:40] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2025-05-29 19:32:41] [INFO ] Deduced a trap composed of 12 places in 471 ms of which 7 ms to minimize.
[2025-05-29 19:32:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:32:41] [INFO ] [Nat]Absence check using 55 positive place invariants in 51 ms returned sat
[2025-05-29 19:32:41] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 35 ms returned sat
[2025-05-29 19:32:42] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2025-05-29 19:32:42] [INFO ] Deduced a trap composed of 12 places in 401 ms of which 7 ms to minimize.
[2025-05-29 19:32:43] [INFO ] Deduced a trap composed of 18 places in 473 ms of which 7 ms to minimize.
[2025-05-29 19:32:43] [INFO ] Deduced a trap composed of 11 places in 454 ms of which 7 ms to minimize.
[2025-05-29 19:32:44] [INFO ] Deduced a trap composed of 14 places in 455 ms of which 7 ms to minimize.
[2025-05-29 19:32:44] [INFO ] Deduced a trap composed of 15 places in 453 ms of which 7 ms to minimize.
[2025-05-29 19:32:44] [INFO ] Deduced a trap composed of 22 places in 359 ms of which 7 ms to minimize.
[2025-05-29 19:32:45] [INFO ] Deduced a trap composed of 24 places in 450 ms of which 8 ms to minimize.
[2025-05-29 19:32:45] [INFO ] Deduced a trap composed of 25 places in 443 ms of which 7 ms to minimize.
[2025-05-29 19:32:46] [INFO ] Deduced a trap composed of 17 places in 475 ms of which 8 ms to minimize.
[2025-05-29 19:32:46] [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)
[2025-05-29 19:32:46] [INFO ] [Real]Absence check using 55 positive place invariants in 51 ms returned sat
[2025-05-29 19:32:46] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 33 ms returned sat
[2025-05-29 19:32:47] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2025-05-29 19:32:47] [INFO ] Deduced a trap composed of 11 places in 416 ms of which 7 ms to minimize.
[2025-05-29 19:32:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:32:48] [INFO ] [Nat]Absence check using 55 positive place invariants in 52 ms returned sat
[2025-05-29 19:32:48] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 33 ms returned sat
[2025-05-29 19:32:48] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2025-05-29 19:32:48] [INFO ] Deduced a trap composed of 11 places in 387 ms of which 7 ms to minimize.
[2025-05-29 19:32:49] [INFO ] Deduced a trap composed of 12 places in 416 ms of which 7 ms to minimize.
[2025-05-29 19:32:49] [INFO ] Deduced a trap composed of 17 places in 426 ms of which 7 ms to minimize.
[2025-05-29 19:32:50] [INFO ] Deduced a trap composed of 16 places in 378 ms of which 7 ms to minimize.
[2025-05-29 19:32:50] [INFO ] Deduced a trap composed of 18 places in 392 ms of which 7 ms to minimize.
[2025-05-29 19:32:51] [INFO ] Deduced a trap composed of 23 places in 423 ms of which 7 ms to minimize.
[2025-05-29 19:32:51] [INFO ] Deduced a trap composed of 22 places in 384 ms of which 6 ms to minimize.
[2025-05-29 19:32:52] [INFO ] Deduced a trap composed of 24 places in 505 ms of which 8 ms to minimize.
[2025-05-29 19:32:52] [INFO ] Deduced a trap composed of 17 places in 491 ms of which 8 ms to minimize.
[2025-05-29 19:32:53] [INFO ] Deduced a trap composed of 21 places in 478 ms of which 8 ms to minimize.
[2025-05-29 19:32:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
[2025-05-29 19:32:53] [INFO ] [Real]Absence check using 55 positive place invariants in 51 ms returned sat
[2025-05-29 19:32:53] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 35 ms returned sat
[2025-05-29 19:32:53] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2025-05-29 19:32:54] [INFO ] Deduced a trap composed of 12 places in 485 ms of which 8 ms to minimize.
[2025-05-29 19:32:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:32:54] [INFO ] [Nat]Absence check using 55 positive place invariants in 53 ms returned sat
[2025-05-29 19:32:54] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 31 ms returned sat
[2025-05-29 19:32:55] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2025-05-29 19:32:55] [INFO ] Deduced a trap composed of 12 places in 431 ms of which 7 ms to minimize.
[2025-05-29 19:32:56] [INFO ] Deduced a trap composed of 29 places in 476 ms of which 8 ms to minimize.
[2025-05-29 19:32:56] [INFO ] Deduced a trap composed of 15 places in 484 ms of which 8 ms to minimize.
[2025-05-29 19:32:57] [INFO ] Deduced a trap composed of 11 places in 458 ms of which 8 ms to minimize.
[2025-05-29 19:32:57] [INFO ] Deduced a trap composed of 116 places in 462 ms of which 7 ms to minimize.
[2025-05-29 19:32:58] [INFO ] Deduced a trap composed of 30 places in 404 ms of which 8 ms to minimize.
[2025-05-29 19:32:58] [INFO ] Deduced a trap composed of 12 places in 535 ms of which 7 ms to minimize.
[2025-05-29 19:32:59] [INFO ] Deduced a trap composed of 28 places in 520 ms of which 8 ms to minimize.
[2025-05-29 19:32:59] [INFO ] Deduced a trap composed of 136 places in 441 ms of which 7 ms to minimize.
[2025-05-29 19:32:59] [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)
[2025-05-29 19:33:00] [INFO ] [Real]Absence check using 55 positive place invariants in 54 ms returned sat
[2025-05-29 19:33:00] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 32 ms returned sat
[2025-05-29 19:33:00] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2025-05-29 19:33:01] [INFO ] Deduced a trap composed of 20 places in 520 ms of which 7 ms to minimize.
[2025-05-29 19:33:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:33:01] [INFO ] [Nat]Absence check using 55 positive place invariants in 53 ms returned sat
[2025-05-29 19:33:01] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 36 ms returned sat
[2025-05-29 19:33:01] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2025-05-29 19:33:02] [INFO ] Deduced a trap composed of 20 places in 479 ms of which 7 ms to minimize.
[2025-05-29 19:33:03] [INFO ] Deduced a trap composed of 15 places in 468 ms of which 8 ms to minimize.
[2025-05-29 19:33:03] [INFO ] Deduced a trap composed of 21 places in 481 ms of which 8 ms to minimize.
[2025-05-29 19:33:03] [INFO ] Deduced a trap composed of 12 places in 421 ms of which 8 ms to minimize.
[2025-05-29 19:33:04] [INFO ] Deduced a trap composed of 17 places in 458 ms of which 7 ms to minimize.
[2025-05-29 19:33:04] [INFO ] Deduced a trap composed of 115 places in 449 ms of which 7 ms to minimize.
[2025-05-29 19:33:05] [INFO ] Deduced a trap composed of 21 places in 490 ms of which 7 ms to minimize.
[2025-05-29 19:33:05] [INFO ] Deduced a trap composed of 24 places in 407 ms of which 7 ms to minimize.
[2025-05-29 19:33:06] [INFO ] Deduced a trap composed of 16 places in 487 ms of which 8 ms to minimize.
[2025-05-29 19:33:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 325 edges and 582 vertex of which 7 / 582 are part of one of the 1 SCC in 10 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 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 128 place count 572 transition count 386
Reduce places removed 126 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 127 rules applied. Total rules applied 255 place count 446 transition count 385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 445 transition count 385
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 256 place count 445 transition count 298
Deduced a syphon composed of 87 places in 4 ms
Ensure Unique test removed 16 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 446 place count 342 transition count 298
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 517 place count 271 transition count 227
Iterating global reduction 3 with 71 rules applied. Total rules applied 588 place count 271 transition count 227
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 588 place count 271 transition count 221
Deduced a syphon composed of 6 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 601 place count 264 transition count 221
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 181 rules applied. Total rules applied 782 place count 172 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 784 place count 171 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 786 place count 171 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 788 place count 169 transition count 134
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 792 place count 169 transition count 134
Applied a total of 792 rules in 320 ms. Remains 169 /582 variables (removed 413) and now considering 134/521 (removed 387) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 169/582 places, 134/521 transitions.
// Phase 1: matrix 134 rows 169 cols
[2025-05-29 19:33:06] [INFO ] Computed 75 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (33450 resets) in 4398 ms. (227 steps per ms)
FORMULA BusinessProcesses-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (18063 resets) in 2307 ms. (433 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 )
[2025-05-29 19:33:13] [INFO ] Flatten gal took : 87 ms
[2025-05-29 19:33:14] [INFO ] Flatten gal took : 28 ms
[2025-05-29 19:33:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17185627060675231579.gal : 17 ms
[2025-05-29 19:33:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9753940649204526088.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/ReachabilityCardinality17185627060675231579.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9753940649204526088.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 68212 ms.

BK_STOP 1748547194147

--------------------
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//
++ perl -pe 's/.*\.//g'
++ 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-12"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is BusinessProcesses-PT-12, 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 r041-smll-174853822500012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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