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.r097-smll-174860111800060.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 FlexibleBarrier-PT-12b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K 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 39K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 536K 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 FlexibleBarrier-PT-12b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748679172235

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 08:12:54] [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-31 08:12:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:12:54] [INFO ] Load time of PNML (sax parser for PT used): 287 ms
[2025-05-31 08:12:54] [INFO ] Transformed 1988 places.
[2025-05-31 08:12:54] [INFO ] Transformed 2289 transitions.
[2025-05-31 08:12:54] [INFO ] Found NUPN structural information;
[2025-05-31 08:12:54] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 474 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 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 2289 rows 1988 cols
[2025-05-31 08:12:54] [INFO ] Computed 14 invariants in 110 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 (115 resets) in 83 ms. (119 steps per ms)
FORMULA FlexibleBarrier-PT-12b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110011 steps (127 resets) in 174 ms. (628 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 08:12:55] [INFO ] Invariant cache hit.
[2025-05-31 08:12:56] [INFO ] [Real]Absence check using 14 positive place invariants in 66 ms returned sat
[2025-05-31 08:12:57] [INFO ] [Real]Absence check using state equation in 1484 ms returned sat
[2025-05-31 08:12:58] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 300 ms.
[2025-05-31 08:12:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:12:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 66 ms returned sat
[2025-05-31 08:13:01] [INFO ] [Nat]Absence check using state equation in 1272 ms returned sat
[2025-05-31 08:13:01] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 189 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-05-31 08:13:04] [INFO ] [Real]Absence check using 14 positive place invariants in 59 ms returned sat
[2025-05-31 08:13:06] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2025-05-31 08:13:08] [INFO ] Deduced a trap composed of 213 places in 2373 ms of which 179 ms to minimize.
[2025-05-31 08:13:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:13:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 66 ms returned sat
[2025-05-31 08:13:10] [INFO ] [Nat]Absence check using state equation in 1312 ms returned sat
[2025-05-31 08:13:12] [INFO ] Deduced a trap composed of 213 places in 1807 ms of which 19 ms to minimize.
[2025-05-31 08:13:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2029 ms
[2025-05-31 08:13:13] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 237 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-31 08:13:14] [INFO ] [Real]Absence check using 14 positive place invariants in 67 ms returned sat
[2025-05-31 08:13:15] [INFO ] [Real]Absence check using state equation in 1228 ms returned sat
[2025-05-31 08:13:16] [INFO ] Deduced a trap composed of 234 places in 309 ms of which 15 ms to minimize.
[2025-05-31 08:13:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:13:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 63 ms returned sat
[2025-05-31 08:13:18] [INFO ] [Nat]Absence check using state equation in 1219 ms returned sat
[2025-05-31 08:13:18] [INFO ] Deduced a trap composed of 234 places in 200 ms of which 4 ms to minimize.
[2025-05-31 08:13:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 452 ms
[2025-05-31 08:13:18] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 257 ms.
[2025-05-31 08:13:21] [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.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-05-31 08:13:22] [INFO ] [Real]Absence check using 14 positive place invariants in 56 ms returned sat
[2025-05-31 08:13:23] [INFO ] [Real]Absence check using state equation in 1256 ms returned sat
[2025-05-31 08:13:25] [INFO ] Deduced a trap composed of 680 places in 1873 ms of which 24 ms to minimize.
[2025-05-31 08:13:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:13:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 95 ms returned sat
[2025-05-31 08:13:27] [INFO ] [Nat]Absence check using state equation in 1507 ms returned sat
[2025-05-31 08:13:29] [INFO ] Deduced a trap composed of 680 places in 1249 ms of which 14 ms to minimize.
[2025-05-31 08:13:30] [INFO ] Deduced a trap composed of 72 places in 1228 ms of which 15 ms to minimize.
[2025-05-31 08:13:32] [INFO ] Deduced a trap composed of 14 places in 1893 ms of which 18 ms to minimize.
[2025-05-31 08:13:32] [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-31 08:13:33] [INFO ] [Real]Absence check using 14 positive place invariants in 58 ms returned sat
[2025-05-31 08:13:34] [INFO ] [Real]Absence check using state equation in 1538 ms returned sat
[2025-05-31 08:13:34] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 173 ms.
[2025-05-31 08:13:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:13:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 55 ms returned sat
[2025-05-31 08:13:37] [INFO ] [Nat]Absence check using state equation in 1473 ms returned sat
[2025-05-31 08:13:37] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 173 ms.
[2025-05-31 08:13:40] [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.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-05-31 08:13:40] [INFO ] [Real]Absence check using 14 positive place invariants in 61 ms returned sat
[2025-05-31 08:13:42] [INFO ] [Real]Absence check using state equation in 1205 ms returned sat
[2025-05-31 08:13:42] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 200 ms.
[2025-05-31 08:13:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:13:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 90 ms returned sat
[2025-05-31 08:13:45] [INFO ] [Nat]Absence check using state equation in 1536 ms returned sat
[2025-05-31 08:13:45] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 241 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 08:13:48] [INFO ] [Real]Absence check using 14 positive place invariants in 58 ms returned sat
[2025-05-31 08:13:50] [INFO ] [Real]Absence check using state equation in 1756 ms returned sat
[2025-05-31 08:13:50] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 249 ms.
[2025-05-31 08:13:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:13:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 86 ms returned sat
[2025-05-31 08:13:54] [INFO ] [Nat]Absence check using state equation in 1905 ms returned sat
[2025-05-31 08:13:54] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 171 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 08:13:57] [INFO ] [Real]Absence check using 14 positive place invariants in 56 ms returned sat
[2025-05-31 08:13:59] [INFO ] [Real]Absence check using state equation in 1792 ms returned sat
[2025-05-31 08:14:00] [INFO ] Deduced a trap composed of 720 places in 1716 ms of which 25 ms to minimize.
[2025-05-31 08:14:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:14:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 56 ms returned sat
[2025-05-31 08:14:03] [INFO ] [Nat]Absence check using state equation in 1700 ms returned sat
[2025-05-31 08:14:05] [INFO ] Deduced a trap composed of 720 places in 1492 ms of which 14 ms to minimize.
[2025-05-31 08:14:07] [INFO ] Deduced a trap composed of 726 places in 1673 ms of which 23 ms to minimize.
[2025-05-31 08:14:07] [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.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-31 08:14:07] [INFO ] [Real]Absence check using 14 positive place invariants in 55 ms returned sat
[2025-05-31 08:14:09] [INFO ] [Real]Absence check using state equation in 1611 ms returned sat
[2025-05-31 08:14:11] [INFO ] Deduced a trap composed of 123 places in 1966 ms of which 21 ms to minimize.
[2025-05-31 08:14:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:14:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 84 ms returned sat
[2025-05-31 08:14:14] [INFO ] [Nat]Absence check using state equation in 1263 ms returned sat
[2025-05-31 08:14:15] [INFO ] Deduced a trap composed of 123 places in 1599 ms of which 14 ms to minimize.
[2025-05-31 08:14:17] [INFO ] Deduced a trap composed of 113 places in 1750 ms of which 15 ms to minimize.
[2025-05-31 08:14:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.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-31 08:14:18] [INFO ] [Real]Absence check using 14 positive place invariants in 82 ms returned sat
[2025-05-31 08:14:20] [INFO ] [Real]Absence check using state equation in 1719 ms returned sat
[2025-05-31 08:14:22] [INFO ] Deduced a trap composed of 226 places in 1718 ms of which 17 ms to minimize.
[2025-05-31 08:14:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:14:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 61 ms returned sat
[2025-05-31 08:14:24] [INFO ] [Nat]Absence check using state equation in 1800 ms returned sat
[2025-05-31 08:14:26] [INFO ] Deduced a trap composed of 226 places in 2054 ms of which 16 ms to minimize.
[2025-05-31 08:14:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2323 ms
[2025-05-31 08:14:27] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 217 ms.
[2025-05-31 08:14:27] [INFO ] Added : 0 causal constraints over 0 iterations in 223 ms. Result :unknown
[2025-05-31 08:14:27] [INFO ] [Real]Absence check using 14 positive place invariants in 53 ms returned sat
[2025-05-31 08:14:29] [INFO ] [Real]Absence check using state equation in 1296 ms returned sat
[2025-05-31 08:14:29] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 216 ms.
[2025-05-31 08:14:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:14:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 90 ms returned sat
[2025-05-31 08:14:31] [INFO ] [Nat]Absence check using state equation in 1197 ms returned sat
[2025-05-31 08:14:32] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 220 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1932 edges and 1988 vertex of which 74 / 1988 are part of one of the 12 SCC in 16 ms
Free SCC test removed 62 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 493 transitions
Trivial Post-agglo rules discarded 493 transitions
Performed 493 trivial Post agglomeration. Transition count delta: 493
Iterating post reduction 0 with 493 rules applied. Total rules applied 494 place count 1926 transition count 1721
Reduce places removed 493 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 497 rules applied. Total rules applied 991 place count 1433 transition count 1717
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 995 place count 1429 transition count 1717
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 995 place count 1429 transition count 1588
Deduced a syphon composed of 129 places in 2 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 1253 place count 1300 transition count 1588
Discarding 748 places :
Symmetric choice reduction at 3 with 748 rule applications. Total rules 2001 place count 552 transition count 840
Iterating global reduction 3 with 748 rules applied. Total rules applied 2749 place count 552 transition count 840
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 2749 place count 552 transition count 830
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2769 place count 542 transition count 830
Discarding 118 places :
Symmetric choice reduction at 3 with 118 rule applications. Total rules 2887 place count 424 transition count 712
Iterating global reduction 3 with 118 rules applied. Total rules applied 3005 place count 424 transition count 712
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 3 with 116 rules applied. Total rules applied 3121 place count 424 transition count 596
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 3245 place count 362 transition count 534
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 3268 place count 362 transition count 511
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 3279 place count 351 transition count 500
Iterating global reduction 5 with 11 rules applied. Total rules applied 3290 place count 351 transition count 500
Free-agglomeration rule applied 271 times.
Iterating global reduction 5 with 271 rules applied. Total rules applied 3561 place count 351 transition count 229
Reduce places removed 271 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Graph (complete) has 216 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 389 rules applied. Total rules applied 3950 place count 75 transition count 112
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 3957 place count 75 transition count 105
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 3958 place count 75 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3959 place count 74 transition count 104
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 55 edges and 73 vertex of which 20 / 73 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 3963 place count 63 transition count 102
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 3985 place count 61 transition count 82
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 3985 place count 61 transition count 72
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 4005 place count 51 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 4015 place count 51 transition count 62
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 4035 place count 41 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4037 place count 40 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 4039 place count 40 transition count 49
Free-agglomeration rule applied 11 times.
Iterating global reduction 10 with 11 rules applied. Total rules applied 4050 place count 40 transition count 38
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 25 rules applied. Total rules applied 4075 place count 25 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4076 place count 25 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 4077 place count 24 transition count 27
Applied a total of 4077 rules in 660 ms. Remains 24 /1988 variables (removed 1964) and now considering 27/2289 (removed 2262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 676 ms. Remains : 24/1988 places, 27/2289 transitions.
// Phase 1: matrix 27 rows 24 cols
[2025-05-31 08:14:35] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1211 ms. (825 steps per ms)
FORMULA FlexibleBarrier-PT-12b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 358 ms. (2785 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-31 08:14:37] [INFO ] Flatten gal took : 48 ms
[2025-05-31 08:14:37] [INFO ] Flatten gal took : 7 ms
[2025-05-31 08:14:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7491375945199276775.gal : 7 ms
[2025-05-31 08:14:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12988344058431229384.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/ReachabilityCardinality7491375945199276775.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12988344058431229384.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 103936 ms.

BK_STOP 1748679278110

--------------------
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="FlexibleBarrier-PT-12b"
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 FlexibleBarrier-PT-12b, 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 r097-smll-174860111800060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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