Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r255-tall-167856440400065.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is LeafsetExtension-PT-S32C4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440400065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 11K Feb 25 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.4M Mar 5 18:22 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-S32C4-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678751621613

Running Version 202205111006
[2023-03-13 23:53:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-13 23:53:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:53:43] [INFO ] Load time of PNML (sax parser for PT used): 310 ms
[2023-03-13 23:53:43] [INFO ] Transformed 5622 places.
[2023-03-13 23:53:43] [INFO ] Transformed 5449 transitions.
[2023-03-13 23:53:43] [INFO ] Parsed PT model containing 5622 places and 5449 transitions in 560 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-13 23:53:44] [INFO ] Computed 173 place invariants in 590 ms
Incomplete random walk after 10000 steps, including 299 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 16) seen :8
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :2
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :2
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :2
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :1
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-13 23:53:44] [INFO ] Computed 173 place invariants in 191 ms
[2023-03-13 23:53:45] [INFO ] [Real]Absence check using 35 positive place invariants in 71 ms returned sat
[2023-03-13 23:53:45] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 137 ms returned sat
[2023-03-13 23:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:53:48] [INFO ] [Real]Absence check using state equation in 3215 ms returned sat
[2023-03-13 23:53:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:53:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 69 ms returned sat
[2023-03-13 23:53:49] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 129 ms returned sat
[2023-03-13 23:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:53:52] [INFO ] [Nat]Absence check using state equation in 3236 ms returned sat
[2023-03-13 23:53:53] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 326 ms.
[2023-03-13 23:53: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2023-03-13 23:53:54] [INFO ] [Real]Absence check using 35 positive place invariants in 65 ms returned sat
[2023-03-13 23:53:54] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 127 ms returned sat
[2023-03-13 23:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:53:57] [INFO ] [Real]Absence check using state equation in 3148 ms returned sat
[2023-03-13 23:53:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:53:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 65 ms returned sat
[2023-03-13 23:53:58] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 122 ms returned sat
[2023-03-13 23:53:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:54:01] [INFO ] [Nat]Absence check using state equation in 3112 ms returned sat
[2023-03-13 23:54:02] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 266 ms.
[2023-03-13 23:54:09] [INFO ] Deduced a trap composed of 2 places in 6707 ms of which 10 ms to minimize.
[2023-03-13 23:54:09] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2023-03-13 23:54:10] [INFO ] [Real]Absence check using 35 positive place invariants in 61 ms returned sat
[2023-03-13 23:54:10] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 137 ms returned sat
[2023-03-13 23:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:54:13] [INFO ] [Real]Absence check using state equation in 3297 ms returned sat
[2023-03-13 23:54:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:54:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 61 ms returned sat
[2023-03-13 23:54:14] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 131 ms returned sat
[2023-03-13 23:54:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:54:18] [INFO ] [Nat]Absence check using state equation in 3327 ms returned sat
[2023-03-13 23:54:18] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 271 ms.
[2023-03-13 23:54:26] [INFO ] Deduced a trap composed of 2 places in 6913 ms of which 7 ms to minimize.
[2023-03-13 23:54:26] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2023-03-13 23:54:26] [INFO ] [Real]Absence check using 35 positive place invariants in 55 ms returned sat
[2023-03-13 23:54:26] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 136 ms returned sat
[2023-03-13 23:54:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:54:29] [INFO ] [Real]Absence check using state equation in 3167 ms returned sat
[2023-03-13 23:54:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:54:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 54 ms returned sat
[2023-03-13 23:54:30] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 129 ms returned sat
[2023-03-13 23:54:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:54:33] [INFO ] [Nat]Absence check using state equation in 2979 ms returned sat
[2023-03-13 23:54:34] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 233 ms.
[2023-03-13 23:54:42] [INFO ] Deduced a trap composed of 2 places in 7062 ms of which 6 ms to minimize.
[2023-03-13 23:54:42] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2023-03-13 23:54:42] [INFO ] [Real]Absence check using 35 positive place invariants in 52 ms returned sat
[2023-03-13 23:54:42] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 103 ms returned unsat
[2023-03-13 23:54:43] [INFO ] [Real]Absence check using 35 positive place invariants in 67 ms returned sat
[2023-03-13 23:54:43] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 133 ms returned sat
[2023-03-13 23:54:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:54:46] [INFO ] [Real]Absence check using state equation in 3196 ms returned sat
[2023-03-13 23:54:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:54:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 60 ms returned sat
[2023-03-13 23:54:47] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 134 ms returned sat
[2023-03-13 23:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:54:51] [INFO ] [Nat]Absence check using state equation in 3342 ms returned sat
[2023-03-13 23:54:51] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 259 ms.
[2023-03-13 23:54:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2023-03-13 23:54:52] [INFO ] [Real]Absence check using 35 positive place invariants in 53 ms returned sat
[2023-03-13 23:54:52] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 124 ms returned sat
[2023-03-13 23:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:54:56] [INFO ] [Real]Absence check using state equation in 3279 ms returned sat
[2023-03-13 23:54:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:54:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 54 ms returned sat
[2023-03-13 23:54:57] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 119 ms returned sat
[2023-03-13 23:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:55:00] [INFO ] [Nat]Absence check using state equation in 3251 ms returned sat
[2023-03-13 23:55:00] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 274 ms.
[2023-03-13 23:55: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 6
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, -1, 1, 1, 1] Max seen :[0, 0, 0, 1, 1, 0, 0]
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 5622 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 267 are kept as prefixes of interest. Removing 5355 places using SCC suffix rule.16 ms
Discarding 5355 places :
Also discarding 3101 output transitions
Drop transitions removed 3101 transitions
Drop transitions removed 1100 transitions
Reduce isomorphic transitions removed 1100 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 1164 rules applied. Total rules applied 1165 place count 265 transition count 1186
Reduce places removed 64 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 67 rules applied. Total rules applied 1232 place count 201 transition count 1183
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1235 place count 198 transition count 1183
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1235 place count 198 transition count 1178
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 1245 place count 193 transition count 1178
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1260 place count 178 transition count 1163
Iterating global reduction 3 with 15 rules applied. Total rules applied 1275 place count 178 transition count 1163
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 1279 place count 176 transition count 1161
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 1282 place count 176 transition count 1158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1285 place count 173 transition count 1158
Partial Free-agglomeration rule applied 44 times.
Drop transitions removed 44 transitions
Iterating global reduction 4 with 44 rules applied. Total rules applied 1329 place count 173 transition count 1158
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 1331 place count 171 transition count 1158
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1332 place count 171 transition count 1157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1333 place count 170 transition count 1157
Applied a total of 1333 rules in 239 ms. Remains 170 /5622 variables (removed 5452) and now considering 1157/5449 (removed 4292) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/5622 places, 1157/5449 transitions.
Successfully produced net in file /tmp/petri1000_3957728762274069026.dot
Successfully produced net in file /tmp/petri1001_12872353400583368446.dot
Successfully produced net in file /tmp/petri1002_4787388911944893249.dot
Successfully produced net in file /tmp/petri1003_5001056164491147780.dot
Successfully produced net in file /tmp/petri1004_9384208108533995671.dot
Successfully produced net in file /tmp/petri1005_3617564841044565920.dot
Successfully produced net in file /tmp/petri1006_4759055327598634918.dot
Successfully produced net in file /tmp/petri1007_6686933586888530566.dot
Successfully produced net in file /tmp/petri1008_2549982659050101265.dot
Successfully produced net in file /tmp/petri1009_7227619972783700758.dot
Successfully produced net in file /tmp/petri1010_6242704026268658494.dot
Successfully produced net in file /tmp/petri1011_315058350897707209.dot
Successfully produced net in file /tmp/petri1012_186083844923015869.dot
Successfully produced net in file /tmp/petri1013_8181567820739238001.dot
Successfully produced net in file /tmp/petri1014_16843491775720708118.dot
Successfully produced net in file /tmp/petri1015_6700226329352244191.dot
Successfully produced net in file /tmp/petri1016_16790207898707085465.dot
Successfully produced net in file /tmp/petri1017_5116880020210368426.dot
Successfully produced net in file /tmp/petri1018_3544215621993731852.dot
Successfully produced net in file /tmp/petri1019_16349707894063165306.dot
Successfully produced net in file /tmp/petri1020_18182966076106366708.dot
Successfully produced net in file /tmp/petri1021_12622449868700178287.dot
Successfully produced net in file /tmp/petri1022_3773328365270207843.dot
Successfully produced net in file /tmp/petri1023_12508610905071300219.dot
Successfully produced net in file /tmp/petri1024_17270554054961449964.dot
Successfully produced net in file /tmp/petri1025_4629734441299512895.dot
Successfully produced net in file /tmp/petri1026_14884424804922107367.dot
Successfully produced net in file /tmp/petri1027_5058503371750983253.dot
Successfully produced net in file /tmp/petri1028_1184402667350809559.dot
Successfully produced net in file /tmp/petri1029_14705386304736931674.dot
Drop transitions removed 30 transitions
Dominated transitions for bounds rules discarded 30 transitions
Normalized transition count is 169 out of 1127 initially.
// Phase 1: matrix 169 rows 170 cols
[2023-03-13 23:55:01] [INFO ] Computed 4 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 91486 resets, run finished after 3291 ms. (steps per millisecond=303 ) properties (out of 6) seen :9
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5031 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 1) seen :4
[2023-03-13 23:55:05] [INFO ] Flow matrix only has 169 transitions (discarded 958 similar events)
// Phase 1: matrix 169 rows 170 cols
[2023-03-13 23:55:05] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-13 23:55:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 23:55:06] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-13 23:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:55:06] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 83304 ms.

BK_STOP 1678751706113

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S32C4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is LeafsetExtension-PT-S32C4, 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 r255-tall-167856440400065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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