fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r323-tall-165472292900280
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for RingSingleMessageInMbox-PT-d1m005

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7069.756 58776.00 87962.00 329.20 0 0 1 0 0 0 0 0 3 0 1 0 0 0 1 1 normal

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.r323-tall-165472292900280.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 gold2021
Input is RingSingleMessageInMbox-PT-d1m005, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292900280
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 6.4K Jun 7 17:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 7 17:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 6 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 7 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 6 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 5.8M Jun 6 12:11 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 RingSingleMessageInMbox-PT-d1m005-UpperBounds-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m005-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654787322924

Running Version 0
[2022-06-09 15:08:44] [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-06-09 15:08:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 15:08:45] [INFO ] Load time of PNML (sax parser for PT used): 531 ms
[2022-06-09 15:08:45] [INFO ] Transformed 6690 places.
[2022-06-09 15:08:45] [INFO ] Transformed 11934 transitions.
[2022-06-09 15:08:45] [INFO ] Parsed PT model containing 6690 places and 11934 transitions in 637 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 4305 places in 26 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 11934 rows 2385 cols
[2022-06-09 15:08:46] [INFO ] Computed 5 place invariants in 1027 ms
Incomplete random walk after 10000 steps, including 1547 resets, run finished after 811 ms. (steps per millisecond=12 ) properties (out of 5) seen :2
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
// Phase 1: matrix 11934 rows 2385 cols
[2022-06-09 15:08:48] [INFO ] Computed 5 place invariants in 784 ms
[2022-06-09 15:08:48] [INFO ] [Real]Absence check using 2 positive place invariants in 40 ms returned sat
[2022-06-09 15:08:48] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 45 ms returned sat
[2022-06-09 15:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:08:51] [INFO ] [Real]Absence check using state equation in 2896 ms returned sat
[2022-06-09 15:08:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:08:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 46 ms returned sat
[2022-06-09 15:08:52] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 36 ms returned sat
[2022-06-09 15:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:08:55] [INFO ] [Nat]Absence check using state equation in 3480 ms returned sat
[2022-06-09 15:08:59] [INFO ] State equation strengthened by 9690 read => feed constraints.
[2022-06-09 15:08:59] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:580)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 15:08:59] [INFO ] [Real]Absence check using 2 positive place invariants in 37 ms returned sat
[2022-06-09 15:08:59] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 45 ms returned sat
[2022-06-09 15:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:03] [INFO ] [Real]Absence check using state equation in 3817 ms returned sat
[2022-06-09 15:09:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:09:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 43 ms returned sat
[2022-06-09 15:09:04] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 33 ms returned sat
[2022-06-09 15:09:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:07] [INFO ] [Nat]Absence check using state equation in 3606 ms returned sat
[2022-06-09 15:09:08] [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 1
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:580)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 15:09:09] [INFO ] [Real]Absence check using 2 positive place invariants in 30 ms returned sat
[2022-06-09 15:09:09] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 37 ms returned sat
[2022-06-09 15:09:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:11] [INFO ] [Real]Absence check using state equation in 2526 ms returned sat
[2022-06-09 15:09:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:09:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 34 ms returned sat
[2022-06-09 15:09:12] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 34 ms returned sat
[2022-06-09 15:09:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:14] [INFO ] [Nat]Absence check using state equation in 2811 ms returned sat
[2022-06-09 15:09:16] [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 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:580)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 15:09:17] [INFO ] [Real]Absence check using 2 positive place invariants in 38 ms returned sat
[2022-06-09 15:09:17] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 37 ms returned sat
[2022-06-09 15:09:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:20] [INFO ] [Real]Absence check using state equation in 2980 ms returned sat
[2022-06-09 15:09:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:09:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 38 ms returned sat
[2022-06-09 15:09:20] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 44 ms returned sat
[2022-06-09 15:09:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:23] [INFO ] [Nat]Absence check using state equation in 2256 ms returned sat
[2022-06-09 15:09:25] [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 3
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:580)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 9, 1, 1] Max seen :[0, 1, 0, 0]
Support contains 4 out of 2385 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Graph (complete) has 16557 edges and 2385 vertex of which 2367 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.33 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 9 transitions
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 2367 transition count 11823
Discarding 1104 places :
Symmetric choice reduction at 1 with 1104 rule applications. Total rules 1216 place count 1263 transition count 2415
Iterating global reduction 1 with 1104 rules applied. Total rules applied 2320 place count 1263 transition count 2415
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 2391 place count 1263 transition count 2344
Discarding 941 places :
Symmetric choice reduction at 2 with 941 rule applications. Total rules 3332 place count 322 transition count 1403
Iterating global reduction 2 with 941 rules applied. Total rules applied 4273 place count 322 transition count 1403
Ensure Unique test removed 894 transitions
Reduce isomorphic transitions removed 894 transitions.
Iterating post reduction 2 with 894 rules applied. Total rules applied 5167 place count 322 transition count 509
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 5297 place count 192 transition count 379
Iterating global reduction 3 with 130 rules applied. Total rules applied 5427 place count 192 transition count 379
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 5525 place count 192 transition count 281
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 5535 place count 182 transition count 247
Iterating global reduction 4 with 10 rules applied. Total rules applied 5545 place count 182 transition count 247
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 5546 place count 181 transition count 246
Iterating global reduction 4 with 1 rules applied. Total rules applied 5547 place count 181 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5548 place count 181 transition count 245
Applied a total of 5548 rules in 636 ms. Remains 181 /2385 variables (removed 2204) and now considering 245/11934 (removed 11689) transitions.
Finished structural reductions, in 1 iterations. Remains : 181/2385 places, 245/11934 transitions.
// Phase 1: matrix 245 rows 181 cols
[2022-06-09 15:09:26] [INFO ] Computed 4 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 206474 resets, run finished after 1526 ms. (steps per millisecond=655 ) properties (out of 4) seen :6
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 61755 resets, run finished after 554 ms. (steps per millisecond=1805 ) properties (out of 1) seen :3
// Phase 1: matrix 245 rows 181 cols
[2022-06-09 15:09:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 15:09:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-09 15:09:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:28] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2022-06-09 15:09:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:09:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 14 ms returned sat
[2022-06-09 15:09:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:28] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-06-09 15:09:28] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-09 15:09:28] [INFO ] [Nat]Added 73 Read/Feed constraints in 56 ms returned sat
[2022-06-09 15:09:28] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 6 ms to minimize.
[2022-06-09 15:09:28] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 2 ms to minimize.
[2022-06-09 15:09:28] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 1 ms to minimize.
[2022-06-09 15:09:28] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2022-06-09 15:09:28] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2022-06-09 15:09:29] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2022-06-09 15:09:29] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2022-06-09 15:09:29] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2022-06-09 15:09:29] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2022-06-09 15:09:29] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2022-06-09 15:09:29] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-06-09 15:09:29] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2022-06-09 15:09:29] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1098 ms
[2022-06-09 15:09:29] [INFO ] Computed and/alt/rep : 74/188/74 causal constraints (skipped 170 transitions) in 38 ms.
[2022-06-09 15:09:29] [INFO ] Added : 63 causal constraints over 13 iterations in 302 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : [9] Max seen :[3]
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 181/181 places, 245/245 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 179 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 179 transition count 243
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 177 transition count 241
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 177 transition count 241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 177 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 176 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 176 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 175 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 175 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 171 transition count 221
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 171 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 26 place count 171 transition count 217
Applied a total of 26 rules in 38 ms. Remains 171 /181 variables (removed 10) and now considering 217/245 (removed 28) transitions.
Finished structural reductions, in 1 iterations. Remains : 171/181 places, 217/245 transitions.
// Phase 1: matrix 217 rows 171 cols
[2022-06-09 15:09:30] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 211816 resets, run finished after 1254 ms. (steps per millisecond=797 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 72748 resets, run finished after 506 ms. (steps per millisecond=1976 ) properties (out of 1) seen :3
// Phase 1: matrix 217 rows 171 cols
[2022-06-09 15:09:31] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-09 15:09:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-09 15:09:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:31] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-06-09 15:09:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:09:31] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-09 15:09:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:32] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-06-09 15:09:32] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-09 15:09:32] [INFO ] [Nat]Added 54 Read/Feed constraints in 36 ms returned sat
[2022-06-09 15:09:32] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2022-06-09 15:09:32] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2022-06-09 15:09:32] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2022-06-09 15:09:32] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2022-06-09 15:09:32] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-06-09 15:09:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 358 ms
[2022-06-09 15:09:32] [INFO ] Computed and/alt/rep : 71/182/71 causal constraints (skipped 145 transitions) in 29 ms.
[2022-06-09 15:09:32] [INFO ] Added : 30 causal constraints over 6 iterations in 215 ms. Result :sat
Minimization took 175 ms.
Current structural bounds on expressions (after SMT) : [9] Max seen :[3]
Incomplete Parikh walk after 76700 steps, including 14751 resets, run finished after 159 ms. (steps per millisecond=482 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 217/217 transitions.
Applied a total of 0 rules in 15 ms. Remains 171 /171 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 171/171 places, 217/217 transitions.
Starting structural reductions, iteration 0 : 171/171 places, 217/217 transitions.
Applied a total of 0 rules in 11 ms. Remains 171 /171 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 171 cols
[2022-06-09 15:09:33] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 15:09:33] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 217 rows 171 cols
[2022-06-09 15:09:33] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 15:09:33] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-09 15:09:33] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2022-06-09 15:09:33] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 217 rows 171 cols
[2022-06-09 15:09:33] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 15:09:33] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 171/171 places, 217/217 transitions.
Starting property specific reduction for RingSingleMessageInMbox-PT-d1m005-UpperBounds-08
// Phase 1: matrix 217 rows 171 cols
[2022-06-09 15:09:33] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2073 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 735 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
// Phase 1: matrix 217 rows 171 cols
[2022-06-09 15:09:33] [INFO ] Computed 4 place invariants in 9 ms
[2022-06-09 15:09:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 15:09:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:33] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-06-09 15:09:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:09:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-09 15:09:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:33] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-06-09 15:09:33] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-09 15:09:33] [INFO ] [Nat]Added 54 Read/Feed constraints in 31 ms returned sat
[2022-06-09 15:09:33] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2022-06-09 15:09:33] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2022-06-09 15:09:34] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2022-06-09 15:09:34] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2022-06-09 15:09:34] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2022-06-09 15:09:34] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2022-06-09 15:09:34] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2022-06-09 15:09:34] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2022-06-09 15:09:34] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-06-09 15:09:34] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2022-06-09 15:09:34] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2022-06-09 15:09:34] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2022-06-09 15:09:34] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 890 ms
[2022-06-09 15:09:34] [INFO ] Computed and/alt/rep : 71/182/71 causal constraints (skipped 145 transitions) in 27 ms.
[2022-06-09 15:09:34] [INFO ] Added : 56 causal constraints over 12 iterations in 263 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 56000 steps, including 10986 resets, run finished after 88 ms. (steps per millisecond=636 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 217/217 transitions.
Applied a total of 0 rules in 7 ms. Remains 171 /171 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 171/171 places, 217/217 transitions.
// Phase 1: matrix 217 rows 171 cols
[2022-06-09 15:09:35] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 211967 resets, run finished after 1258 ms. (steps per millisecond=794 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 72934 resets, run finished after 507 ms. (steps per millisecond=1972 ) properties (out of 1) seen :3
// Phase 1: matrix 217 rows 171 cols
[2022-06-09 15:09:37] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 15:09:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-09 15:09:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:37] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-06-09 15:09:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:09:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-09 15:09:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:09:37] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-06-09 15:09:37] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-09 15:09:37] [INFO ] [Nat]Added 54 Read/Feed constraints in 33 ms returned sat
[2022-06-09 15:09:37] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2022-06-09 15:09:37] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2022-06-09 15:09:37] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2022-06-09 15:09:37] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2022-06-09 15:09:37] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2022-06-09 15:09:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 442 ms
[2022-06-09 15:09:37] [INFO ] Computed and/alt/rep : 71/182/71 causal constraints (skipped 145 transitions) in 22 ms.
[2022-06-09 15:09:37] [INFO ] Added : 30 causal constraints over 6 iterations in 206 ms. Result :sat
Minimization took 181 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Incomplete Parikh walk after 76700 steps, including 14648 resets, run finished after 152 ms. (steps per millisecond=504 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 217/217 transitions.
Applied a total of 0 rules in 6 ms. Remains 171 /171 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 171/171 places, 217/217 transitions.
Starting structural reductions, iteration 0 : 171/171 places, 217/217 transitions.
Applied a total of 0 rules in 6 ms. Remains 171 /171 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 171 cols
[2022-06-09 15:09:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 15:09:38] [INFO ] Implicit Places using invariants in 477 ms returned []
// Phase 1: matrix 217 rows 171 cols
[2022-06-09 15:09:38] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 15:09:38] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-06-09 15:09:39] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2022-06-09 15:09:39] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 217 rows 171 cols
[2022-06-09 15:09:39] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 15:09:39] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 1 iterations. Remains : 171/171 places, 217/217 transitions.
Ending property specific reduction for RingSingleMessageInMbox-PT-d1m005-UpperBounds-08 in 5645 ms.
[2022-06-09 15:09:39] [INFO ] Flatten gal took : 55 ms
[2022-06-09 15:09:39] [INFO ] Applying decomposition
[2022-06-09 15:09:39] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16363544494296268228.txt, -o, /tmp/graph16363544494296268228.bin, -w, /tmp/graph16363544494296268228.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16363544494296268228.bin, -l, -1, -v, -w, /tmp/graph16363544494296268228.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 15:09:39] [INFO ] Decomposing Gal with order
[2022-06-09 15:09:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 15:09:39] [INFO ] Removed a total of 237 redundant transitions.
[2022-06-09 15:09:39] [INFO ] Flatten gal took : 56 ms
[2022-06-09 15:09:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 143 labels/synchronizations in 15 ms.
[2022-06-09 15:09:39] [INFO ] Time to serialize gal into /tmp/UpperBounds8221517178939860451.gal : 6 ms
[2022-06-09 15:09:39] [INFO ] Time to serialize properties into /tmp/UpperBounds8762863413594236361.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8221517178939860451.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8762863413594236361.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8221517178939860451.gal -t CGAL -reachable-file /tmp/UpperBounds8762863413594236361.prop --nowitness
Loading property file /tmp/UpperBounds8762863413594236361.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,207560,0.512224,20368,1030,1047,18265,11277,639,57835,229,51709,0
Total reachable state count : 207560

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property RingSingleMessageInMbox-PT-d1m005-UpperBounds-08 :0 <= i11.u23.l5551 <= 3
FORMULA RingSingleMessageInMbox-PT-d1m005-UpperBounds-08 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RingSingleMessageInMbox-PT-d1m005-UpperBounds-08,0,0.568191,20368,1,0,18265,11277,813,57835,269,51709,1349

BK_STOP 1654787381700

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="RingSingleMessageInMbox-PT-d1m005"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is RingSingleMessageInMbox-PT-d1m005, 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 r323-tall-165472292900280"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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