fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r159-smll-167819445100019
Last Updated
May 14, 2023

About the Execution of 2022-gold for Diffusion2D-PT-D10N200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
388.039 82208.00 103292.00 426.50 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 200 normal

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.r159-smll-167819445100019.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 Diffusion2D-PT-D10N200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-smll-167819445100019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.5K Feb 26 04:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 04:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 04:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 04:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 04:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 04:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 04:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 255K 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 Diffusion2D-PT-D10N200-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678464626993

Running Version 202205111006
[2023-03-10 16:10:29] [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-10 16:10:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:10:30] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2023-03-10 16:10:30] [INFO ] Transformed 100 places.
[2023-03-10 16:10:30] [INFO ] Transformed 684 transitions.
[2023-03-10 16:10:30] [INFO ] Parsed PT model containing 100 places and 684 transitions in 541 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 684 rows 100 cols
[2023-03-10 16:10:30] [INFO ] Computed 1 place invariants in 45 ms
Incomplete random walk after 10052 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=837 ) properties (out of 16) seen :600
FORMULA Diffusion2D-PT-D10N200-UpperBounds-13 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-09 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :197
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :7
// Phase 1: matrix 684 rows 100 cols
[2023-03-10 16:10:30] [INFO ] Computed 1 place invariants in 13 ms
[2023-03-10 16:10:31] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-10 16:10:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:10:31] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2023-03-10 16:10:31] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 152 ms.
[2023-03-10 16:10:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:10:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-10 16:10:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:10:32] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2023-03-10 16:10:32] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 97 ms.
[2023-03-10 16:10:37] [INFO ] Deduced a trap composed of 100 places in 176 ms of which 7 ms to minimize.
[2023-03-10 16:10:37] [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.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-10 16:10:37] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:10:37] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-10 16:10:37] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 90 ms.
[2023-03-10 16:10:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:10:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-10 16:10:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:10:37] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2023-03-10 16:10:37] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 87 ms.
[2023-03-10 16:10:42] [INFO ] Added : 275 causal constraints over 55 iterations in 4775 ms. Result :unknown
[2023-03-10 16:10:42] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-10 16:10:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:10:42] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2023-03-10 16:10:43] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 94 ms.
[2023-03-10 16:10:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:10:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:10:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:10:43] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2023-03-10 16:10:43] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 86 ms.
[2023-03-10 16:10:48] [INFO ] Added : 255 causal constraints over 51 iterations in 4703 ms. Result :unknown
[2023-03-10 16:10:48] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:10:48] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-03-10 16:10:48] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 88 ms.
[2023-03-10 16:10:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:10:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:10:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:10:49] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-10 16:10:49] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 71 ms.
[2023-03-10 16:10:53] [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.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-10 16:10:53] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-10 16:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:10:54] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2023-03-10 16:10:54] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 74 ms.
[2023-03-10 16:10:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:10:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:10:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:10:54] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2023-03-10 16:10:54] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 84 ms.
[2023-03-10 16:10:59] [INFO ] Added : 280 causal constraints over 56 iterations in 4628 ms. Result :unknown
[2023-03-10 16:10:59] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:10:59] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2023-03-10 16:10:59] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 56 ms.
[2023-03-10 16:10:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:10:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:00] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2023-03-10 16:11:00] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-10 16:11:04] [INFO ] Added : 280 causal constraints over 56 iterations in 4788 ms. Result :unknown
[2023-03-10 16:11:04] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-10 16:11:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:05] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2023-03-10 16:11:05] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 63 ms.
[2023-03-10 16:11:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:11:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:11:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:05] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-03-10 16:11:05] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 57 ms.
[2023-03-10 16:11:10] [INFO ] Added : 280 causal constraints over 56 iterations in 4755 ms. Result :unknown
[2023-03-10 16:11:10] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:11:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:10] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-03-10 16:11:10] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 76 ms.
[2023-03-10 16:11:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:11:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:11:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:11] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2023-03-10 16:11:11] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 76 ms.
[2023-03-10 16:11:15] [INFO ] Added : 270 causal constraints over 54 iterations in 4721 ms. Result :unknown
[2023-03-10 16:11:15] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:16] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-03-10 16:11:16] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 75 ms.
[2023-03-10 16:11:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:11:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-10 16:11:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:16] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2023-03-10 16:11:16] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 77 ms.
[2023-03-10 16:11:21] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2023-03-10 16:11:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-10 16:11:21] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:11:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:21] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2023-03-10 16:11:21] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 89 ms.
[2023-03-10 16:11:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:11:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:22] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2023-03-10 16:11:22] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 100 ms.
[2023-03-10 16:11:27] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 3 ms to minimize.
[2023-03-10 16:11:27] [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 9
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-10 16:11:27] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-10 16:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:27] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-10 16:11:27] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 67 ms.
[2023-03-10 16:11:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:11:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-10 16:11:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:27] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2023-03-10 16:11:27] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 62 ms.
[2023-03-10 16:11:32] [INFO ] Added : 289 causal constraints over 58 iterations in 4742 ms. Result :unknown
[2023-03-10 16:11:32] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:32] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2023-03-10 16:11:32] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 78 ms.
[2023-03-10 16:11:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:11:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:11:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:33] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-03-10 16:11:33] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 82 ms.
[2023-03-10 16:11:38] [INFO ] Added : 250 causal constraints over 50 iterations in 4704 ms. Result :unknown
[2023-03-10 16:11:38] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-10 16:11:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:38] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2023-03-10 16:11:38] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 50 ms.
[2023-03-10 16:11:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 16:11:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-10 16:11:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 16:11:38] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-10 16:11:38] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 58 ms.
[2023-03-10 16:11:43] [INFO ] Deduced a trap composed of 100 places in 145 ms of which 3 ms to minimize.
[2023-03-10 16:11:43] [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 12
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) : [200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200] Max seen :[1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 197, 6, 1]
FORMULA Diffusion2D-PT-D10N200-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 684/684 transitions.
Graph (trivial) has 550 edges and 100 vertex of which 89 / 100 are part of one of the 1 SCC in 10 ms
Free SCC test removed 88 places
Drop transitions removed 550 transitions
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 656 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 12 transition count 20
Applied a total of 9 rules in 25 ms. Remains 12 /100 variables (removed 88) and now considering 20/684 (removed 664) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/100 places, 20/684 transitions.
// Phase 1: matrix 20 rows 12 cols
[2023-03-10 16:11:48] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000138 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=5650 ) properties (out of 11) seen :2200
FORMULA Diffusion2D-PT-D10N200-UpperBounds-15 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-14 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-11 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-10 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 79456 ms.

BK_STOP 1678464709201

--------------------
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="Diffusion2D-PT-D10N200"
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 Diffusion2D-PT-D10N200, 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 r159-smll-167819445100019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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