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.r255-tall-167856440400064.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 LeafsetExtension-PT-S32C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440400064
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 8.1K Feb 25 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 16:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.4M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S32C3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678751574427

Running Version 202205111006
[2023-03-13 23:52:55] [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-13 23:52:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:52:56] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2023-03-13 23:52:56] [INFO ] Transformed 5622 places.
[2023-03-13 23:52:56] [INFO ] Transformed 5449 transitions.
[2023-03-13 23:52:56] [INFO ] Parsed PT model containing 5622 places and 5449 transitions in 450 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-13 23:52:56] [INFO ] Computed 173 place invariants in 572 ms
Incomplete random walk after 10000 steps, including 387 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :13
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :2
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-13 23:52:57] [INFO ] Computed 173 place invariants in 199 ms
[2023-03-13 23:52:57] [INFO ] [Real]Absence check using 35 positive place invariants in 73 ms returned sat
[2023-03-13 23:52:58] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 151 ms returned sat
[2023-03-13 23:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:53:01] [INFO ] [Real]Absence check using state equation in 3275 ms returned sat
[2023-03-13 23:53:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:53:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 59 ms returned sat
[2023-03-13 23:53:02] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 127 ms returned sat
[2023-03-13 23:53:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:53:05] [INFO ] [Nat]Absence check using state equation in 3156 ms returned sat
[2023-03-13 23:53:06] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 276 ms.
[2023-03-13 23:53:13] [INFO ] Deduced a trap composed of 2 places in 6815 ms of which 13 ms to minimize.
[2023-03-13 23:53:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 23:53:14] [INFO ] [Real]Absence check using 35 positive place invariants in 62 ms returned sat
[2023-03-13 23:53:14] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 140 ms returned sat
[2023-03-13 23:53:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:53:17] [INFO ] [Real]Absence check using state equation in 3248 ms returned sat
[2023-03-13 23:53:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:53:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 57 ms returned sat
[2023-03-13 23:53:18] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 127 ms returned sat
[2023-03-13 23:53:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:53:21] [INFO ] [Nat]Absence check using state equation in 3381 ms returned sat
[2023-03-13 23:53:22] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 278 ms.
[2023-03-13 23:53:29] [INFO ] Deduced a trap composed of 2 places in 6853 ms of which 16 ms to minimize.
[2023-03-13 23:53:29] [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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 23:53:30] [INFO ] [Real]Absence check using 35 positive place invariants in 54 ms returned sat
[2023-03-13 23:53:30] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 111 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, -1, 1] Max seen :[0, 0, 1]
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 5622 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 90 are kept as prefixes of interest. Removing 5532 places using SCC suffix rule.26 ms
Discarding 5532 places :
Also discarding 4036 output transitions
Drop transitions removed 4036 transitions
Drop transitions removed 1104 transitions
Reduce isomorphic transitions removed 1104 transitions.
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 1135 rules applied. Total rules applied 1136 place count 75 transition count 293
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 34 rules applied. Total rules applied 1170 place count 57 transition count 277
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 1186 place count 41 transition count 277
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1186 place count 41 transition count 275
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1190 place count 39 transition count 275
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1191 place count 39 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1192 place count 38 transition count 274
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 1207 place count 38 transition count 259
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1222 place count 23 transition count 259
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 1237 place count 23 transition count 259
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 1238 place count 22 transition count 259
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1239 place count 22 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1240 place count 21 transition count 258
Applied a total of 1240 rules in 117 ms. Remains 21 /5622 variables (removed 5601) and now considering 258/5449 (removed 5191) transitions.
[2023-03-13 23:53:30] [INFO ] Flow matrix only has 35 transitions (discarded 223 similar events)
// Phase 1: matrix 35 rows 21 cols
[2023-03-13 23:53:30] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-13 23:53:30] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/5622 places, 258/5449 transitions.
Successfully produced net in file /tmp/petri1000_7540199336915076943.dot
Successfully produced net in file /tmp/petri1001_8043107144921864555.dot
Successfully produced net in file /tmp/petri1002_1372664981754685538.dot
Successfully produced net in file /tmp/petri1003_2573960261027625945.dot
Successfully produced net in file /tmp/petri1004_11244897694254658960.dot
Successfully produced net in file /tmp/petri1005_17664601791669688399.dot
Successfully produced net in file /tmp/petri1006_18165299393515662568.dot
Successfully produced net in file /tmp/petri1007_17423347245278266948.dot
Successfully produced net in file /tmp/petri1008_15644159492820015154.dot
Successfully produced net in file /tmp/petri1009_2680124094836988881.dot
Successfully produced net in file /tmp/petri1010_12244237341699000947.dot
Successfully produced net in file /tmp/petri1011_7839662374918246089.dot
Successfully produced net in file /tmp/petri1012_9317504737184638802.dot
Successfully produced net in file /tmp/petri1013_13862503888011940110.dot
Successfully produced net in file /tmp/petri1014_1122257367224712848.dot
Successfully produced net in file /tmp/petri1015_18130783337482302078.dot
Successfully produced net in file /tmp/petri1016_16569014734929703540.dot
Successfully produced net in file /tmp/petri1017_8539909081503215653.dot
Successfully produced net in file /tmp/petri1018_9971678080515879947.dot
Successfully produced net in file /tmp/petri1019_13890809996232599263.dot
Successfully produced net in file /tmp/petri1020_767416129675722882.dot
Successfully produced net in file /tmp/petri1021_2473447041555017658.dot
Successfully produced net in file /tmp/petri1022_9482062649649588944.dot
Successfully produced net in file /tmp/petri1023_16643305542312128343.dot
Successfully produced net in file /tmp/petri1024_9028328960666698547.dot
Successfully produced net in file /tmp/petri1025_6302340531880748075.dot
Successfully produced net in file /tmp/petri1026_2019016059006805620.dot
Successfully produced net in file /tmp/petri1027_3828240679594418189.dot
Successfully produced net in file /tmp/petri1028_16868044970035735063.dot
Successfully produced net in file /tmp/petri1029_311536404530913760.dot
Successfully produced net in file /tmp/petri1030_9018968843563349678.dot
Successfully produced net in file /tmp/petri1031_8008326565755548528.dot
Successfully produced net in file /tmp/petri1032_611395071082311835.dot
Successfully produced net in file /tmp/petri1033_15745999882367223124.dot
Successfully produced net in file /tmp/petri1034_1619110862752234371.dot
Successfully produced net in file /tmp/petri1035_82006328055683136.dot
Successfully produced net in file /tmp/petri1036_10969071748133521493.dot
Successfully produced net in file /tmp/petri1037_6099808407274588343.dot
Successfully produced net in file /tmp/petri1038_18310507582472530461.dot
Successfully produced net in file /tmp/petri1039_18355037893241752273.dot
Successfully produced net in file /tmp/petri1040_11289926322872582786.dot
Successfully produced net in file /tmp/petri1041_15443505148433859093.dot
Successfully produced net in file /tmp/petri1042_11183398363423940985.dot
Successfully produced net in file /tmp/petri1043_11391163364410820090.dot
Successfully produced net in file /tmp/petri1044_11109502306373658790.dot
Successfully produced net in file /tmp/petri1045_4174582666486821904.dot
Successfully produced net in file /tmp/petri1046_6793422031963115877.dot
Successfully produced net in file /tmp/petri1047_1191666424974136340.dot
Successfully produced net in file /tmp/petri1048_16223606172836750595.dot
Successfully produced net in file /tmp/petri1049_11140212902602237547.dot
Successfully produced net in file /tmp/petri1050_14964023119492850732.dot
Successfully produced net in file /tmp/petri1051_15632269268334344865.dot
Successfully produced net in file /tmp/petri1052_13248664898036894105.dot
Successfully produced net in file /tmp/petri1053_135688881472729084.dot
Successfully produced net in file /tmp/petri1054_7331409373044296936.dot
Successfully produced net in file /tmp/petri1055_5218095524165999041.dot
Successfully produced net in file /tmp/petri1056_4742861762715207827.dot
Successfully produced net in file /tmp/petri1057_8285439720304153146.dot
Successfully produced net in file /tmp/petri1058_10962667393334182744.dot
Successfully produced net in file /tmp/petri1059_3060575039078017692.dot
Successfully produced net in file /tmp/petri1060_12807821859078801003.dot
Successfully produced net in file /tmp/petri1061_16720192977244392725.dot
Successfully produced net in file /tmp/petri1062_3335349806650910664.dot
Successfully produced net in file /tmp/petri1063_3600480634592575409.dot
Successfully produced net in file /tmp/petri1064_14383375476894986047.dot
Successfully produced net in file /tmp/petri1065_12285418202539216446.dot
Successfully produced net in file /tmp/petri1066_17085466542248639.dot
Successfully produced net in file /tmp/petri1067_12480152139699716651.dot
Successfully produced net in file /tmp/petri1068_10625666044096916891.dot
Successfully produced net in file /tmp/petri1069_6324699892945053950.dot
Successfully produced net in file /tmp/petri1070_821560992766669423.dot
Successfully produced net in file /tmp/petri1071_6040511736916523145.dot
Successfully produced net in file /tmp/petri1072_7289379309535071608.dot
Successfully produced net in file /tmp/petri1073_13460488240453525878.dot
Successfully produced net in file /tmp/petri1074_13454624023811577456.dot
Successfully produced net in file /tmp/petri1075_3363616906628017801.dot
Successfully produced net in file /tmp/petri1076_16314402825823952943.dot
Successfully produced net in file /tmp/petri1077_12503707475720606009.dot
Successfully produced net in file /tmp/petri1078_1781126915993232047.dot
Successfully produced net in file /tmp/petri1079_4028501290356622495.dot
Successfully produced net in file /tmp/petri1080_14094631681383980872.dot
Successfully produced net in file /tmp/petri1081_7183771829538135405.dot
Successfully produced net in file /tmp/petri1082_8587586715234044959.dot
Successfully produced net in file /tmp/petri1083_10608011024038657414.dot
Successfully produced net in file /tmp/petri1084_7601354617611937800.dot
Successfully produced net in file /tmp/petri1085_6550907170348321427.dot
Successfully produced net in file /tmp/petri1086_8441256190249735485.dot
Successfully produced net in file /tmp/petri1087_12605625542111384398.dot
Successfully produced net in file /tmp/petri1088_9156256039409147963.dot
Successfully produced net in file /tmp/petri1089_11378961844530850095.dot
Successfully produced net in file /tmp/petri1090_11128381202631088445.dot
Successfully produced net in file /tmp/petri1091_13811707271311157353.dot
Successfully produced net in file /tmp/petri1092_18420708974010821093.dot
Successfully produced net in file /tmp/petri1093_3156975283305432249.dot
Successfully produced net in file /tmp/petri1094_14685163985783038087.dot
Successfully produced net in file /tmp/petri1095_15453837213737094369.dot
Successfully produced net in file /tmp/petri1096_13899218560602114507.dot
Successfully produced net in file /tmp/petri1097_6642602634491003645.dot
Successfully produced net in file /tmp/petri1098_18444472946123321552.dot
Successfully produced net in file /tmp/petri1099_1138261491038065544.dot
Successfully produced net in file /tmp/petri1100_1926258275901573698.dot
Successfully produced net in file /tmp/petri1101_6455584475450709301.dot
Successfully produced net in file /tmp/petri1102_11504801247472580818.dot
Successfully produced net in file /tmp/petri1103_13983015990701489106.dot
Successfully produced net in file /tmp/petri1104_17502836229462268082.dot
Successfully produced net in file /tmp/petri1105_10980580093533255066.dot
Successfully produced net in file /tmp/petri1106_15325457241877918890.dot
Successfully produced net in file /tmp/petri1107_4561236246188631252.dot
Successfully produced net in file /tmp/petri1108_9130912232619609614.dot
Successfully produced net in file /tmp/petri1109_8853412898551807078.dot
Successfully produced net in file /tmp/petri1110_4702407881912468431.dot
Successfully produced net in file /tmp/petri1111_4211075271104871621.dot
Successfully produced net in file /tmp/petri1112_6739517298125567191.dot
Successfully produced net in file /tmp/petri1113_11520510053451085349.dot
Successfully produced net in file /tmp/petri1114_10163430536663372128.dot
Successfully produced net in file /tmp/petri1115_7498516558127694528.dot
Successfully produced net in file /tmp/petri1116_13646977114880938911.dot
Successfully produced net in file /tmp/petri1117_7674353055751565928.dot
Successfully produced net in file /tmp/petri1118_13894844304995981851.dot
Successfully produced net in file /tmp/petri1119_13151353101351814148.dot
Drop transitions removed 120 transitions
Dominated transitions for bounds rules discarded 120 transitions
Normalized transition count is 20 out of 138 initially.
// Phase 1: matrix 20 rows 21 cols
[2023-03-13 23:53:30] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 235042 resets, run finished after 1508 ms. (steps per millisecond=663 ) properties (out of 2) seen :2
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 19762 resets, run finished after 353 ms. (steps per millisecond=2832 ) properties (out of 1) seen :1
[2023-03-13 23:53:32] [INFO ] Flow matrix only has 20 transitions (discarded 118 similar events)
// Phase 1: matrix 20 rows 21 cols
[2023-03-13 23:53:32] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:53:32] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 23:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:53:32] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA LeafsetExtension-PT-S32C3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 36956 ms.

BK_STOP 1678751612614

--------------------
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="LeafsetExtension-PT-S32C3"
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 LeafsetExtension-PT-S32C3, 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 r255-tall-167856440400064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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