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-174853822500020.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-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-smll-174853822500020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 195K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K 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 192K 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-20-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748547431971

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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:37:14] [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:37:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:37:15] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2025-05-29 19:37:15] [INFO ] Transformed 782 places.
[2025-05-29 19:37:15] [INFO ] Transformed 697 transitions.
[2025-05-29 19:37:15] [INFO ] Found NUPN structural information;
[2025-05-29 19:37:15] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 525 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 63 places in 20 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 638 rows 719 cols
[2025-05-29 19:37:15] [INFO ] Computed 121 invariants in 93 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (51 resets) in 81 ms. (121 steps per ms)
FORMULA BusinessProcesses-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (55 resets) in 129 ms. (461 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 19:37:15] [INFO ] Invariant cache hit.
[2025-05-29 19:37:16] [INFO ] [Real]Absence check using 78 positive place invariants in 67 ms returned sat
[2025-05-29 19:37:16] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 28 ms returned sat
[2025-05-29 19:37:17] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2025-05-29 19:37:17] [INFO ] Deduced a trap composed of 8 places in 680 ms of which 64 ms to minimize.
[2025-05-29 19:37:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:37:18] [INFO ] [Nat]Absence check using 78 positive place invariants in 72 ms returned sat
[2025-05-29 19:37:18] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 26 ms returned sat
[2025-05-29 19:37:19] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2025-05-29 19:37:19] [INFO ] Deduced a trap composed of 8 places in 534 ms of which 10 ms to minimize.
[2025-05-29 19:37:20] [INFO ] Deduced a trap composed of 25 places in 553 ms of which 20 ms to minimize.
[2025-05-29 19:37:20] [INFO ] Deduced a trap composed of 18 places in 604 ms of which 9 ms to minimize.
[2025-05-29 19:37:21] [INFO ] Deduced a trap composed of 18 places in 686 ms of which 10 ms to minimize.
[2025-05-29 19:37:22] [INFO ] Deduced a trap composed of 31 places in 571 ms of which 9 ms to minimize.
[2025-05-29 19:37:22] [INFO ] Deduced a trap composed of 15 places in 629 ms of which 10 ms to minimize.
[2025-05-29 19:37:23] [INFO ] Deduced a trap composed of 43 places in 519 ms of which 9 ms to minimize.
[2025-05-29 19:37: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)
[2025-05-29 19:37:23] [INFO ] [Real]Absence check using 78 positive place invariants in 69 ms returned sat
[2025-05-29 19:37:23] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 30 ms returned sat
[2025-05-29 19:37:24] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2025-05-29 19:37:25] [INFO ] Deduced a trap composed of 26 places in 702 ms of which 10 ms to minimize.
[2025-05-29 19:37:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:37:25] [INFO ] [Nat]Absence check using 78 positive place invariants in 74 ms returned sat
[2025-05-29 19:37:25] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 39 ms returned sat
[2025-05-29 19:37:25] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2025-05-29 19:37:26] [INFO ] Deduced a trap composed of 26 places in 583 ms of which 9 ms to minimize.
[2025-05-29 19:37:27] [INFO ] Deduced a trap composed of 18 places in 464 ms of which 6 ms to minimize.
[2025-05-29 19:37:27] [INFO ] Deduced a trap composed of 46 places in 445 ms of which 6 ms to minimize.
[2025-05-29 19:37:28] [INFO ] Deduced a trap composed of 26 places in 465 ms of which 6 ms to minimize.
[2025-05-29 19:37:28] [INFO ] Deduced a trap composed of 172 places in 697 ms of which 19 ms to minimize.
[2025-05-29 19:37:29] [INFO ] Deduced a trap composed of 172 places in 592 ms of which 6 ms to minimize.
[2025-05-29 19:37:30] [INFO ] Deduced a trap composed of 29 places in 524 ms of which 7 ms to minimize.
[2025-05-29 19:37:30] [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:37:30] [INFO ] [Real]Absence check using 78 positive place invariants in 74 ms returned sat
[2025-05-29 19:37:30] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 32 ms returned sat
[2025-05-29 19:37:31] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2025-05-29 19:37:31] [INFO ] Deduced a trap composed of 18 places in 471 ms of which 8 ms to minimize.
[2025-05-29 19:37:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:37:31] [INFO ] [Nat]Absence check using 78 positive place invariants in 71 ms returned sat
[2025-05-29 19:37:31] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 40 ms returned sat
[2025-05-29 19:37:32] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2025-05-29 19:37:33] [INFO ] Deduced a trap composed of 18 places in 578 ms of which 9 ms to minimize.
[2025-05-29 19:37:33] [INFO ] Deduced a trap composed of 8 places in 533 ms of which 6 ms to minimize.
[2025-05-29 19:37:34] [INFO ] Deduced a trap composed of 13 places in 424 ms of which 6 ms to minimize.
[2025-05-29 19:37:34] [INFO ] Deduced a trap composed of 15 places in 553 ms of which 9 ms to minimize.
[2025-05-29 19:37:35] [INFO ] Deduced a trap composed of 22 places in 540 ms of which 9 ms to minimize.
[2025-05-29 19:37:35] [INFO ] Deduced a trap composed of 28 places in 584 ms of which 8 ms to minimize.
[2025-05-29 19:37:36] [INFO ] Deduced a trap composed of 42 places in 550 ms of which 8 ms to minimize.
[2025-05-29 19:37:37] [INFO ] Deduced a trap composed of 147 places in 521 ms of which 9 ms to minimize.
[2025-05-29 19:37: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)
[2025-05-29 19:37:37] [INFO ] [Real]Absence check using 78 positive place invariants in 80 ms returned sat
[2025-05-29 19:37:37] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 41 ms returned sat
[2025-05-29 19:37:38] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2025-05-29 19:37:38] [INFO ] Deduced a trap composed of 22 places in 546 ms of which 8 ms to minimize.
[2025-05-29 19:37:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:37:39] [INFO ] [Nat]Absence check using 78 positive place invariants in 59 ms returned sat
[2025-05-29 19:37:39] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 50 ms returned sat
[2025-05-29 19:37:39] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2025-05-29 19:37:40] [INFO ] Deduced a trap composed of 22 places in 473 ms of which 7 ms to minimize.
[2025-05-29 19:37:40] [INFO ] Deduced a trap composed of 20 places in 528 ms of which 8 ms to minimize.
[2025-05-29 19:37:41] [INFO ] Deduced a trap composed of 15 places in 459 ms of which 6 ms to minimize.
[2025-05-29 19:37:41] [INFO ] Deduced a trap composed of 160 places in 465 ms of which 12 ms to minimize.
[2025-05-29 19:37:42] [INFO ] Deduced a trap composed of 8 places in 512 ms of which 8 ms to minimize.
[2025-05-29 19:37:42] [INFO ] Deduced a trap composed of 22 places in 522 ms of which 8 ms to minimize.
[2025-05-29 19:37:43] [INFO ] Deduced a trap composed of 20 places in 441 ms of which 6 ms to minimize.
[2025-05-29 19:37:43] [INFO ] Deduced a trap composed of 32 places in 435 ms of which 5 ms to minimize.
[2025-05-29 19:37: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)
[2025-05-29 19:37:44] [INFO ] [Real]Absence check using 78 positive place invariants in 70 ms returned sat
[2025-05-29 19:37:44] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 21 ms returned sat
[2025-05-29 19:37:44] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2025-05-29 19:37:45] [INFO ] Deduced a trap composed of 18 places in 500 ms of which 9 ms to minimize.
[2025-05-29 19:37:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:37:45] [INFO ] [Nat]Absence check using 78 positive place invariants in 78 ms returned sat
[2025-05-29 19:37:45] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 30 ms returned sat
[2025-05-29 19:37:46] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2025-05-29 19:37:46] [INFO ] Deduced a trap composed of 18 places in 567 ms of which 9 ms to minimize.
[2025-05-29 19:37:47] [INFO ] Deduced a trap composed of 26 places in 546 ms of which 9 ms to minimize.
[2025-05-29 19:37:48] [INFO ] Deduced a trap composed of 30 places in 598 ms of which 9 ms to minimize.
[2025-05-29 19:37:48] [INFO ] Deduced a trap composed of 48 places in 585 ms of which 9 ms to minimize.
[2025-05-29 19:37:49] [INFO ] Deduced a trap composed of 26 places in 477 ms of which 9 ms to minimize.
[2025-05-29 19:37:49] [INFO ] Deduced a trap composed of 25 places in 525 ms of which 9 ms to minimize.
[2025-05-29 19:37:50] [INFO ] Deduced a trap composed of 42 places in 469 ms of which 9 ms to minimize.
[2025-05-29 19:37:50] [INFO ] Deduced a trap composed of 58 places in 533 ms of which 9 ms to minimize.
[2025-05-29 19:37:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:37:51] [INFO ] [Real]Absence check using 78 positive place invariants in 78 ms returned sat
[2025-05-29 19:37:51] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 31 ms returned sat
[2025-05-29 19:37:51] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2025-05-29 19:37:52] [INFO ] Deduced a trap composed of 16 places in 516 ms of which 8 ms to minimize.
[2025-05-29 19:37:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:37:52] [INFO ] [Nat]Absence check using 78 positive place invariants in 79 ms returned sat
[2025-05-29 19:37:52] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 33 ms returned sat
[2025-05-29 19:37:53] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2025-05-29 19:37:53] [INFO ] Deduced a trap composed of 16 places in 544 ms of which 9 ms to minimize.
[2025-05-29 19:37:54] [INFO ] Deduced a trap composed of 8 places in 513 ms of which 9 ms to minimize.
[2025-05-29 19:37:55] [INFO ] Deduced a trap composed of 45 places in 530 ms of which 9 ms to minimize.
[2025-05-29 19:37:55] [INFO ] Deduced a trap composed of 19 places in 502 ms of which 9 ms to minimize.
[2025-05-29 19:37:56] [INFO ] Deduced a trap composed of 18 places in 463 ms of which 9 ms to minimize.
[2025-05-29 19:37:56] [INFO ] Deduced a trap composed of 160 places in 524 ms of which 8 ms to minimize.
[2025-05-29 19:37:57] [INFO ] Deduced a trap composed of 153 places in 440 ms of which 10 ms to minimize.
[2025-05-29 19:37:57] [INFO ] Deduced a trap composed of 15 places in 518 ms of which 9 ms to minimize.
[2025-05-29 19:37:57] [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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 408 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 9 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 686 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.5 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 167 place count 686 transition count 452
Reduce places removed 165 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 167 rules applied. Total rules applied 334 place count 521 transition count 450
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 336 place count 519 transition count 450
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 336 place count 519 transition count 348
Deduced a syphon composed of 102 places in 3 ms
Ensure Unique test removed 22 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 562 place count 395 transition count 348
Discarding 88 places :
Symmetric choice reduction at 3 with 88 rule applications. Total rules 650 place count 307 transition count 260
Iterating global reduction 3 with 88 rules applied. Total rules applied 738 place count 307 transition count 260
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 738 place count 307 transition count 251
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 758 place count 296 transition count 251
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 972 place count 188 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 976 place count 186 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 978 place count 186 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 980 place count 184 transition count 150
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 981 place count 184 transition count 150
Applied a total of 981 rules in 421 ms. Remains 184 /719 variables (removed 535) and now considering 150/638 (removed 488) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 184/719 places, 150/638 transitions.
[2025-05-29 19:37:58] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 184 cols
[2025-05-29 19:37:58] [INFO ] Computed 81 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (52366 resets) in 5122 ms. (195 steps per ms)
FORMULA BusinessProcesses-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (19131 resets) in 2563 ms. (390 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:38:06] [INFO ] Flatten gal took : 135 ms
[2025-05-29 19:38:06] [INFO ] Flatten gal took : 55 ms
[2025-05-29 19:38:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16977363751088761777.gal : 29 ms
[2025-05-29 19:38:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15968061659506542213.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/ReachabilityCardinality16977363751088761777.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15968061659506542213.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 51967 ms.

BK_STOP 1748547486674

--------------------
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-20"
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-20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-smll-174853822500020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.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 ;