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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K 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 52K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 189K 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-19-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748547373060

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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:36:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 19:36:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:36:16] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2025-05-29 19:36:16] [INFO ] Transformed 772 places.
[2025-05-29 19:36:16] [INFO ] Transformed 685 transitions.
[2025-05-29 19:36:16] [INFO ] Found NUPN structural information;
[2025-05-29 19:36:16] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 548 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Deduced a syphon composed of 15 places in 30 ms
Reduce places removed 15 places and 15 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 670 rows 757 cols
[2025-05-29 19:36:16] [INFO ] Computed 125 invariants in 98 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 (54 resets) in 116 ms. (85 steps per ms)
FORMULA BusinessProcesses-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60004 steps (59 resets) in 186 ms. (320 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:36:16] [INFO ] Invariant cache hit.
[2025-05-29 19:36:17] [INFO ] [Real]Absence check using 78 positive place invariants in 66 ms returned sat
[2025-05-29 19:36:17] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 33 ms returned sat
[2025-05-29 19:36:18] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2025-05-29 19:36:18] [INFO ] Deduced a trap composed of 8 places in 535 ms of which 76 ms to minimize.
[2025-05-29 19:36:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:36:19] [INFO ] [Nat]Absence check using 78 positive place invariants in 84 ms returned sat
[2025-05-29 19:36:19] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 38 ms returned sat
[2025-05-29 19:36:19] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2025-05-29 19:36:20] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 4 ms to minimize.
[2025-05-29 19:36:20] [INFO ] Deduced a trap composed of 16 places in 381 ms of which 9 ms to minimize.
[2025-05-29 19:36:21] [INFO ] Deduced a trap composed of 13 places in 381 ms of which 6 ms to minimize.
[2025-05-29 19:36:21] [INFO ] Deduced a trap composed of 15 places in 383 ms of which 6 ms to minimize.
[2025-05-29 19:36:22] [INFO ] Deduced a trap composed of 31 places in 430 ms of which 7 ms to minimize.
[2025-05-29 19:36:22] [INFO ] Deduced a trap composed of 36 places in 413 ms of which 4 ms to minimize.
[2025-05-29 19:36:22] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 4 ms to minimize.
[2025-05-29 19:36:23] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 5 ms to minimize.
[2025-05-29 19:36:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3174 ms
[2025-05-29 19:36:23] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 98 ms.
Maximisation of solution failed !
Minimization took 4 ms.
[2025-05-29 19:36:24] [INFO ] [Real]Absence check using 78 positive place invariants in 57 ms returned sat
[2025-05-29 19:36:24] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 28 ms returned sat
[2025-05-29 19:36:24] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2025-05-29 19:36:25] [INFO ] Deduced a trap composed of 8 places in 444 ms of which 7 ms to minimize.
[2025-05-29 19:36:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:36:25] [INFO ] [Nat]Absence check using 78 positive place invariants in 73 ms returned sat
[2025-05-29 19:36:25] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 36 ms returned sat
[2025-05-29 19:36:26] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2025-05-29 19:36:27] [INFO ] Deduced a trap composed of 8 places in 682 ms of which 7 ms to minimize.
[2025-05-29 19:36:27] [INFO ] Deduced a trap composed of 20 places in 485 ms of which 6 ms to minimize.
[2025-05-29 19:36:27] [INFO ] Deduced a trap composed of 14 places in 321 ms of which 6 ms to minimize.
[2025-05-29 19:36:28] [INFO ] Deduced a trap composed of 17 places in 568 ms of which 9 ms to minimize.
[2025-05-29 19:36:29] [INFO ] Deduced a trap composed of 14 places in 664 ms of which 9 ms to minimize.
[2025-05-29 19:36:29] [INFO ] Deduced a trap composed of 8 places in 648 ms of which 9 ms to minimize.
[2025-05-29 19:36:30] [INFO ] Deduced a trap composed of 25 places in 647 ms of which 11 ms to minimize.
[2025-05-29 19:36: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:36:31] [INFO ] [Real]Absence check using 78 positive place invariants in 78 ms returned sat
[2025-05-29 19:36:31] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 38 ms returned sat
[2025-05-29 19:36:31] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2025-05-29 19:36:32] [INFO ] Deduced a trap composed of 20 places in 637 ms of which 10 ms to minimize.
[2025-05-29 19:36:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:36:32] [INFO ] [Nat]Absence check using 78 positive place invariants in 80 ms returned sat
[2025-05-29 19:36:32] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 36 ms returned sat
[2025-05-29 19:36:33] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2025-05-29 19:36:33] [INFO ] Deduced a trap composed of 20 places in 420 ms of which 7 ms to minimize.
[2025-05-29 19:36:34] [INFO ] Deduced a trap composed of 161 places in 432 ms of which 7 ms to minimize.
[2025-05-29 19:36:34] [INFO ] Deduced a trap composed of 8 places in 510 ms of which 8 ms to minimize.
[2025-05-29 19:36:35] [INFO ] Deduced a trap composed of 20 places in 661 ms of which 10 ms to minimize.
[2025-05-29 19:36:36] [INFO ] Deduced a trap composed of 16 places in 617 ms of which 9 ms to minimize.
[2025-05-29 19:36:37] [INFO ] Deduced a trap composed of 14 places in 674 ms of which 10 ms to minimize.
[2025-05-29 19:36:37] [INFO ] Deduced a trap composed of 18 places in 626 ms of which 9 ms to minimize.
[2025-05-29 19:36: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:36:38] [INFO ] [Real]Absence check using 78 positive place invariants in 72 ms returned sat
[2025-05-29 19:36:38] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 38 ms returned sat
[2025-05-29 19:36:38] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2025-05-29 19:36:39] [INFO ] Deduced a trap composed of 8 places in 539 ms of which 9 ms to minimize.
[2025-05-29 19:36:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:36:39] [INFO ] [Nat]Absence check using 78 positive place invariants in 69 ms returned sat
[2025-05-29 19:36:39] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 31 ms returned sat
[2025-05-29 19:36:40] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2025-05-29 19:36:40] [INFO ] Deduced a trap composed of 8 places in 535 ms of which 9 ms to minimize.
[2025-05-29 19:36:41] [INFO ] Deduced a trap composed of 14 places in 584 ms of which 9 ms to minimize.
[2025-05-29 19:36:42] [INFO ] Deduced a trap composed of 13 places in 571 ms of which 9 ms to minimize.
[2025-05-29 19:36:42] [INFO ] Deduced a trap composed of 19 places in 600 ms of which 10 ms to minimize.
[2025-05-29 19:36:43] [INFO ] Deduced a trap composed of 19 places in 593 ms of which 9 ms to minimize.
[2025-05-29 19:36:44] [INFO ] Deduced a trap composed of 11 places in 591 ms of which 8 ms to minimize.
[2025-05-29 19:36:44] [INFO ] Deduced a trap composed of 17 places in 483 ms of which 8 ms to minimize.
[2025-05-29 19:36: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 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:36:44] [INFO ] [Real]Absence check using 78 positive place invariants in 72 ms returned sat
[2025-05-29 19:36:44] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 31 ms returned sat
[2025-05-29 19:36:45] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2025-05-29 19:36:45] [INFO ] Deduced a trap composed of 26 places in 405 ms of which 5 ms to minimize.
[2025-05-29 19:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:36:46] [INFO ] [Nat]Absence check using 78 positive place invariants in 57 ms returned sat
[2025-05-29 19:36:46] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 30 ms returned sat
[2025-05-29 19:36:46] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2025-05-29 19:36:47] [INFO ] Deduced a trap composed of 26 places in 658 ms of which 9 ms to minimize.
[2025-05-29 19:36:48] [INFO ] Deduced a trap composed of 8 places in 462 ms of which 7 ms to minimize.
[2025-05-29 19:36:48] [INFO ] Deduced a trap composed of 15 places in 443 ms of which 8 ms to minimize.
[2025-05-29 19:36:48] [INFO ] Deduced a trap composed of 31 places in 427 ms of which 8 ms to minimize.
[2025-05-29 19:36:49] [INFO ] Deduced a trap composed of 15 places in 434 ms of which 7 ms to minimize.
[2025-05-29 19:36:49] [INFO ] Deduced a trap composed of 16 places in 432 ms of which 8 ms to minimize.
[2025-05-29 19:36:50] [INFO ] Deduced a trap composed of 16 places in 417 ms of which 7 ms to minimize.
[2025-05-29 19:36:50] [INFO ] Deduced a trap composed of 11 places in 423 ms of which 7 ms to minimize.
[2025-05-29 19:36:51] [INFO ] Deduced a trap composed of 32 places in 428 ms of which 8 ms to minimize.
[2025-05-29 19:36: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 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:36:51] [INFO ] [Real]Absence check using 78 positive place invariants in 81 ms returned sat
[2025-05-29 19:36:51] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 41 ms returned sat
[2025-05-29 19:36:52] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2025-05-29 19:36:52] [INFO ] Deduced a trap composed of 18 places in 363 ms of which 5 ms to minimize.
[2025-05-29 19:36:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:36:53] [INFO ] [Nat]Absence check using 78 positive place invariants in 51 ms returned sat
[2025-05-29 19:36:53] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 26 ms returned sat
[2025-05-29 19:36:53] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2025-05-29 19:36:54] [INFO ] Deduced a trap composed of 18 places in 420 ms of which 6 ms to minimize.
[2025-05-29 19:36:54] [INFO ] Deduced a trap composed of 15 places in 354 ms of which 5 ms to minimize.
[2025-05-29 19:36:54] [INFO ] Deduced a trap composed of 22 places in 346 ms of which 6 ms to minimize.
[2025-05-29 19:36:55] [INFO ] Deduced a trap composed of 35 places in 260 ms of which 5 ms to minimize.
[2025-05-29 19:36:55] [INFO ] Deduced a trap composed of 32 places in 404 ms of which 6 ms to minimize.
[2025-05-29 19:36:55] [INFO ] Deduced a trap composed of 173 places in 343 ms of which 6 ms to minimize.
[2025-05-29 19:36:56] [INFO ] Deduced a trap composed of 160 places in 503 ms of which 10 ms to minimize.
[2025-05-29 19:36:56] [INFO ] Deduced a trap composed of 162 places in 341 ms of which 5 ms to minimize.
[2025-05-29 19:36:57] [INFO ] Deduced a trap composed of 39 places in 256 ms of which 5 ms to minimize.
[2025-05-29 19:36:57] [INFO ] Deduced a trap composed of 166 places in 322 ms of which 4 ms to minimize.
[2025-05-29 19:36:58] [INFO ] Deduced a trap composed of 160 places in 506 ms of which 7 ms to minimize.
[2025-05-29 19:36:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 429 edges and 757 vertex of which 7 / 757 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 1512 edges and 751 vertex of which 742 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 170 transitions
Trivial Post-agglo rules discarded 170 transitions
Performed 170 trivial Post agglomeration. Transition count delta: 170
Iterating post reduction 0 with 170 rules applied. Total rules applied 172 place count 742 transition count 491
Reduce places removed 170 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 171 rules applied. Total rules applied 343 place count 572 transition count 490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 344 place count 571 transition count 490
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 344 place count 571 transition count 378
Deduced a syphon composed of 112 places in 5 ms
Ensure Unique test removed 23 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 247 rules applied. Total rules applied 591 place count 436 transition count 378
Discarding 96 places :
Symmetric choice reduction at 3 with 96 rule applications. Total rules 687 place count 340 transition count 282
Iterating global reduction 3 with 96 rules applied. Total rules applied 783 place count 340 transition count 282
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 783 place count 340 transition count 273
Deduced a syphon composed of 9 places in 3 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 803 place count 329 transition count 273
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 804 place count 328 transition count 272
Iterating global reduction 3 with 1 rules applied. Total rules applied 805 place count 328 transition count 272
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1045 place count 207 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1047 place count 206 transition count 156
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1049 place count 206 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1051 place count 204 transition count 154
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1052 place count 204 transition count 154
Applied a total of 1052 rules in 407 ms. Remains 204 /757 variables (removed 553) and now considering 154/670 (removed 516) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 204/757 places, 154/670 transitions.
// Phase 1: matrix 154 rows 204 cols
[2025-05-29 19:36:58] [INFO ] Computed 90 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 (46787 resets) in 4718 ms. (211 steps per ms)
FORMULA BusinessProcesses-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (22586 resets) in 2880 ms. (347 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:37:06] [INFO ] Flatten gal took : 96 ms
[2025-05-29 19:37:06] [INFO ] Flatten gal took : 33 ms
[2025-05-29 19:37:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6688626722254476611.gal : 18 ms
[2025-05-29 19:37:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9892254885165134399.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/ReachabilityCardinality6688626722254476611.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9892254885165134399.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 50964 ms.

BK_STOP 1748547426577

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

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

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