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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 7.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 161K 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-17-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748547306764

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:35:08] [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:35:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:35:09] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2025-05-29 19:35:09] [INFO ] Transformed 650 places.
[2025-05-29 19:35:09] [INFO ] Transformed 580 transitions.
[2025-05-29 19:35:09] [INFO ] Found NUPN structural information;
[2025-05-29 19:35:09] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 4 places in 15 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 576 rows 646 cols
[2025-05-29 19:35:09] [INFO ] Computed 108 invariants in 59 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 (65 resets) in 87 ms. (113 steps per ms)
FORMULA BusinessProcesses-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (70 resets) in 158 ms. (377 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:35:09] [INFO ] Invariant cache hit.
[2025-05-29 19:35:10] [INFO ] [Real]Absence check using 62 positive place invariants in 64 ms returned sat
[2025-05-29 19:35:10] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 30 ms returned sat
[2025-05-29 19:35:10] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2025-05-29 19:35:12] [INFO ] Deduced a trap composed of 16 places in 768 ms of which 103 ms to minimize.
[2025-05-29 19:35:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:35:12] [INFO ] [Nat]Absence check using 62 positive place invariants in 73 ms returned sat
[2025-05-29 19:35:12] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 30 ms returned sat
[2025-05-29 19:35:13] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2025-05-29 19:35:13] [INFO ] Deduced a trap composed of 16 places in 304 ms of which 7 ms to minimize.
[2025-05-29 19:35:13] [INFO ] Deduced a trap composed of 27 places in 437 ms of which 16 ms to minimize.
[2025-05-29 19:35:14] [INFO ] Deduced a trap composed of 20 places in 522 ms of which 8 ms to minimize.
[2025-05-29 19:35:14] [INFO ] Deduced a trap composed of 21 places in 469 ms of which 8 ms to minimize.
[2025-05-29 19:35:15] [INFO ] Deduced a trap composed of 17 places in 552 ms of which 6 ms to minimize.
[2025-05-29 19:35:15] [INFO ] Deduced a trap composed of 17 places in 334 ms of which 6 ms to minimize.
[2025-05-29 19:35:16] [INFO ] Deduced a trap composed of 24 places in 365 ms of which 6 ms to minimize.
[2025-05-29 19:35:16] [INFO ] Deduced a trap composed of 23 places in 494 ms of which 8 ms to minimize.
[2025-05-29 19:35:17] [INFO ] Deduced a trap composed of 23 places in 468 ms of which 9 ms to minimize.
[2025-05-29 19:35:17] [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:35:17] [INFO ] [Real]Absence check using 62 positive place invariants in 62 ms returned sat
[2025-05-29 19:35:17] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 31 ms returned sat
[2025-05-29 19:35:18] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2025-05-29 19:35:18] [INFO ] Deduced a trap composed of 29 places in 550 ms of which 9 ms to minimize.
[2025-05-29 19:35:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:35:19] [INFO ] [Nat]Absence check using 62 positive place invariants in 60 ms returned sat
[2025-05-29 19:35:19] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 36 ms returned sat
[2025-05-29 19:35:19] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2025-05-29 19:35:20] [INFO ] Deduced a trap composed of 29 places in 522 ms of which 8 ms to minimize.
[2025-05-29 19:35:21] [INFO ] Deduced a trap composed of 16 places in 565 ms of which 8 ms to minimize.
[2025-05-29 19:35:21] [INFO ] Deduced a trap composed of 10 places in 508 ms of which 8 ms to minimize.
[2025-05-29 19:35:22] [INFO ] Deduced a trap composed of 22 places in 539 ms of which 9 ms to minimize.
[2025-05-29 19:35:22] [INFO ] Deduced a trap composed of 15 places in 515 ms of which 9 ms to minimize.
[2025-05-29 19:35:23] [INFO ] Deduced a trap composed of 122 places in 477 ms of which 8 ms to minimize.
[2025-05-29 19:35:23] [INFO ] Deduced a trap composed of 49 places in 445 ms of which 8 ms to minimize.
[2025-05-29 19:35:24] [INFO ] Deduced a trap composed of 25 places in 539 ms of which 8 ms to minimize.
[2025-05-29 19:35:24] [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:35:24] [INFO ] [Real]Absence check using 62 positive place invariants in 53 ms returned sat
[2025-05-29 19:35:24] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 26 ms returned sat
[2025-05-29 19:35:25] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2025-05-29 19:35:25] [INFO ] Deduced a trap composed of 15 places in 548 ms of which 8 ms to minimize.
[2025-05-29 19:35:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:35:26] [INFO ] [Nat]Absence check using 62 positive place invariants in 60 ms returned sat
[2025-05-29 19:35:26] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 24 ms returned sat
[2025-05-29 19:35:26] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2025-05-29 19:35:27] [INFO ] Deduced a trap composed of 15 places in 576 ms of which 8 ms to minimize.
[2025-05-29 19:35:27] [INFO ] Deduced a trap composed of 56 places in 553 ms of which 8 ms to minimize.
[2025-05-29 19:35:28] [INFO ] Deduced a trap composed of 136 places in 472 ms of which 8 ms to minimize.
[2025-05-29 19:35:28] [INFO ] Deduced a trap composed of 136 places in 536 ms of which 8 ms to minimize.
[2025-05-29 19:35:29] [INFO ] Deduced a trap composed of 17 places in 464 ms of which 7 ms to minimize.
[2025-05-29 19:35:30] [INFO ] Deduced a trap composed of 19 places in 517 ms of which 9 ms to minimize.
[2025-05-29 19:35:30] [INFO ] Deduced a trap composed of 45 places in 516 ms of which 8 ms to minimize.
[2025-05-29 19:35:30] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 6 ms to minimize.
[2025-05-29 19:35: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 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:35:31] [INFO ] [Real]Absence check using 62 positive place invariants in 64 ms returned sat
[2025-05-29 19:35:31] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 33 ms returned sat
[2025-05-29 19:35:31] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2025-05-29 19:35:32] [INFO ] Deduced a trap composed of 15 places in 479 ms of which 8 ms to minimize.
[2025-05-29 19:35:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:35:32] [INFO ] [Nat]Absence check using 62 positive place invariants in 61 ms returned sat
[2025-05-29 19:35:32] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 27 ms returned sat
[2025-05-29 19:35:33] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2025-05-29 19:35:33] [INFO ] Deduced a trap composed of 15 places in 503 ms of which 8 ms to minimize.
[2025-05-29 19:35:34] [INFO ] Deduced a trap composed of 21 places in 530 ms of which 8 ms to minimize.
[2025-05-29 19:35:34] [INFO ] Deduced a trap composed of 131 places in 492 ms of which 9 ms to minimize.
[2025-05-29 19:35:35] [INFO ] Deduced a trap composed of 18 places in 374 ms of which 6 ms to minimize.
[2025-05-29 19:35:35] [INFO ] Deduced a trap composed of 13 places in 369 ms of which 7 ms to minimize.
[2025-05-29 19:35:36] [INFO ] Deduced a trap composed of 35 places in 358 ms of which 7 ms to minimize.
[2025-05-29 19:35:36] [INFO ] Deduced a trap composed of 28 places in 371 ms of which 6 ms to minimize.
[2025-05-29 19:35:36] [INFO ] Deduced a trap composed of 22 places in 374 ms of which 6 ms to minimize.
[2025-05-29 19:35:37] [INFO ] Deduced a trap composed of 31 places in 344 ms of which 6 ms to minimize.
[2025-05-29 19:35:37] [INFO ] Deduced a trap composed of 21 places in 356 ms of which 6 ms to minimize.
[2025-05-29 19:35: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 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:35:38] [INFO ] [Real]Absence check using 62 positive place invariants in 63 ms returned sat
[2025-05-29 19:35:38] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 31 ms returned sat
[2025-05-29 19:35:38] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2025-05-29 19:35:39] [INFO ] Deduced a trap composed of 17 places in 591 ms of which 8 ms to minimize.
[2025-05-29 19:35:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:35:39] [INFO ] [Nat]Absence check using 62 positive place invariants in 67 ms returned sat
[2025-05-29 19:35:39] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 36 ms returned sat
[2025-05-29 19:35:40] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2025-05-29 19:35:40] [INFO ] Deduced a trap composed of 17 places in 386 ms of which 9 ms to minimize.
[2025-05-29 19:35:41] [INFO ] Deduced a trap composed of 23 places in 553 ms of which 9 ms to minimize.
[2025-05-29 19:35:41] [INFO ] Deduced a trap composed of 15 places in 561 ms of which 9 ms to minimize.
[2025-05-29 19:35:42] [INFO ] Deduced a trap composed of 17 places in 431 ms of which 9 ms to minimize.
[2025-05-29 19:35:42] [INFO ] Deduced a trap composed of 19 places in 340 ms of which 5 ms to minimize.
[2025-05-29 19:35:43] [INFO ] Deduced a trap composed of 16 places in 524 ms of which 8 ms to minimize.
[2025-05-29 19:35:43] [INFO ] Deduced a trap composed of 13 places in 524 ms of which 8 ms to minimize.
[2025-05-29 19:35:44] [INFO ] Deduced a trap composed of 149 places in 485 ms of which 8 ms to minimize.
[2025-05-29 19:35:44] [INFO ] Deduced a trap composed of 22 places in 507 ms of which 8 ms to minimize.
[2025-05-29 19:35:44] [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:35:45] [INFO ] [Real]Absence check using 62 positive place invariants in 58 ms returned sat
[2025-05-29 19:35:45] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 34 ms returned sat
[2025-05-29 19:35:45] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2025-05-29 19:35:46] [INFO ] Deduced a trap composed of 8 places in 547 ms of which 8 ms to minimize.
[2025-05-29 19:35:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:35:46] [INFO ] [Nat]Absence check using 62 positive place invariants in 60 ms returned sat
[2025-05-29 19:35:46] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 32 ms returned sat
[2025-05-29 19:35:47] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2025-05-29 19:35:47] [INFO ] Deduced a trap composed of 8 places in 549 ms of which 8 ms to minimize.
[2025-05-29 19:35:48] [INFO ] Deduced a trap composed of 36 places in 554 ms of which 9 ms to minimize.
[2025-05-29 19:35:48] [INFO ] Deduced a trap composed of 16 places in 537 ms of which 9 ms to minimize.
[2025-05-29 19:35:49] [INFO ] Deduced a trap composed of 21 places in 546 ms of which 9 ms to minimize.
[2025-05-29 19:35:50] [INFO ] Deduced a trap composed of 17 places in 538 ms of which 8 ms to minimize.
[2025-05-29 19:35:50] [INFO ] Deduced a trap composed of 129 places in 539 ms of which 9 ms to minimize.
[2025-05-29 19:35:51] [INFO ] Deduced a trap composed of 23 places in 538 ms of which 8 ms to minimize.
[2025-05-29 19:35:51] [INFO ] Deduced a trap composed of 22 places in 511 ms of which 8 ms to minimize.
[2025-05-29 19:35:51] [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 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 365 edges and 646 vertex of which 7 / 646 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 1304 edges and 640 vertex of which 636 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 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 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 636 transition count 428
Reduce places removed 139 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 142 rules applied. Total rules applied 283 place count 497 transition count 425
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 286 place count 494 transition count 425
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 286 place count 494 transition count 328
Deduced a syphon composed of 97 places in 4 ms
Ensure Unique test removed 19 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 499 place count 378 transition count 328
Discarding 82 places :
Symmetric choice reduction at 3 with 82 rule applications. Total rules 581 place count 296 transition count 246
Iterating global reduction 3 with 82 rules applied. Total rules applied 663 place count 296 transition count 246
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 663 place count 296 transition count 238
Deduced a syphon composed of 8 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 681 place count 286 transition count 238
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 886 place count 182 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 888 place count 181 transition count 141
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 890 place count 181 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 892 place count 179 transition count 139
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 893 place count 179 transition count 139
Applied a total of 893 rules in 372 ms. Remains 179 /646 variables (removed 467) and now considering 139/576 (removed 437) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 179/646 places, 139/576 transitions.
// Phase 1: matrix 139 rows 179 cols
[2025-05-29 19:35:52] [INFO ] Computed 81 invariants in 6 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 (27739 resets) in 4689 ms. (213 steps per ms)
FORMULA BusinessProcesses-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (15239 resets) in 2712 ms. (368 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:36:00] [INFO ] Flatten gal took : 103 ms
[2025-05-29 19:36:00] [INFO ] Flatten gal took : 39 ms
[2025-05-29 19:36:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15859280581096692197.gal : 21 ms
[2025-05-29 19:36:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17010918188446369005.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/ReachabilityCardinality15859280581096692197.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17010918188446369005.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 51429 ms.

BK_STOP 1748547360283

--------------------
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-17"
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-17, 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-174853822500017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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