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.r265-tall-174931349700056.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 MedleyB-PT-B03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349700056
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 6.3K Jun 6 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 6 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 6 09:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 6 09:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 6 09:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 482K Jun 5 20:08 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 MedleyB-PT-B03-UpperBounds-00
FORMULA_NAME MedleyB-PT-B03-UpperBounds-01
FORMULA_NAME MedleyB-PT-B03-UpperBounds-02
FORMULA_NAME MedleyB-PT-B03-UpperBounds-03
FORMULA_NAME MedleyB-PT-B03-UpperBounds-04
FORMULA_NAME MedleyB-PT-B03-UpperBounds-05
FORMULA_NAME MedleyB-PT-B03-UpperBounds-06
FORMULA_NAME MedleyB-PT-B03-UpperBounds-07
FORMULA_NAME MedleyB-PT-B03-UpperBounds-08
FORMULA_NAME MedleyB-PT-B03-UpperBounds-09
FORMULA_NAME MedleyB-PT-B03-UpperBounds-10
FORMULA_NAME MedleyB-PT-B03-UpperBounds-11
FORMULA_NAME MedleyB-PT-B03-UpperBounds-12
FORMULA_NAME MedleyB-PT-B03-UpperBounds-13
FORMULA_NAME MedleyB-PT-B03-UpperBounds-14
FORMULA_NAME MedleyB-PT-B03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749319004204

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:56:45] [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-06-07 17:56:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:56:45] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2025-06-07 17:56:45] [INFO ] Transformed 1529 places.
[2025-06-07 17:56:45] [INFO ] Transformed 2131 transitions.
[2025-06-07 17:56:45] [INFO ] Found NUPN structural information;
[2025-06-07 17:56:45] [INFO ] Parsed PT model containing 1529 places and 2131 transitions and 8591 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
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 2131 rows 1529 cols
[2025-06-07 17:56:45] [INFO ] Computed 6 invariants in 56 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 (105 resets) in 39 ms. (250 steps per ms)
FORMULA MedleyB-PT-B03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120008 steps (233 resets) in 117 ms. (1017 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[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]
[2025-06-07 17:56:45] [INFO ] Invariant cache hit.
[2025-06-07 17:56:46] [INFO ] [Real]Absence check using 6 positive place invariants in 33 ms returned sat
[2025-06-07 17:56:47] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2025-06-07 17:56:47] [INFO ] Computed and/alt/rep : 2006/4305/2006 causal constraints (skipped 124 transitions) in 163 ms.
[2025-06-07 17:56:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:56:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 27 ms returned sat
[2025-06-07 17:56:49] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2025-06-07 17:56:50] [INFO ] Computed and/alt/rep : 2006/4305/2006 causal constraints (skipped 124 transitions) in 127 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-07 17:56:54] [INFO ] [Real]Absence check using 6 positive place invariants in 30 ms returned sat
[2025-06-07 17:56:54] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2025-06-07 17:56:55] [INFO ] Computed and/alt/rep : 2006/4305/2006 causal constraints (skipped 124 transitions) in 102 ms.
[2025-06-07 17:56:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:56:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 26 ms returned sat
[2025-06-07 17:56:56] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2025-06-07 17:56:56] [INFO ] Computed and/alt/rep : 2006/4305/2006 causal constraints (skipped 124 transitions) in 104 ms.
[2025-06-07 17:57:00] [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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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-06-07 17:57:01] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2025-06-07 17:57:01] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2025-06-07 17:57:02] [INFO ] Deduced a trap composed of 296 places in 753 ms of which 78 ms to minimize.
[2025-06-07 17:57:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 28 ms returned sat
[2025-06-07 17:57:03] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2025-06-07 17:57:04] [INFO ] Deduced a trap composed of 296 places in 690 ms of which 10 ms to minimize.
[2025-06-07 17:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 823 ms
[2025-06-07 17:57:04] [INFO ] Computed and/alt/rep : 2006/4305/2006 causal constraints (skipped 124 transitions) in 122 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-07 17:57:07] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2025-06-07 17:57:08] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2025-06-07 17:57:09] [INFO ] Deduced a trap composed of 297 places in 649 ms of which 9 ms to minimize.
[2025-06-07 17:57:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 27 ms returned sat
[2025-06-07 17:57:10] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2025-06-07 17:57:10] [INFO ] Deduced a trap composed of 297 places in 643 ms of which 9 ms to minimize.
[2025-06-07 17:57:11] [INFO ] Deduced a trap composed of 397 places in 629 ms of which 9 ms to minimize.
[2025-06-07 17:57:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1459 ms
[2025-06-07 17:57:11] [INFO ] Computed and/alt/rep : 2006/4305/2006 causal constraints (skipped 124 transitions) in 135 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-07 17:57:14] [INFO ] [Real]Absence check using 6 positive place invariants in 25 ms returned sat
[2025-06-07 17:57:15] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2025-06-07 17:57:15] [INFO ] Deduced a trap composed of 243 places in 646 ms of which 9 ms to minimize.
[2025-06-07 17:57:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 26 ms returned sat
[2025-06-07 17:57:16] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2025-06-07 17:57:17] [INFO ] Deduced a trap composed of 243 places in 663 ms of which 9 ms to minimize.
[2025-06-07 17:57:18] [INFO ] Deduced a trap composed of 397 places in 645 ms of which 9 ms to minimize.
[2025-06-07 17:57:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1484 ms
[2025-06-07 17:57:18] [INFO ] Computed and/alt/rep : 2006/4305/2006 causal constraints (skipped 124 transitions) in 106 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-07 17:57:21] [INFO ] [Real]Absence check using 6 positive place invariants in 28 ms returned sat
[2025-06-07 17:57:21] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2025-06-07 17:57:22] [INFO ] Deduced a trap composed of 299 places in 631 ms of which 9 ms to minimize.
[2025-06-07 17:57:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 26 ms returned sat
[2025-06-07 17:57:23] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2025-06-07 17:57:24] [INFO ] Deduced a trap composed of 299 places in 650 ms of which 9 ms to minimize.
[2025-06-07 17:57:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 773 ms
[2025-06-07 17:57:24] [INFO ] Computed and/alt/rep : 2006/4305/2006 causal constraints (skipped 124 transitions) in 99 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-07 17:57:27] [INFO ] [Real]Absence check using 6 positive place invariants in 25 ms returned sat
[2025-06-07 17:57:28] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2025-06-07 17:57:29] [INFO ] Deduced a trap composed of 299 places in 687 ms of which 9 ms to minimize.
[2025-06-07 17:57:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 27 ms returned sat
[2025-06-07 17:57:30] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2025-06-07 17:57:30] [INFO ] Deduced a trap composed of 299 places in 642 ms of which 9 ms to minimize.
[2025-06-07 17:57:31] [INFO ] Deduced a trap composed of 398 places in 596 ms of which 9 ms to minimize.
[2025-06-07 17:57:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1430 ms
[2025-06-07 17:57:31] [INFO ] Computed and/alt/rep : 2006/4305/2006 causal constraints (skipped 124 transitions) in 98 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-07 17:57:34] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2025-06-07 17:57:35] [INFO ] [Real]Absence check using state equation in 550 ms returned sat
[2025-06-07 17:57:35] [INFO ] Deduced a trap composed of 488 places in 613 ms of which 10 ms to minimize.
[2025-06-07 17:57:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 28 ms returned sat
[2025-06-07 17:57:36] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2025-06-07 17:57:37] [INFO ] Deduced a trap composed of 488 places in 623 ms of which 9 ms to minimize.
[2025-06-07 17:57:38] [INFO ] Deduced a trap composed of 397 places in 509 ms of which 7 ms to minimize.
[2025-06-07 17:57:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1317 ms
[2025-06-07 17:57:38] [INFO ] Computed and/alt/rep : 2006/4305/2006 causal constraints (skipped 124 transitions) in 113 ms.
[2025-06-07 17:57:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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-06-07 17:57:41] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2025-06-07 17:57:42] [INFO ] Deduced a trap composed of 492 places in 636 ms of which 9 ms to minimize.
[2025-06-07 17:57:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 31 ms returned sat
[2025-06-07 17:57:43] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2025-06-07 17:57:44] [INFO ] Deduced a trap composed of 492 places in 595 ms of which 9 ms to minimize.
[2025-06-07 17:57:44] [INFO ] Deduced a trap composed of 398 places in 536 ms of which 8 ms to minimize.
[2025-06-07 17:57:45] [INFO ] Deduced a trap composed of 398 places in 449 ms of which 7 ms to minimize.
[2025-06-07 17:57:45] [INFO ] Deduced a trap composed of 395 places in 413 ms of which 6 ms to minimize.
[2025-06-07 17:57:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2307 ms
[2025-06-07 17:57:45] [INFO ] Computed and/alt/rep : 2006/4305/2006 causal constraints (skipped 124 transitions) in 105 ms.
[2025-06-07 17:57:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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-06-07 17:57:47] [INFO ] [Real]Absence check using 6 positive place invariants in 25 ms returned sat
[2025-06-07 17:57:48] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2025-06-07 17:57:49] [INFO ] Deduced a trap composed of 298 places in 693 ms of which 10 ms to minimize.
[2025-06-07 17:57:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 26 ms returned sat
[2025-06-07 17:57:50] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2025-06-07 17:57:50] [INFO ] Deduced a trap composed of 298 places in 698 ms of which 9 ms to minimize.
[2025-06-07 17:57:51] [INFO ] Deduced a trap composed of 422 places in 655 ms of which 9 ms to minimize.
[2025-06-07 17:57:52] [INFO ] Deduced a trap composed of 421 places in 517 ms of which 8 ms to minimize.
[2025-06-07 17:57:52] [INFO ] Deduced a trap composed of 206 places in 575 ms of which 9 ms to minimize.
[2025-06-07 17:57:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2770 ms
[2025-06-07 17:57:53] [INFO ] Computed and/alt/rep : 2006/4305/2006 causal constraints (skipped 124 transitions) in 103 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-07 17:57:54] [INFO ] [Real]Absence check using 6 positive place invariants in 24 ms returned sat
[2025-06-07 17:57:55] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2025-06-07 17:57:56] [INFO ] Deduced a trap composed of 297 places in 651 ms of which 9 ms to minimize.
[2025-06-07 17:57:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 28 ms returned sat
[2025-06-07 17:57:56] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2025-06-07 17:57:57] [INFO ] Deduced a trap composed of 297 places in 690 ms of which 9 ms to minimize.
[2025-06-07 17:57:58] [INFO ] Deduced a trap composed of 299 places in 587 ms of which 8 ms to minimize.
[2025-06-07 17:57:58] [INFO ] Deduced a trap composed of 299 places in 554 ms of which 8 ms to minimize.
[2025-06-07 17:57:59] [INFO ] Deduced a trap composed of 205 places in 545 ms of which 8 ms to minimize.
[2025-06-07 17:58:00] [INFO ] Deduced a trap composed of 398 places in 671 ms of which 9 ms to minimize.
[2025-06-07 17:58:00] [INFO ] Deduced a trap composed of 397 places in 607 ms of which 9 ms to minimize.
[2025-06-07 17:58:01] [INFO ] Deduced a trap composed of 398 places in 514 ms of which 7 ms to minimize.
[2025-06-07 17:58:01] [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 10
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-06-07 17:58:01] [INFO ] [Real]Absence check using 6 positive place invariants in 25 ms returned sat
[2025-06-07 17:58:02] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2025-06-07 17:58:03] [INFO ] Deduced a trap composed of 298 places in 651 ms of which 11 ms to minimize.
[2025-06-07 17:58:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:58:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 26 ms returned sat
[2025-06-07 17:58:03] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2025-06-07 17:58:04] [INFO ] Deduced a trap composed of 298 places in 668 ms of which 9 ms to minimize.
[2025-06-07 17:58:05] [INFO ] Deduced a trap composed of 488 places in 596 ms of which 8 ms to minimize.
[2025-06-07 17:58:05] [INFO ] Deduced a trap composed of 205 places in 576 ms of which 8 ms to minimize.
[2025-06-07 17:58:06] [INFO ] Deduced a trap composed of 396 places in 502 ms of which 8 ms to minimize.
[2025-06-07 17:58:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2655 ms
[2025-06-07 17:58:06] [INFO ] Computed and/alt/rep : 2006/4305/2006 causal constraints (skipped 124 transitions) in 101 ms.
[2025-06-07 17:58:08] [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 11
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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 12 out of 1529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1529/1529 places, 2131/2131 transitions.
Graph (trivial) has 1494 edges and 1529 vertex of which 89 / 1529 are part of one of the 14 SCC in 8 ms
Free SCC test removed 75 places
Drop transitions (Empty/Sink Transition effects.) removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Graph (complete) has 2174 edges and 1454 vertex of which 1444 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.8 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1135 transitions
Trivial Post-agglo rules discarded 1135 transitions
Performed 1135 trivial Post agglomeration. Transition count delta: 1135
Iterating post reduction 0 with 1140 rules applied. Total rules applied 1142 place count 1444 transition count 889
Reduce places removed 1135 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 1166 rules applied. Total rules applied 2308 place count 309 transition count 858
Reduce places removed 11 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 21 rules applied. Total rules applied 2329 place count 298 transition count 848
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2339 place count 288 transition count 848
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 54 Pre rules applied. Total rules applied 2339 place count 288 transition count 794
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 2447 place count 234 transition count 794
Discarding 59 places :
Symmetric choice reduction at 4 with 59 rule applications. Total rules 2506 place count 175 transition count 735
Iterating global reduction 4 with 59 rules applied. Total rules applied 2565 place count 175 transition count 735
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 2567 place count 175 transition count 733
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2568 place count 174 transition count 733
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2568 place count 174 transition count 732
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2570 place count 173 transition count 732
Discarding 31 places :
Symmetric choice reduction at 6 with 31 rule applications. Total rules 2601 place count 142 transition count 280
Iterating global reduction 6 with 31 rules applied. Total rules applied 2632 place count 142 transition count 280
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 2646 place count 142 transition count 266
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 2655 place count 133 transition count 257
Iterating global reduction 7 with 9 rules applied. Total rules applied 2664 place count 133 transition count 257
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 2673 place count 124 transition count 248
Iterating global reduction 7 with 9 rules applied. Total rules applied 2682 place count 124 transition count 248
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2689 place count 124 transition count 241
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 2723 place count 107 transition count 224
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2724 place count 107 transition count 223
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2729 place count 102 transition count 218
Iterating global reduction 9 with 5 rules applied. Total rules applied 2734 place count 102 transition count 218
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2739 place count 97 transition count 213
Iterating global reduction 9 with 5 rules applied. Total rules applied 2744 place count 97 transition count 213
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2749 place count 92 transition count 208
Iterating global reduction 9 with 5 rules applied. Total rules applied 2754 place count 92 transition count 208
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2762 place count 88 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2765 place count 88 transition count 220
Free-agglomeration rule applied 31 times.
Iterating global reduction 9 with 31 rules applied. Total rules applied 2796 place count 88 transition count 189
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 34 rules applied. Total rules applied 2830 place count 57 transition count 186
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2835 place count 52 transition count 181
Iterating global reduction 10 with 5 rules applied. Total rules applied 2840 place count 52 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 10 with 39 rules applied. Total rules applied 2879 place count 52 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2881 place count 51 transition count 143
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2882 place count 51 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2883 place count 50 transition count 142
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 2886 place count 50 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 2888 place count 50 transition count 140
Applied a total of 2888 rules in 264 ms. Remains 50 /1529 variables (removed 1479) and now considering 140/2131 (removed 1991) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 50/1529 places, 140/2131 transitions.
// Phase 1: matrix 140 rows 50 cols
[2025-06-07 17:58:08] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 1000000 steps (2 resets) in 2252 ms. (443 steps per ms)
FORMULA MedleyB-PT-B03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 332 ms. (3003 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-06-07 17:58:11] [INFO ] Flatten gal took : 46 ms
[2025-06-07 17:58:11] [INFO ] Flatten gal took : 15 ms
[2025-06-07 17:58:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4307292232883524206.gal : 11 ms
[2025-06-07 17:58:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2323585156828716173.prop : 0 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/ReachabilityCardinality4307292232883524206.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2323585156828716173.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 85926 ms.

BK_STOP 1749319091359

--------------------
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="MedleyB-PT-B03"
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 MedleyB-PT-B03, 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 r265-tall-174931349700056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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