About the Execution of ITS-Tools for Diffusion2D-PT-D10N200
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772400741.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r060-tall-165254772400741
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 8.4K Apr 30 05:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 30 05:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 05:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 05:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 255K May 10 09:33 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 1652645739928
Running Version 202205111006
[2022-05-15 20:15:40] [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]
[2022-05-15 20:15:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:15:41] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2022-05-15 20:15:41] [INFO ] Transformed 100 places.
[2022-05-15 20:15:41] [INFO ] Transformed 684 transitions.
[2022-05-15 20:15:41] [INFO ] Parsed PT model containing 100 places and 684 transitions in 198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 684 rows 100 cols
[2022-05-15 20:15:41] [INFO ] Computed 1 place invariants in 21 ms
Incomplete random walk after 10054 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1675 ) properties (out of 16) seen :1000
FORMULA Diffusion2D-PT-D10N200-UpperBounds-15 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-09 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-01 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) 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 11) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 11) seen :197
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :9
// Phase 1: matrix 684 rows 100 cols
[2022-05-15 20:15:41] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-15 20:15:41] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-15 20:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:41] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2022-05-15 20:15:41] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 52 ms.
[2022-05-15 20:15:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 20:15:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:41] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-15 20:15:42] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 51 ms.
[2022-05-15 20:15:46] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 4 ms to minimize.
[2022-05-15 20:15:46] [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)
[2022-05-15 20:15:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-05-15 20:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:47] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-15 20:15:47] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-15 20:15:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 20:15:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:47] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2022-05-15 20:15:47] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 51 ms.
[2022-05-15 20:15:52] [INFO ] Added : 419 causal constraints over 84 iterations in 4890 ms. Result :unknown
[2022-05-15 20:15:52] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 20:15:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:52] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2022-05-15 20:15:52] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 36 ms.
[2022-05-15 20:15:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 20:15:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:52] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-15 20:15:52] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 35 ms.
[2022-05-15 20:15:57] [INFO ] Added : 410 causal constraints over 82 iterations in 4882 ms. Result :unknown
[2022-05-15 20:15:57] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 20:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:57] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2022-05-15 20:15:57] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-15 20:15:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 20:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:57] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2022-05-15 20:15:57] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-15 20:16:02] [INFO ] Added : 400 causal constraints over 80 iterations in 4889 ms. Result :unknown
[2022-05-15 20:16:02] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 20:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:02] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2022-05-15 20:16:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:16:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 20:16:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:02] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2022-05-15 20:16:02] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 33 ms.
[2022-05-15 20:16:07] [INFO ] Added : 410 causal constraints over 82 iterations in 4892 ms. Result :unknown
[2022-05-15 20:16:07] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 20:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:07] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2022-05-15 20:16:08] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 31 ms.
[2022-05-15 20:16:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:16:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 20:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:08] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2022-05-15 20:16:08] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 44 ms.
[2022-05-15 20:16:13] [INFO ] Added : 385 causal constraints over 77 iterations in 4886 ms. Result :unknown
[2022-05-15 20:16:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 20:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:13] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-05-15 20:16:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:16:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 20:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:13] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-15 20:16:13] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 37 ms.
[2022-05-15 20:16:18] [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: Broken pipe ... 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: Broken pipe ...
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)
[2022-05-15 20:16:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 20:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:18] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2022-05-15 20:16:18] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 38 ms.
[2022-05-15 20:16:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:16:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 20:16:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:18] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2022-05-15 20:16:18] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 31 ms.
[2022-05-15 20:16:23] [INFO ] Deduced a trap composed of 100 places in 60 ms of which 1 ms to minimize.
[2022-05-15 20:16: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 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2022-05-15 20:16:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 20:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:23] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2022-05-15 20:16:23] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 35 ms.
[2022-05-15 20:16:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:16:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 20:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:23] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-05-15 20:16:23] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-15 20:16:28] [INFO ] Added : 400 causal constraints over 80 iterations in 4898 ms. Result :unknown
[2022-05-15 20:16:28] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 20:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:28] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2022-05-15 20:16:28] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 29 ms.
[2022-05-15 20:16:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:16:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 20:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:29] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-15 20:16:29] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 33 ms.
[2022-05-15 20:16:34] [INFO ] Added : 400 causal constraints over 80 iterations in 4895 ms. Result :unknown
[2022-05-15 20:16:34] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 20:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:34] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2022-05-15 20:16:34] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 34 ms.
[2022-05-15 20:16:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:16:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-15 20:16:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:34] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2022-05-15 20:16:34] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-15 20:16:39] [INFO ] Added : 410 causal constraints over 82 iterations in 4900 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200] Max seen :[1, 1, 1, 11, 0, 7, 0, 2, 197, 1, 3]
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 554 edges and 100 vertex of which 89 / 100 are part of one of the 1 SCC in 3 ms
Free SCC test removed 88 places
Drop transitions removed 554 transitions
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 660 transitions.
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 12 transition count 21
Applied a total of 4 rules in 12 ms. Remains 12 /100 variables (removed 88) and now considering 21/684 (removed 663) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/100 places, 21/684 transitions.
// Phase 1: matrix 21 rows 12 cols
[2022-05-15 20:16:42] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000111 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=10527 ) properties (out of 11) seen :2200
FORMULA Diffusion2D-PT-D10N200-UpperBounds-14 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-13 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-05 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-02 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 61310 ms.
BK_STOP 1652645802330
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="itstools"
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-4028"
echo " Executing tool itstools"
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 r060-tall-165254772400741"
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 '
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 ;