About the Execution of Marcie+red 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/mcc2023-input.r138-smll-167819419700149.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 marciexred
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 r138-smll-167819419700149
=====================================================================
--------------------
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 1678588435079
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D10N200
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 02:33:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 02:33:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 02:33:58] [INFO ] Load time of PNML (sax parser for PT used): 293 ms
[2023-03-12 02:33:58] [INFO ] Transformed 100 places.
[2023-03-12 02:33:58] [INFO ] Transformed 684 transitions.
[2023-03-12 02:33:58] [INFO ] Parsed PT model containing 100 places and 684 transitions and 1368 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 684 rows 100 cols
[2023-03-12 02:33:58] [INFO ] Computed 1 place invariants in 41 ms
Incomplete random walk after 10054 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=837 ) properties (out of 16) seen :600
FORMULA Diffusion2D-PT-D10N200-UpperBounds-12 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :6
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 :4
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 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 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :10
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 :5
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 :5
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 :5
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 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :7
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 :5
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
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
[2023-03-12 02:33:58] [INFO ] Invariant cache hit.
[2023-03-12 02:33:59] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-12 02:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 02:33:59] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-12 02:33:59] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 117 ms.
[2023-03-12 02:34:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 02:34:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 02:34:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:00] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2023-03-12 02:34:00] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 106 ms.
[2023-03-12 02:34:05] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 6 ms to minimize.
[2023-03-12 02:34:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 02:34:05] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 02:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:05] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2023-03-12 02:34:05] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 98 ms.
[2023-03-12 02:34:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 02:34:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 02:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:06] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-12 02:34:06] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 81 ms.
[2023-03-12 02:34:10] [INFO ] Added : 325 causal constraints over 65 iterations in 4749 ms. Result :unknown
[2023-03-12 02:34:10] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 02:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:11] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-03-12 02:34:11] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 80 ms.
[2023-03-12 02:34:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 02:34:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 02:34:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:11] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2023-03-12 02:34:11] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 59 ms.
[2023-03-12 02:34:16] [INFO ] Added : 300 causal constraints over 60 iterations in 4748 ms. Result :unknown
[2023-03-12 02:34:16] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 02:34:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:16] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2023-03-12 02:34:16] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 75 ms.
[2023-03-12 02:34:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 02:34:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 02:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:17] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2023-03-12 02:34:17] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 59 ms.
[2023-03-12 02:34:21] [INFO ] Added : 315 causal constraints over 63 iterations in 4752 ms. Result :unknown
[2023-03-12 02:34:21] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 02:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:22] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2023-03-12 02:34:22] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 59 ms.
[2023-03-12 02:34:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 02:34:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 02:34:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:22] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2023-03-12 02:34:22] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 56 ms.
[2023-03-12 02:34:27] [INFO ] Added : 320 causal constraints over 64 iterations in 4769 ms. Result :unknown
[2023-03-12 02:34:27] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 02:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:27] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2023-03-12 02:34:27] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 54 ms.
[2023-03-12 02:34:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 02:34:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 02:34:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:27] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2023-03-12 02:34:27] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 45 ms.
[2023-03-12 02:34:32] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 2 ms to minimize.
[2023-03-12 02:34:32] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 02:34:32] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 02:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:33] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2023-03-12 02:34:33] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-12 02:34:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 02:34:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 02:34:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:33] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2023-03-12 02:34:33] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-12 02:34:38] [INFO ] Added : 295 causal constraints over 59 iterations in 4724 ms. Result :unknown
[2023-03-12 02:34:38] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 02:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:38] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-12 02:34:38] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 47 ms.
[2023-03-12 02:34:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 02:34:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 02:34:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:38] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2023-03-12 02:34:38] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 46 ms.
[2023-03-12 02:34:43] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 2 ms to minimize.
[2023-03-12 02:34: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 02:34:43] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 02:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:43] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2023-03-12 02:34:44] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 59 ms.
[2023-03-12 02:34:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 02:34:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 02:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:44] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2023-03-12 02:34:44] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 39 ms.
[2023-03-12 02:34:49] [INFO ] Added : 310 causal constraints over 62 iterations in 4836 ms. Result :unknown
[2023-03-12 02:34:49] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 02:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:49] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2023-03-12 02:34:49] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 56 ms.
[2023-03-12 02:34:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 02:34:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 02:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:49] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-12 02:34:49] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 44 ms.
[2023-03-12 02:34:54] [INFO ] Added : 320 causal constraints over 64 iterations in 4834 ms. Result :unknown
[2023-03-12 02:34:54] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 02:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:54] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-12 02:34:54] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 55 ms.
[2023-03-12 02:34:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 02:34:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 02:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 02:34:55] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2023-03-12 02:34:55] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 57 ms.
[2023-03-12 02:35:00] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 3 ms to minimize.
[2023-03-12 02:35:00] [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 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 02:35:00] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 02:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 02:35:00] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-03-12 02:35:00] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 60 ms.
[2023-03-12 02:35:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 02:35:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 02:35:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 02:35:00] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2023-03-12 02:35:00] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 65 ms.
[2023-03-12 02:35:05] [INFO ] Added : 320 causal constraints over 64 iterations in 4791 ms. Result :unknown
[2023-03-12 02:35:05] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 02:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 02:35:05] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-12 02:35:05] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 45 ms.
[2023-03-12 02:35:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 02:35:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 02:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 02:35:06] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2023-03-12 02:35:06] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 54 ms.
[2023-03-12 02:35:10] [INFO ] Added : 290 causal constraints over 58 iterations in 4772 ms. Result :unknown
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, 1, 4, 1, 1, 1, 1, 1, 3, 5, 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 REACHABILITY mode, iteration 0 : 100/100 places, 684/684 transitions.
Graph (trivial) has 558 edges and 100 vertex of which 89 / 100 are part of one of the 1 SCC in 5 ms
Free SCC test removed 88 places
Drop transitions removed 558 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 654 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 22
Applied a total of 9 rules in 34 ms. Remains 12 /100 variables (removed 88) and now considering 22/684 (removed 662) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 12/100 places, 22/684 transitions.
// Phase 1: matrix 22 rows 12 cols
[2023-03-12 02:35:15] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000054 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=8475 ) 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-13 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-11 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-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-00 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 77164 ms.
ITS solved all properties within timeout
BK_STOP 1678588516485
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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="marciexred"
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 marciexred"
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 r138-smll-167819419700149"
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 ;