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-167856440400063.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-S32C2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440400063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 14K Feb 25 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:58 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-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 1678751498466

Running Version 202205111006
[2023-03-13 23:51:39] [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:51:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:51:40] [INFO ] Load time of PNML (sax parser for PT used): 325 ms
[2023-03-13 23:51:40] [INFO ] Transformed 5622 places.
[2023-03-13 23:51:40] [INFO ] Transformed 5449 transitions.
[2023-03-13 23:51:40] [INFO ] Parsed PT model containing 5622 places and 5449 transitions in 453 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-13 23:51:40] [INFO ] Computed 173 place invariants in 438 ms
Incomplete random walk after 10000 steps, including 547 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :10
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :2
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) 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 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :3
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-13 23:51:41] [INFO ] Computed 173 place invariants in 209 ms
[2023-03-13 23:51:41] [INFO ] [Real]Absence check using 35 positive place invariants in 64 ms returned sat
[2023-03-13 23:51:41] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 103 ms returned unsat
[2023-03-13 23:51:42] [INFO ] [Real]Absence check using 35 positive place invariants in 63 ms returned sat
[2023-03-13 23:51:42] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 130 ms returned sat
[2023-03-13 23:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:51:45] [INFO ] [Real]Absence check using state equation in 3292 ms returned sat
[2023-03-13 23:51:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:51:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 67 ms returned sat
[2023-03-13 23:51:46] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 142 ms returned sat
[2023-03-13 23:51:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:51:50] [INFO ] [Nat]Absence check using state equation in 3176 ms returned sat
[2023-03-13 23:51:50] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 270 ms.
[2023-03-13 23:51:57] [INFO ] Deduced a trap composed of 2 places in 6329 ms of which 10 ms to minimize.
[2023-03-13 23:51:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:51:58] [INFO ] [Real]Absence check using 35 positive place invariants in 74 ms returned sat
[2023-03-13 23:51:58] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 149 ms returned sat
[2023-03-13 23:51:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:52:01] [INFO ] [Real]Absence check using state equation in 3247 ms returned sat
[2023-03-13 23:52:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:52:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 63 ms returned sat
[2023-03-13 23:52:02] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 150 ms returned sat
[2023-03-13 23:52:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:52:05] [INFO ] [Nat]Absence check using state equation in 3404 ms returned sat
[2023-03-13 23:52:06] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 289 ms.
[2023-03-13 23:52:06] [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.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:52:07] [INFO ] [Real]Absence check using 35 positive place invariants in 56 ms returned sat
[2023-03-13 23:52:07] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 132 ms returned unsat
[2023-03-13 23:52:08] [INFO ] [Real]Absence check using 35 positive place invariants in 57 ms returned sat
[2023-03-13 23:52:08] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 137 ms returned sat
[2023-03-13 23:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:52:11] [INFO ] [Real]Absence check using state equation in 3313 ms returned sat
[2023-03-13 23:52:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:52:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 56 ms returned sat
[2023-03-13 23:52:12] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 129 ms returned sat
[2023-03-13 23:52:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:52:15] [INFO ] [Nat]Absence check using state equation in 3341 ms returned sat
[2023-03-13 23:52:16] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 280 ms.
[2023-03-13 23:52:23] [INFO ] Deduced a trap composed of 2 places in 6854 ms of which 9 ms to minimize.
[2023-03-13 23:52: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 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: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:52:24] [INFO ] [Real]Absence check using 35 positive place invariants in 58 ms returned sat
[2023-03-13 23:52:24] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 146 ms returned sat
[2023-03-13 23:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:52:27] [INFO ] [Real]Absence check using state equation in 3317 ms returned sat
[2023-03-13 23:52:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:52:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 69 ms returned sat
[2023-03-13 23:52:28] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 134 ms returned sat
[2023-03-13 23:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:52:31] [INFO ] [Nat]Absence check using state equation in 3231 ms returned sat
[2023-03-13 23:52:32] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 259 ms.
[2023-03-13 23:52:39] [INFO ] Deduced a trap composed of 2 places in 6812 ms of which 6 ms to minimize.
[2023-03-13 23:52: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 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.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)
Current structural bounds on expressions (after SMT) : [1, 1, -1, 1, 1, 1] Max seen :[1, 0, 1, 1, 0, 0]
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 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 228 are kept as prefixes of interest. Removing 5394 places using SCC suffix rule.17 ms
Discarding 5394 places :
Also discarding 3167 output transitions
Drop transitions removed 3167 transitions
Drop transitions removed 1103 transitions
Reduce isomorphic transitions removed 1103 transitions.
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 1167 rules applied. Total rules applied 1168 place count 211 transition count 1132
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 82 rules applied. Total rules applied 1250 place count 161 transition count 1100
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 1267 place count 144 transition count 1100
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1267 place count 144 transition count 1096
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1275 place count 140 transition count 1096
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1290 place count 125 transition count 1081
Iterating global reduction 3 with 15 rules applied. Total rules applied 1305 place count 125 transition count 1081
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1309 place count 123 transition count 1079
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1311 place count 123 transition count 1077
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1313 place count 121 transition count 1077
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 4 with 18 rules applied. Total rules applied 1331 place count 121 transition count 1059
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1349 place count 103 transition count 1059
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 5 with 28 rules applied. Total rules applied 1377 place count 103 transition count 1059
Applied a total of 1377 rules in 206 ms. Remains 103 /5622 variables (removed 5519) and now considering 1059/5449 (removed 4390) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/5622 places, 1059/5449 transitions.
Successfully produced net in file /tmp/petri1000_3174216485952736279.dot
Successfully produced net in file /tmp/petri1001_7378510411156916764.dot
Successfully produced net in file /tmp/petri1002_5125304338317137682.dot
Successfully produced net in file /tmp/petri1003_17943709575409641481.dot
Successfully produced net in file /tmp/petri1004_6101957561113294827.dot
Successfully produced net in file /tmp/petri1005_15030073893778399866.dot
Successfully produced net in file /tmp/petri1006_4418067804834621426.dot
Successfully produced net in file /tmp/petri1007_1306117598542685709.dot
Successfully produced net in file /tmp/petri1008_17579940425904044109.dot
Successfully produced net in file /tmp/petri1009_456107322539837575.dot
Successfully produced net in file /tmp/petri1010_4787248506124591291.dot
Successfully produced net in file /tmp/petri1011_17891542820572703160.dot
Successfully produced net in file /tmp/petri1012_10442006207652173429.dot
Successfully produced net in file /tmp/petri1013_14661381023043099209.dot
Successfully produced net in file /tmp/petri1014_1966263537763104875.dot
Successfully produced net in file /tmp/petri1015_14516959092260273480.dot
Successfully produced net in file /tmp/petri1016_13768759193832163574.dot
Successfully produced net in file /tmp/petri1017_18220576968980059807.dot
Successfully produced net in file /tmp/petri1018_4231350743886323400.dot
Successfully produced net in file /tmp/petri1019_17265146746234517253.dot
Successfully produced net in file /tmp/petri1020_4073835222839824604.dot
Successfully produced net in file /tmp/petri1021_15673344853016666191.dot
Successfully produced net in file /tmp/petri1022_11749395844806523106.dot
Successfully produced net in file /tmp/petri1023_6867892601548632140.dot
Successfully produced net in file /tmp/petri1024_11898275694057402369.dot
Successfully produced net in file /tmp/petri1025_18000610582739701823.dot
Successfully produced net in file /tmp/petri1026_9984568753539452257.dot
Successfully produced net in file /tmp/petri1027_962286296633858537.dot
Successfully produced net in file /tmp/petri1028_5583756447369316863.dot
Successfully produced net in file /tmp/petri1029_164294649902170366.dot
Successfully produced net in file /tmp/petri1030_14168752373773329564.dot
Successfully produced net in file /tmp/petri1031_13685135478704715464.dot
Successfully produced net in file /tmp/petri1032_6032373987670647931.dot
Successfully produced net in file /tmp/petri1033_745599612415204352.dot
Successfully produced net in file /tmp/petri1034_10081246594692434629.dot
Successfully produced net in file /tmp/petri1035_2976311793344682312.dot
Successfully produced net in file /tmp/petri1036_10222951757366462456.dot
Successfully produced net in file /tmp/petri1037_2486166992706438634.dot
Successfully produced net in file /tmp/petri1038_17095733416346235088.dot
Successfully produced net in file /tmp/petri1039_17517192076654713897.dot
Successfully produced net in file /tmp/petri1040_7899018395927704564.dot
Successfully produced net in file /tmp/petri1041_3420567577595100577.dot
Successfully produced net in file /tmp/petri1042_12174897606365277847.dot
Successfully produced net in file /tmp/petri1043_10245492550882314986.dot
Successfully produced net in file /tmp/petri1044_8470609714690207465.dot
Successfully produced net in file /tmp/petri1045_16247750074045406144.dot
Successfully produced net in file /tmp/petri1046_4581915160544709239.dot
Successfully produced net in file /tmp/petri1047_9173722125942808199.dot
Successfully produced net in file /tmp/petri1048_15562320741255269523.dot
Successfully produced net in file /tmp/petri1049_2418569174056237340.dot
Successfully produced net in file /tmp/petri1050_9012487404287089117.dot
Successfully produced net in file /tmp/petri1051_13874433700178820503.dot
Successfully produced net in file /tmp/petri1052_15197573550054866443.dot
Successfully produced net in file /tmp/petri1053_9179654235947323836.dot
Successfully produced net in file /tmp/petri1054_17038292408642293416.dot
Successfully produced net in file /tmp/petri1055_8640481334160378050.dot
Successfully produced net in file /tmp/petri1056_8234803794940427563.dot
Successfully produced net in file /tmp/petri1057_17438845858373739221.dot
Successfully produced net in file /tmp/petri1058_18249309389732851794.dot
Successfully produced net in file /tmp/petri1059_18265801900382415543.dot
Successfully produced net in file /tmp/petri1060_5967830544355016933.dot
Successfully produced net in file /tmp/petri1061_12593711089759044561.dot
Successfully produced net in file /tmp/petri1062_5552028160860708172.dot
Successfully produced net in file /tmp/petri1063_10252677155029238927.dot
Successfully produced net in file /tmp/petri1064_5660669337300256616.dot
Successfully produced net in file /tmp/petri1065_2902357694381111703.dot
Successfully produced net in file /tmp/petri1066_13056278267136326561.dot
Successfully produced net in file /tmp/petri1067_4694677048278918481.dot
Successfully produced net in file /tmp/petri1068_18104476312158725934.dot
Successfully produced net in file /tmp/petri1069_14438927050214809738.dot
Successfully produced net in file /tmp/petri1070_4860726518342287147.dot
Successfully produced net in file /tmp/petri1071_6708526275864566544.dot
Successfully produced net in file /tmp/petri1072_2330123689717749737.dot
Successfully produced net in file /tmp/petri1073_8771203337098540753.dot
Successfully produced net in file /tmp/petri1074_18171823377788328844.dot
Successfully produced net in file /tmp/petri1075_6197958193264590932.dot
Successfully produced net in file /tmp/petri1076_5219979940998608278.dot
Successfully produced net in file /tmp/petri1077_14052355066541730335.dot
Successfully produced net in file /tmp/petri1078_2189843076265507138.dot
Successfully produced net in file /tmp/petri1079_12455489757152418020.dot
Successfully produced net in file /tmp/petri1080_9404893240044589644.dot
Successfully produced net in file /tmp/petri1081_2651837495878330277.dot
Successfully produced net in file /tmp/petri1082_8293287397824719269.dot
Successfully produced net in file /tmp/petri1083_4496294034181240514.dot
Successfully produced net in file /tmp/petri1084_255376118259797942.dot
Successfully produced net in file /tmp/petri1085_2741951839786117183.dot
Successfully produced net in file /tmp/petri1086_1648679430735427190.dot
Successfully produced net in file /tmp/petri1087_7561458200758405389.dot
Successfully produced net in file /tmp/petri1088_10214178035768828486.dot
Successfully produced net in file /tmp/petri1089_3375416729120313592.dot
Successfully produced net in file /tmp/petri1090_11729949860800516340.dot
Successfully produced net in file /tmp/petri1091_1588354930941276183.dot
Successfully produced net in file /tmp/petri1092_13095699419633143162.dot
Successfully produced net in file /tmp/petri1093_4704101030847174695.dot
Successfully produced net in file /tmp/petri1094_5236762997396572742.dot
Successfully produced net in file /tmp/petri1095_11023373754905719902.dot
Successfully produced net in file /tmp/petri1096_12865906833293081642.dot
Successfully produced net in file /tmp/petri1097_7679327963558730731.dot
Successfully produced net in file /tmp/petri1098_8512962909254931385.dot
Successfully produced net in file /tmp/petri1099_13492494016790747329.dot
Successfully produced net in file /tmp/petri1100_14889495382356879623.dot
Successfully produced net in file /tmp/petri1101_484087418337412585.dot
Successfully produced net in file /tmp/petri1102_18168765052344707145.dot
Successfully produced net in file /tmp/petri1103_16196741065609730137.dot
Successfully produced net in file /tmp/petri1104_11790913618775737698.dot
Successfully produced net in file /tmp/petri1105_16064776457395816972.dot
Successfully produced net in file /tmp/petri1106_12146771670715138522.dot
Successfully produced net in file /tmp/petri1107_8761082468360791399.dot
Successfully produced net in file /tmp/petri1108_9937242543506171167.dot
Successfully produced net in file /tmp/petri1109_7909482036159249266.dot
Successfully produced net in file /tmp/petri1110_17390169596532866560.dot
Successfully produced net in file /tmp/petri1111_6589834952831825483.dot
Successfully produced net in file /tmp/petri1112_9804037408110526966.dot
Successfully produced net in file /tmp/petri1113_4963180151123445384.dot
Successfully produced net in file /tmp/petri1114_7704456569062838687.dot
Successfully produced net in file /tmp/petri1115_17598386474468981108.dot
Successfully produced net in file /tmp/petri1116_7647665499475492786.dot
Successfully produced net in file /tmp/petri1117_8556498602522032103.dot
Successfully produced net in file /tmp/petri1118_10144458735334376984.dot
Successfully produced net in file /tmp/petri1119_3291403267849799456.dot
Successfully produced net in file /tmp/petri1120_7392164698883439547.dot
Successfully produced net in file /tmp/petri1121_13348218893655914206.dot
Successfully produced net in file /tmp/petri1122_10366915219478768469.dot
Successfully produced net in file /tmp/petri1123_9570544790201142822.dot
Successfully produced net in file /tmp/petri1124_14278667660425880066.dot
Successfully produced net in file /tmp/petri1125_1314102912842250448.dot
Successfully produced net in file /tmp/petri1126_10155479493322883722.dot
Successfully produced net in file /tmp/petri1127_5784777666250140052.dot
Successfully produced net in file /tmp/petri1128_921392607935970880.dot
Successfully produced net in file /tmp/petri1129_378396754861314830.dot
Successfully produced net in file /tmp/petri1130_1620855837663897825.dot
Successfully produced net in file /tmp/petri1131_17856057971806864624.dot
Successfully produced net in file /tmp/petri1132_10664932738817015172.dot
Successfully produced net in file /tmp/petri1133_17281029034909755043.dot
Successfully produced net in file /tmp/petri1134_54382654220021092.dot
Drop transitions removed 135 transitions
Dominated transitions for bounds rules discarded 135 transitions
Normalized transition count is 131 out of 924 initially.
// Phase 1: matrix 131 rows 103 cols
[2023-03-13 23:52:40] [INFO ] Computed 3 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 195754 resets, run finished after 3359 ms. (steps per millisecond=297 ) properties (out of 4) seen :5
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 8264 resets, run finished after 704 ms. (steps per millisecond=1420 ) properties (out of 1) seen :2
[2023-03-13 23:52:44] [INFO ] Flow matrix only has 131 transitions (discarded 793 similar events)
// Phase 1: matrix 131 rows 103 cols
[2023-03-13 23:52:44] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-13 23:52:44] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-13 23:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:52:44] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
Current structural bounds on expressions (after SMT) : [2] Max seen :[2]
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 64893 ms.

BK_STOP 1678751564558

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-S32C2"
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-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 r255-tall-167856440400063"
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 ;