Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r241-tall-171649628400226.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is LeafsetExtension-PT-S32C2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628400226
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:42 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

here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716563312674

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C2
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 15:08:34] [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]
[2024-05-24 15:08:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:08:34] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2024-05-24 15:08:34] [INFO ] Transformed 5622 places.
[2024-05-24 15:08:34] [INFO ] Transformed 5449 transitions.
[2024-05-24 15:08:34] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2024-05-24 15:08:35] [INFO ] Computed 173 invariants in 335 ms
Incomplete random walk after 10000 steps, including 549 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 16) seen :12
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :1
[2024-05-24 15:08:35] [INFO ] Invariant cache hit.
[2024-05-24 15:08:36] [INFO ] [Real]Absence check using 35 positive place invariants in 73 ms returned sat
[2024-05-24 15:08:36] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 156 ms returned sat
[2024-05-24 15:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:08:39] [INFO ] [Real]Absence check using state equation in 3247 ms returned sat
[2024-05-24 15:08:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:08:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 60 ms returned sat
[2024-05-24 15:08:40] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 142 ms returned sat
[2024-05-24 15:08:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:08:43] [INFO ] [Nat]Absence check using state equation in 3419 ms returned sat
[2024-05-24 15:08:44] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 282 ms.
[2024-05-24 15:08:51] [INFO ] Deduced a trap composed of 2 places in 6819 ms of which 11 ms to minimize.
[2024-05-24 15:08: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-24 15:08:52] [INFO ] [Real]Absence check using 35 positive place invariants in 52 ms returned sat
[2024-05-24 15:08:52] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 146 ms returned sat
[2024-05-24 15:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:08:55] [INFO ] [Real]Absence check using state equation in 3166 ms returned sat
[2024-05-24 15:08:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:08:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 54 ms returned sat
[2024-05-24 15:08:56] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 142 ms returned sat
[2024-05-24 15:08:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:08:59] [INFO ] [Nat]Absence check using state equation in 3313 ms returned sat
[2024-05-24 15:08:59] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 232 ms.
[2024-05-24 15:09:07] [INFO ] Deduced a trap composed of 2 places in 6964 ms of which 7 ms to minimize.
[2024-05-24 15:09: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-24 15:09:08] [INFO ] [Real]Absence check using 35 positive place invariants in 63 ms returned sat
[2024-05-24 15:09:08] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 144 ms returned sat
[2024-05-24 15:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:09:11] [INFO ] [Real]Absence check using state equation in 3237 ms returned sat
[2024-05-24 15:09:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:09:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 57 ms returned sat
[2024-05-24 15:09:12] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 140 ms returned sat
[2024-05-24 15:09:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:09:15] [INFO ] [Nat]Absence check using state equation in 3260 ms returned sat
[2024-05-24 15:09:16] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 280 ms.
[2024-05-24 15:09:23] [INFO ] Deduced a trap composed of 2 places in 6653 ms of which 6 ms to minimize.
[2024-05-24 15:09:23] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-24 15:09:23] [INFO ] [Real]Absence check using 35 positive place invariants in 56 ms returned sat
[2024-05-24 15:09:24] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 139 ms returned sat
[2024-05-24 15:09:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:09:27] [INFO ] [Real]Absence check using state equation in 3349 ms returned sat
[2024-05-24 15:09:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:09:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 55 ms returned sat
[2024-05-24 15:09:28] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 138 ms returned sat
[2024-05-24 15:09:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:09:31] [INFO ] [Nat]Absence check using state equation in 3397 ms returned sat
[2024-05-24 15:09:32] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 280 ms.
[2024-05-24 15:09:39] [INFO ] Deduced a trap composed of 2 places in 6485 ms of which 5 ms to minimize.
[2024-05-24 15:09:39] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-24 15:09:39] [INFO ] [Real]Absence check using 35 positive place invariants in 54 ms returned sat
[2024-05-24 15:09:39] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 144 ms returned sat
[2024-05-24 15:09:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:09:43] [INFO ] [Real]Absence check using state equation in 3305 ms returned sat
[2024-05-24 15:09:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:09:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 56 ms returned sat
[2024-05-24 15:09:43] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 138 ms returned sat
[2024-05-24 15:09:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:09:47] [INFO ] [Nat]Absence check using state equation in 3317 ms returned sat
[2024-05-24 15:09:47] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 241 ms.
[2024-05-24 15:09:54] [INFO ] Deduced a trap composed of 2 places in 6407 ms of which 5 ms to minimize.
[2024-05-24 15:09:54] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-24 15:09:55] [INFO ] [Real]Absence check using 35 positive place invariants in 52 ms returned sat
[2024-05-24 15:09:55] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 154 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, -1, -1, -1, 1, 1] Max seen :[0, 1, 0, 0, 0, 1]
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 284 are kept as prefixes of interest. Removing 5338 places using SCC suffix rule.12 ms
Discarding 5338 places :
Also discarding 3085 output transitions
Drop transitions removed 3085 transitions
Drop transitions removed 1099 transitions
Reduce isomorphic transitions removed 1099 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 1164 rules applied. Total rules applied 1165 place count 282 transition count 1202
Reduce places removed 65 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 69 rules applied. Total rules applied 1234 place count 217 transition count 1198
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1238 place count 213 transition count 1198
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1238 place count 213 transition count 1193
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1248 place count 208 transition count 1193
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1263 place count 193 transition count 1178
Iterating global reduction 3 with 15 rules applied. Total rules applied 1278 place count 193 transition count 1178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1282 place count 191 transition count 1176
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1286 place count 191 transition count 1172
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1290 place count 187 transition count 1172
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 4 with 58 rules applied. Total rules applied 1348 place count 187 transition count 1172
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 1350 place count 185 transition count 1172
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1351 place count 185 transition count 1171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1352 place count 184 transition count 1171
Applied a total of 1352 rules in 184 ms. Remains 184 /5622 variables (removed 5438) and now considering 1171/5449 (removed 4278) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 184/5622 places, 1171/5449 transitions.
Successfully produced net in file /tmp/petri1000_15271544584659813207.dot
Successfully produced net in file /tmp/petri1001_3613604261890199637.dot
Successfully produced net in file /tmp/petri1002_3301271624333870255.dot
Successfully produced net in file /tmp/petri1003_4861530223027635226.dot
Successfully produced net in file /tmp/petri1004_1306938086982640385.dot
Successfully produced net in file /tmp/petri1005_17428253042611741162.dot
Successfully produced net in file /tmp/petri1006_11423461278450725851.dot
Successfully produced net in file /tmp/petri1007_18161581221801394408.dot
Successfully produced net in file /tmp/petri1008_18231980551663254354.dot
Successfully produced net in file /tmp/petri1009_13245483938534869609.dot
Successfully produced net in file /tmp/petri1010_400583845403027579.dot
Successfully produced net in file /tmp/petri1011_1749218099300053322.dot
Successfully produced net in file /tmp/petri1012_336869908478600521.dot
Successfully produced net in file /tmp/petri1013_15769388427243695440.dot
Successfully produced net in file /tmp/petri1014_1480846724562510933.dot
Successfully produced net in file /tmp/petri1015_3277825913461466464.dot
Successfully produced net in file /tmp/petri1016_14353062300448622346.dot
Successfully produced net in file /tmp/petri1017_18358630529514959294.dot
Successfully produced net in file /tmp/petri1018_11541450894832154887.dot
Successfully produced net in file /tmp/petri1019_14904673320959965472.dot
Successfully produced net in file /tmp/petri1020_7491613255972258606.dot
Successfully produced net in file /tmp/petri1021_10549034812013263828.dot
Successfully produced net in file /tmp/petri1022_4516037731272221953.dot
Successfully produced net in file /tmp/petri1023_11968028908704017671.dot
Successfully produced net in file /tmp/petri1024_14881328368893056982.dot
Successfully produced net in file /tmp/petri1025_11465936771287055395.dot
Successfully produced net in file /tmp/petri1026_11228815733204888896.dot
Successfully produced net in file /tmp/petri1027_4313405128798012653.dot
Successfully produced net in file /tmp/petri1028_5089458221914192803.dot
Successfully produced net in file /tmp/petri1029_36780838514058419.dot
Drop transitions removed 30 transitions
Dominated transitions for bounds rules discarded 30 transitions
Normalized transition count is 198 out of 1141 initially.
// Phase 1: matrix 198 rows 184 cols
[2024-05-24 15:09:55] [INFO ] Computed 2 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 185769 resets, run finished after 3069 ms. (steps per millisecond=325 ) properties (out of 5) seen :6
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 11191 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11278 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 11251 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 3) seen :4
[2024-05-24 15:10:01] [INFO ] Flow matrix only has 198 transitions (discarded 943 similar events)
// Phase 1: matrix 198 rows 184 cols
[2024-05-24 15:10:01] [INFO ] Computed 2 invariants in 5 ms
[2024-05-24 15:10:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 15:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:10:01] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
[2024-05-24 15:10:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-24 15:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:10:01] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
[2024-05-24 15:10:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-24 15:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:10:01] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 1, 1] Max seen :[2, 1, 1]
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 87091 ms.

BK_STOP 1716563404902

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="LeafsetExtension-PT-S32C2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is LeafsetExtension-PT-S32C2, 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 r241-tall-171649628400226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S32C2.tgz
mv LeafsetExtension-PT-S32C2 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;