fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of 2022-gold for SharedMemory-PT-000200

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8747.955 3600000.00 3770507.00 13193.10 200 ? 200 200 200 200 ? 200 1 1 1 1 1 1 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/mcc2023-input.r383-smll-167891833400088.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is SharedMemory-PT-000200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r383-smll-167891833400088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 527M
-rw-r--r-- 1 mcc users 9.3M Feb 26 21:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 35M Feb 26 21:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27M Feb 26 07:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 102M Feb 26 07:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 2.6M Feb 25 16:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 6.4M Feb 25 16:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0M Feb 25 16:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 22M Feb 25 16:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 28M Feb 27 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97M Feb 27 17:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 33M Feb 27 12:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115M Feb 27 12:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7M Feb 25 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.3M Feb 25 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 42M Mar 5 18:23 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 SharedMemory-PT-000200-UpperBounds-00
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-01
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-02
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-03
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-04
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-05
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-06
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-07
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-08
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-09
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-10
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-11
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-12
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-13
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-14
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679172087614

Running Version 202205111006
[2023-03-18 20:41:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:41:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:41:33] [INFO ] Load time of PNML (sax parser for PT used): 2536 ms
[2023-03-18 20:41:33] [INFO ] Transformed 40601 places.
[2023-03-18 20:41:33] [INFO ] Transformed 80200 transitions.
[2023-03-18 20:41:33] [INFO ] Parsed PT model containing 40601 places and 80200 transitions in 3113 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12542 ms.
// Phase 1: matrix 80200 rows 40601 cols
[2023-03-18 20:42:43] [INFO ] Computed 401 place invariants in 56326 ms
FORMULA SharedMemory-PT-000200-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000200-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000200-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000200-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000200-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000200-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000200-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 874 steps, including 0 resets, run timeout after 30092 ms. (steps per millisecond=0 ) properties seen 111
FORMULA SharedMemory-PT-000200-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 5) seen :18
Interrupted Best-First random walk after 4779 steps, including 1 resets, run timeout after 5124 ms. (steps per millisecond=0 ) properties seen 12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 5) seen :18
Interrupted Best-First random walk after 4975 steps, including 1 resets, run timeout after 5145 ms. (steps per millisecond=0 ) properties seen 8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 5) seen :8
// Phase 1: matrix 80200 rows 40601 cols
[2023-03-18 20:44:25] [INFO ] Computed 401 place invariants in 60937 ms
[2023-03-18 20:44:30] [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 0
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.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:44:35] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:44:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:44:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:44:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [200, 39800, 200, 39800, 1] Max seen :[54, 1, 54, 1, 0]
Support contains 40000 out of 40601 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40601/40601 places, 80200/80200 transitions.
Free-agglomeration rule applied 200 times.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 40601 transition count 80000
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 400 place count 40401 transition count 80000
Applied a total of 400 rules in 9241 ms. Remains 40401 /40601 variables (removed 200) and now considering 80000/80200 (removed 200) transitions.
Finished structural reductions, in 1 iterations. Remains : 40401/40601 places, 80000/80200 transitions.
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 20:46:00] [INFO ] Computed 401 place invariants in 60119 ms
Interrupted random walk after 9167 steps, including 0 resets, run timeout after 30055 ms. (steps per millisecond=0 ) properties seen 242
Interrupted Best-First random walk after 321437 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=64 ) properties seen 16
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 6052 ms. (steps per millisecond=0 ) properties seen 2
Interrupted Best-First random walk after 319437 steps, including 0 resets, run timeout after 5021 ms. (steps per millisecond=63 ) properties seen 16
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5839 ms. (steps per millisecond=0 ) properties seen 2
Finished Best-First random walk after 223538 steps, including 0 resets, run visited all 5 properties in 5004 ms. (steps per millisecond=44 )
FORMULA SharedMemory-PT-000200-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 20:47:57] [INFO ] Computed 401 place invariants in 60150 ms
Current structural bounds on expressions (after SMT) : [200, 39800, 200, 39800] Max seen :[120, 1, 120, 1]
Support contains 40000 out of 40401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40401/40401 places, 80000/80000 transitions.
Applied a total of 0 rules in 1747 ms. Remains 40401 /40401 variables (removed 0) and now considering 80000/80000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40401/40401 places, 80000/80000 transitions.
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 20:49:35] [INFO ] Computed 401 place invariants in 60642 ms
Finished random walk after 10454 steps, including 0 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 324437 steps, including 0 resets, run timeout after 5017 ms. (steps per millisecond=64 ) properties seen 16
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5845 ms. (steps per millisecond=0 ) properties seen 2
Interrupted Best-First random walk after 319437 steps, including 0 resets, run timeout after 5012 ms. (steps per millisecond=63 ) properties seen 16
Interrupted Best-First random walk after 5001 steps, including 0 resets, run timeout after 5847 ms. (steps per millisecond=0 ) properties seen 2
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 20:51:28] [INFO ] Computed 401 place invariants in 61320 ms
Current structural bounds on expressions (after SMT) : [200, 39800, 200, 39800] Max seen :[120, 1, 120, 1]
Support contains 40000 out of 40401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40401/40401 places, 80000/80000 transitions.
Applied a total of 0 rules in 1667 ms. Remains 40401 /40401 variables (removed 0) and now considering 80000/80000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40401/40401 places, 80000/80000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 40401/40401 places, 80000/80000 transitions.
Applied a total of 0 rules in 1651 ms. Remains 40401 /40401 variables (removed 0) and now considering 80000/80000 (removed 0) transitions.
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 20:53:08] [INFO ] Computed 401 place invariants in 60590 ms
[2023-03-18 20:53:13] [INFO ] Implicit Places using invariants in 66423 ms returned []
Implicit Place search using SMT only with invariants took 66439 ms to find 0 implicit places.
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 20:54:14] [INFO ] Computed 401 place invariants in 60214 ms
[2023-03-18 20:54:19] [INFO ] Dead Transitions using invariants and state equation in 65514 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40401/40401 places, 80000/80000 transitions.
Starting property specific reduction for SharedMemory-PT-000200-UpperBounds-00
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 20:55:20] [INFO ] Computed 401 place invariants in 60682 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9759 ms. (steps per millisecond=1 ) properties (out of 1) seen :121
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 20:56:30] [INFO ] Computed 401 place invariants in 60192 ms
[2023-03-18 20:56:35] [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 0
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.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [200] Max seen :[121]
Support contains 200 out of 40401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40401/40401 places, 80000/80000 transitions.
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition End_Ext_Acc_2_1 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 39799 transitions
Trivial Post-agglo rules discarded 39799 transitions
Performed 39799 trivial Post agglomeration. Transition count delta: 39799
Iterating post reduction 0 with 39801 rules applied. Total rules applied 39801 place count 40400 transition count 40199
Reduce places removed 40000 places and 0 transitions.
Drop transitions removed 39799 transitions
Reduce isomorphic transitions removed 39799 transitions.
Iterating post reduction 1 with 79799 rules applied. Total rules applied 119600 place count 400 transition count 400
Applied a total of 119600 rules in 5593 ms. Remains 400 /40401 variables (removed 40001) and now considering 400/80000 (removed 79600) transitions.
Finished structural reductions, in 1 iterations. Remains : 400/40401 places, 400/80000 transitions.
// Phase 1: matrix 400 rows 400 cols
[2023-03-18 20:56:41] [INFO ] Computed 200 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 29703 ms. (steps per millisecond=33 ) properties (out of 1) seen :131
Finished Best-First random walk after 372052 steps, including 1 resets, run visited all 1 properties in 5003 ms. (steps per millisecond=74 )
FORMULA SharedMemory-PT-000200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Ending property specific reduction for SharedMemory-PT-000200-UpperBounds-00 in 176272 ms.
Starting property specific reduction for SharedMemory-PT-000200-UpperBounds-01
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 20:58:16] [INFO ] Computed 401 place invariants in 60951 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23839 ms. (steps per millisecond=0 ) properties (out of 1) seen :1
Finished Best-First random walk after 5001 steps, including 0 resets, run visited all 1 properties in 5753 ms. (steps per millisecond=0 )
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 20:59:46] [INFO ] Computed 401 place invariants in 59744 ms
[2023-03-18 20:59:51] [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 0
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.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [39800] Max seen :[1]
Support contains 39800 out of 40401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40401/40401 places, 80000/80000 transitions.
Free-agglomeration rule applied 200 times.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 40401 transition count 79800
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 600 place count 40201 transition count 79600
Applied a total of 600 rules in 5224 ms. Remains 40201 /40401 variables (removed 200) and now considering 79600/80000 (removed 400) transitions.
Finished structural reductions, in 1 iterations. Remains : 40201/40401 places, 79600/80000 transitions.
// Phase 1: matrix 79600 rows 40201 cols
[2023-03-18 21:00:57] [INFO ] Computed 401 place invariants in 60506 ms
Finished random walk after 103 steps, including 0 resets, run visited all 1 properties in 30155 ms. (steps per millisecond=0 )
Finished Best-First random walk after 6001 steps, including 0 resets, run visited all 1 properties in 5881 ms. (steps per millisecond=1 )
// Phase 1: matrix 79600 rows 40201 cols
[2023-03-18 21:02:33] [INFO ] Computed 401 place invariants in 60218 ms
Current structural bounds on expressions (after SMT) : [39800] Max seen :[1]
Support contains 39800 out of 40201 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40201/40201 places, 79600/79600 transitions.
Applied a total of 0 rules in 1949 ms. Remains 40201 /40201 variables (removed 0) and now considering 79600/79600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40201/40201 places, 79600/79600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 40201/40201 places, 79600/79600 transitions.
Applied a total of 0 rules in 1870 ms. Remains 40201 /40201 variables (removed 0) and now considering 79600/79600 (removed 0) transitions.
// Phase 1: matrix 79600 rows 40201 cols
[2023-03-18 21:03:47] [INFO ] Computed 401 place invariants in 60673 ms
[2023-03-18 21:03:52] [INFO ] Implicit Places using invariants in 66060 ms returned []
Implicit Place search using SMT only with invariants took 66062 ms to find 0 implicit places.
// Phase 1: matrix 79600 rows 40201 cols
[2023-03-18 21:04:52] [INFO ] Computed 401 place invariants in 59566 ms
[2023-03-18 21:04:57] [INFO ] Dead Transitions using invariants and state equation in 65296 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40201/40201 places, 79600/79600 transitions.
Ending property specific reduction for SharedMemory-PT-000200-UpperBounds-01 in 461978 ms.
Starting property specific reduction for SharedMemory-PT-000200-UpperBounds-03
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 21:05:57] [INFO ] Computed 401 place invariants in 59842 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11905 ms. (steps per millisecond=0 ) properties (out of 1) seen :122
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 21:07:09] [INFO ] Computed 401 place invariants in 59662 ms
Current structural bounds on expressions (after SMT) : [200] Max seen :[122]
Support contains 200 out of 40401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40401/40401 places, 80000/80000 transitions.
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition End_Ext_Acc_2_1 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 39799 transitions
Trivial Post-agglo rules discarded 39799 transitions
Performed 39799 trivial Post agglomeration. Transition count delta: 39799
Iterating post reduction 0 with 39801 rules applied. Total rules applied 39801 place count 40400 transition count 40199
Reduce places removed 40000 places and 0 transitions.
Drop transitions removed 39799 transitions
Reduce isomorphic transitions removed 39799 transitions.
Iterating post reduction 1 with 79799 rules applied. Total rules applied 119600 place count 400 transition count 400
Applied a total of 119600 rules in 4991 ms. Remains 400 /40401 variables (removed 40001) and now considering 400/80000 (removed 79600) transitions.
Finished structural reductions, in 1 iterations. Remains : 400/40401 places, 400/80000 transitions.
// Phase 1: matrix 400 rows 400 cols
[2023-03-18 21:07:19] [INFO ] Computed 200 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 29252 ms. (steps per millisecond=34 ) properties (out of 1) seen :131
Finished Best-First random walk after 400996 steps, including 1 resets, run visited all 1 properties in 5003 ms. (steps per millisecond=80 )
FORMULA SharedMemory-PT-000200-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Ending property specific reduction for SharedMemory-PT-000200-UpperBounds-03 in 175970 ms.
Starting property specific reduction for SharedMemory-PT-000200-UpperBounds-06
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 21:08:53] [INFO ] Computed 401 place invariants in 59779 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20991 ms. (steps per millisecond=0 ) properties (out of 1) seen :1
Finished Best-First random walk after 6001 steps, including 0 resets, run visited all 1 properties in 5706 ms. (steps per millisecond=1 )
// Phase 1: matrix 80000 rows 40401 cols
[2023-03-18 21:10:20] [INFO ] Computed 401 place invariants in 59970 ms
[2023-03-18 21:10: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 0
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.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [39800] Max seen :[1]
Support contains 39800 out of 40401 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40401/40401 places, 80000/80000 transitions.
Free-agglomeration rule applied 200 times.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 40401 transition count 79800
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 600 place count 40201 transition count 79600
Applied a total of 600 rules in 4790 ms. Remains 40201 /40401 variables (removed 200) and now considering 79600/80000 (removed 400) transitions.
Finished structural reductions, in 1 iterations. Remains : 40201/40401 places, 79600/80000 transitions.
// Phase 1: matrix 79600 rows 40201 cols
[2023-03-18 21:11:29] [INFO ] Computed 401 place invariants in 59583 ms
Finished random walk after 103 steps, including 0 resets, run visited all 1 properties in 30110 ms. (steps per millisecond=0 )
Finished Best-First random walk after 6001 steps, including 0 resets, run visited all 1 properties in 5586 ms. (steps per millisecond=1 )
// Phase 1: matrix 79600 rows 40201 cols
[2023-03-18 21:13:05] [INFO ] Computed 401 place invariants in 59738 ms
Current structural bounds on expressions (after SMT) : [39800] Max seen :[1]
Support contains 39800 out of 40201 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40201/40201 places, 79600/79600 transitions.
Applied a total of 0 rules in 1931 ms. Remains 40201 /40201 variables (removed 0) and now considering 79600/79600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40201/40201 places, 79600/79600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 40201/40201 places, 79600/79600 transitions.
Applied a total of 0 rules in 1886 ms. Remains 40201 /40201 variables (removed 0) and now considering 79600/79600 (removed 0) transitions.
// Phase 1: matrix 79600 rows 40201 cols
[2023-03-18 21:14:19] [INFO ] Computed 401 place invariants in 60967 ms
[2023-03-18 21:14:25] [INFO ] Implicit Places using invariants in 66406 ms returned []
Implicit Place search using SMT only with invariants took 66408 ms to find 0 implicit places.
// Phase 1: matrix 79600 rows 40201 cols
[2023-03-18 21:15:25] [INFO ] Computed 401 place invariants in 60812 ms
[2023-03-18 21:15:31] [INFO ] Dead Transitions using invariants and state equation in 66528 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40201/40201 places, 79600/79600 transitions.
Ending property specific reduction for SharedMemory-PT-000200-UpperBounds-06 in 457883 ms.
[2023-03-18 21:15:36] [INFO ] Flatten gal took : 3871 ms
[2023-03-18 21:15:40] [INFO ] Applying decomposition
[2023-03-18 21:15:43] [INFO ] Flatten gal took : 3126 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11327709105111966900.txt' '-o' '/tmp/graph11327709105111966900.bin' '-w' '/tmp/graph11327709105111966900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11327709105111966900.bin' '-l' '-1' '-v' '-w' '/tmp/graph11327709105111966900.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:15:53] [INFO ] Decomposing Gal with order
[2023-03-18 21:16:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:17:09] [INFO ] Removed a total of 158000 redundant transitions.
[2023-03-18 21:17:14] [INFO ] Flatten gal took : 35028 ms
[2023-03-18 21:17:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 5156 labels/synchronizations in 11681 ms.
[2023-03-18 21:18:33] [INFO ] Time to serialize gal into /tmp/UpperBounds12659506939687489835.gal : 1113 ms
[2023-03-18 21:18:33] [INFO ] Time to serialize properties into /tmp/UpperBounds6455409645136787433.prop : 91 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12659506939687489835.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6455409645136787433.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds6455409645136787433.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SharedMemory-PT-000200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is SharedMemory-PT-000200, 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 r383-smll-167891833400088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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