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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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 159K 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-16-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748547267773

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:34:30] [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:34:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:34:30] [INFO ] Load time of PNML (sax parser for PT used): 283 ms
[2025-05-29 19:34:30] [INFO ] Transformed 638 places.
[2025-05-29 19:34:30] [INFO ] Transformed 578 transitions.
[2025-05-29 19:34:30] [INFO ] Found NUPN structural information;
[2025-05-29 19:34:31] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 647 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 29 ms.
Deduced a syphon composed of 8 places in 21 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-UpperBounds-13 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 570 rows 630 cols
[2025-05-29 19:34:31] [INFO ] Computed 100 invariants in 77 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 (67 resets) in 128 ms. (77 steps per ms)
FORMULA BusinessProcesses-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (58 resets) in 161 ms. (308 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-29 19:34:31] [INFO ] Invariant cache hit.
[2025-05-29 19:34:32] [INFO ] [Real]Absence check using 62 positive place invariants in 48 ms returned sat
[2025-05-29 19:34:32] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 26 ms returned sat
[2025-05-29 19:34:32] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2025-05-29 19:34:33] [INFO ] Deduced a trap composed of 11 places in 540 ms of which 120 ms to minimize.
[2025-05-29 19:34:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:34:33] [INFO ] [Nat]Absence check using 62 positive place invariants in 65 ms returned sat
[2025-05-29 19:34:33] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 35 ms returned sat
[2025-05-29 19:34:34] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2025-05-29 19:34:34] [INFO ] Deduced a trap composed of 11 places in 409 ms of which 7 ms to minimize.
[2025-05-29 19:34:35] [INFO ] Deduced a trap composed of 8 places in 546 ms of which 9 ms to minimize.
[2025-05-29 19:34:36] [INFO ] Deduced a trap composed of 125 places in 648 ms of which 9 ms to minimize.
[2025-05-29 19:34:36] [INFO ] Deduced a trap composed of 15 places in 622 ms of which 8 ms to minimize.
[2025-05-29 19:34:37] [INFO ] Deduced a trap composed of 14 places in 584 ms of which 9 ms to minimize.
[2025-05-29 19:34:38] [INFO ] Deduced a trap composed of 11 places in 483 ms of which 7 ms to minimize.
[2025-05-29 19:34:38] [INFO ] Deduced a trap composed of 11 places in 523 ms of which 9 ms to minimize.
[2025-05-29 19:34:38] [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:34:38] [INFO ] [Real]Absence check using 62 positive place invariants in 40 ms returned sat
[2025-05-29 19:34:38] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 28 ms returned sat
[2025-05-29 19:34:39] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2025-05-29 19:34:39] [INFO ] Deduced a trap composed of 131 places in 624 ms of which 10 ms to minimize.
[2025-05-29 19:34:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:34:40] [INFO ] [Nat]Absence check using 62 positive place invariants in 42 ms returned sat
[2025-05-29 19:34:40] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 44 ms returned sat
[2025-05-29 19:34:40] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2025-05-29 19:34:41] [INFO ] Deduced a trap composed of 131 places in 402 ms of which 6 ms to minimize.
[2025-05-29 19:34:41] [INFO ] Deduced a trap composed of 14 places in 581 ms of which 7 ms to minimize.
[2025-05-29 19:34:42] [INFO ] Deduced a trap composed of 15 places in 562 ms of which 8 ms to minimize.
[2025-05-29 19:34:42] [INFO ] Deduced a trap composed of 8 places in 499 ms of which 8 ms to minimize.
[2025-05-29 19:34:43] [INFO ] Deduced a trap composed of 8 places in 513 ms of which 9 ms to minimize.
[2025-05-29 19:34:44] [INFO ] Deduced a trap composed of 34 places in 531 ms of which 8 ms to minimize.
[2025-05-29 19:34:44] [INFO ] Deduced a trap composed of 53 places in 541 ms of which 9 ms to minimize.
[2025-05-29 19:34:45] [INFO ] Deduced a trap composed of 33 places in 534 ms of which 8 ms to minimize.
[2025-05-29 19:34:45] [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:34:45] [INFO ] [Real]Absence check using 62 positive place invariants in 59 ms returned sat
[2025-05-29 19:34:45] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 36 ms returned sat
[2025-05-29 19:34:45] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2025-05-29 19:34:46] [INFO ] Deduced a trap composed of 11 places in 492 ms of which 8 ms to minimize.
[2025-05-29 19:34:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:34:46] [INFO ] [Nat]Absence check using 62 positive place invariants in 39 ms returned sat
[2025-05-29 19:34:46] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2025-05-29 19:34:47] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2025-05-29 19:34:47] [INFO ] Deduced a trap composed of 11 places in 498 ms of which 8 ms to minimize.
[2025-05-29 19:34:48] [INFO ] Deduced a trap composed of 8 places in 417 ms of which 7 ms to minimize.
[2025-05-29 19:34:48] [INFO ] Deduced a trap composed of 8 places in 469 ms of which 8 ms to minimize.
[2025-05-29 19:34:49] [INFO ] Deduced a trap composed of 39 places in 484 ms of which 8 ms to minimize.
[2025-05-29 19:34:49] [INFO ] Deduced a trap composed of 15 places in 486 ms of which 8 ms to minimize.
[2025-05-29 19:34:50] [INFO ] Deduced a trap composed of 15 places in 378 ms of which 5 ms to minimize.
[2025-05-29 19:34:50] [INFO ] Deduced a trap composed of 29 places in 465 ms of which 8 ms to minimize.
[2025-05-29 19:34:51] [INFO ] Deduced a trap composed of 36 places in 461 ms of which 8 ms to minimize.
[2025-05-29 19:34:51] [INFO ] Deduced a trap composed of 17 places in 511 ms of which 8 ms to minimize.
[2025-05-29 19:34: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 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:34:51] [INFO ] [Real]Absence check using 62 positive place invariants in 41 ms returned sat
[2025-05-29 19:34:51] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 25 ms returned sat
[2025-05-29 19:34:52] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2025-05-29 19:34:52] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 4 ms to minimize.
[2025-05-29 19:34:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:34:52] [INFO ] [Nat]Absence check using 62 positive place invariants in 60 ms returned sat
[2025-05-29 19:34:52] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 52 ms returned sat
[2025-05-29 19:34:53] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2025-05-29 19:34:53] [INFO ] Deduced a trap composed of 8 places in 326 ms of which 8 ms to minimize.
[2025-05-29 19:34:54] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 4 ms to minimize.
[2025-05-29 19:34:54] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 5 ms to minimize.
[2025-05-29 19:34:54] [INFO ] Deduced a trap composed of 12 places in 306 ms of which 5 ms to minimize.
[2025-05-29 19:34:55] [INFO ] Deduced a trap composed of 18 places in 289 ms of which 5 ms to minimize.
[2025-05-29 19:34:55] [INFO ] Deduced a trap composed of 21 places in 335 ms of which 5 ms to minimize.
[2025-05-29 19:34:55] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 5 ms to minimize.
[2025-05-29 19:34:56] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 4 ms to minimize.
[2025-05-29 19:34:56] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 4 ms to minimize.
[2025-05-29 19:34:56] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 4 ms to minimize.
[2025-05-29 19:34:56] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 3 ms to minimize.
[2025-05-29 19:34:56] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 4 ms to minimize.
[2025-05-29 19:34:57] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 3 ms to minimize.
[2025-05-29 19:34:57] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 4 ms to minimize.
[2025-05-29 19:34:57] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 4 ms to minimize.
[2025-05-29 19:34:57] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 4 ms to minimize.
[2025-05-29 19:34: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 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:34:58] [INFO ] [Real]Absence check using 62 positive place invariants in 51 ms returned sat
[2025-05-29 19:34:58] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 31 ms returned sat
[2025-05-29 19:34:58] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2025-05-29 19:34:58] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 4 ms to minimize.
[2025-05-29 19:34:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:34:59] [INFO ] [Nat]Absence check using 62 positive place invariants in 50 ms returned sat
[2025-05-29 19:34:59] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2025-05-29 19:34:59] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2025-05-29 19:34:59] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 4 ms to minimize.
[2025-05-29 19:34:59] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 4 ms to minimize.
[2025-05-29 19:35:00] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2025-05-29 19:35:00] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 4 ms to minimize.
[2025-05-29 19:35:00] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 4 ms to minimize.
[2025-05-29 19:35:00] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 4 ms to minimize.
[2025-05-29 19:35:01] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 4 ms to minimize.
[2025-05-29 19:35:01] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 4 ms to minimize.
[2025-05-29 19:35:01] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 4 ms to minimize.
[2025-05-29 19:35:01] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 5 ms to minimize.
[2025-05-29 19:35:02] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 4 ms to minimize.
[2025-05-29 19:35:02] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 4 ms to minimize.
[2025-05-29 19:35:02] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 4 ms to minimize.
[2025-05-29 19:35:02] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 4 ms to minimize.
[2025-05-29 19:35:03] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 4 ms to minimize.
[2025-05-29 19:35:03] [INFO ] Deduced a trap composed of 29 places in 245 ms of which 4 ms to minimize.
[2025-05-29 19:35:03] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 4 ms to minimize.
[2025-05-29 19:35:03] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 5 ms to minimize.
[2025-05-29 19:35:03] [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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 361 edges and 630 vertex of which 7 / 630 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 1283 edges and 624 vertex of which 618 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 143 place count 618 transition count 420
Reduce places removed 141 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 477 transition count 418
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 288 place count 475 transition count 418
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 288 place count 475 transition count 330
Deduced a syphon composed of 88 places in 4 ms
Ensure Unique test removed 15 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 479 place count 372 transition count 330
Discarding 87 places :
Symmetric choice reduction at 3 with 87 rule applications. Total rules 566 place count 285 transition count 243
Iterating global reduction 3 with 87 rules applied. Total rules applied 653 place count 285 transition count 243
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 653 place count 285 transition count 233
Deduced a syphon composed of 10 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 676 place count 272 transition count 233
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 866 place count 176 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 868 place count 175 transition count 143
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 870 place count 175 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 872 place count 173 transition count 141
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 873 place count 173 transition count 141
Applied a total of 873 rules in 404 ms. Remains 173 /630 variables (removed 457) and now considering 141/570 (removed 429) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 173/630 places, 141/570 transitions.
// Phase 1: matrix 141 rows 173 cols
[2025-05-29 19:35:04] [INFO ] Computed 75 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (41633 resets) in 4399 ms. (227 steps per ms)
FORMULA BusinessProcesses-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (22337 resets) in 2420 ms. (413 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:35:11] [INFO ] Flatten gal took : 128 ms
[2025-05-29 19:35:11] [INFO ] Flatten gal took : 47 ms
[2025-05-29 19:35:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1958324040764467837.gal : 26 ms
[2025-05-29 19:35:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11077147369167777417.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/ReachabilityCardinality1958324040764467837.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11077147369167777417.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 41452 ms.

BK_STOP 1748547311893

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

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