fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r229-tall-167856413300501
Last Updated
May 14, 2023

About the Execution of ITS-Tools for LeafsetExtension-PT-S32C2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
473.968 28200.00 31021.00 2606.30 1 1 1 1 1 2 1 1 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.r229-tall-167856413300501.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 itstools
Input is LeafsetExtension-PT-S32C2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413300501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 14K Feb 25 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K 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 14K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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-S32C2-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S32C2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679495750257

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C2
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-22 14:35:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 14:35:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:35:51] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2023-03-22 14:35:52] [INFO ] Transformed 5622 places.
[2023-03-22 14:35:52] [INFO ] Transformed 5449 transitions.
[2023-03-22 14:35:52] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-22 14:35:52] [INFO ] Computed 173 place invariants in 314 ms
Incomplete random walk after 10000 steps, including 548 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :14
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :4
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :1
[2023-03-22 14:35:52] [INFO ] Invariant cache hit.
[2023-03-22 14:35:53] [INFO ] [Real]Absence check using 35 positive place invariants in 65 ms returned sat
[2023-03-22 14:35:53] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 126 ms returned unsat
[2023-03-22 14:35:54] [INFO ] [Real]Absence check using 35 positive place invariants in 67 ms returned sat
[2023-03-22 14:35:54] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 124 ms returned unsat
[2023-03-22 14:35:54] [INFO ] [Real]Absence check using 35 positive place invariants in 57 ms returned sat
[2023-03-22 14:35:54] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 147 ms returned unsat
[2023-03-22 14:35:55] [INFO ] [Real]Absence check using 35 positive place invariants in 57 ms returned sat
[2023-03-22 14:35:55] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 152 ms returned sat
[2023-03-22 14:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:35:58] [INFO ] [Real]Absence check using state equation in 3178 ms returned sat
[2023-03-22 14:35:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 14:35:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 59 ms returned sat
[2023-03-22 14:35:59] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 133 ms returned sat
[2023-03-22 14:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 14:36:02] [INFO ] [Nat]Absence check using state equation in 3187 ms returned sat
[2023-03-22 14:36:03] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 271 ms.
[2023-03-22 14:36:10] [INFO ] Deduced a trap composed of 2 places in 6719 ms of which 9 ms to minimize.
[2023-03-22 14:36:10] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 2, 1, 1] Max seen :[1, 2, 1, 0]
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 88 are kept as prefixes of interest. Removing 5534 places using SCC suffix rule.10 ms
Discarding 5534 places :
Also discarding 4037 output transitions
Drop transitions removed 4037 transitions
Drop transitions removed 1105 transitions
Reduce isomorphic transitions removed 1105 transitions.
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 1136 rules applied. Total rules applied 1137 place count 72 transition count 292
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 34 rules applied. Total rules applied 1171 place count 55 transition count 275
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 1188 place count 38 transition count 275
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1188 place count 38 transition count 274
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1190 place count 37 transition count 274
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1191 place count 37 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1192 place count 36 transition count 273
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 1207 place count 36 transition count 258
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1223 place count 36 transition count 242
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1239 place count 20 transition count 242
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 1254 place count 20 transition count 242
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 1255 place count 19 transition count 242
Applied a total of 1255 rules in 81 ms. Remains 19 /5622 variables (removed 5603) and now considering 242/5449 (removed 5207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 19/5622 places, 242/5449 transitions.
Successfully produced net in file /tmp/petri1000_9174811713116134344.dot
Successfully produced net in file /tmp/petri1001_4969938982278427673.dot
Successfully produced net in file /tmp/petri1002_12751824550382879162.dot
Successfully produced net in file /tmp/petri1003_10936983661122141414.dot
Successfully produced net in file /tmp/petri1004_16286230940263195217.dot
Successfully produced net in file /tmp/petri1005_1788314486692397967.dot
Successfully produced net in file /tmp/petri1006_17405852386950455609.dot
Successfully produced net in file /tmp/petri1007_8357896954135070301.dot
Successfully produced net in file /tmp/petri1008_13883793156807658054.dot
Successfully produced net in file /tmp/petri1009_14974049031902247393.dot
Successfully produced net in file /tmp/petri1010_1897747777752188146.dot
Successfully produced net in file /tmp/petri1011_10219070577773699394.dot
Successfully produced net in file /tmp/petri1012_12073192727640355431.dot
Successfully produced net in file /tmp/petri1013_17643329236704364205.dot
Successfully produced net in file /tmp/petri1014_10217876730009816515.dot
Successfully produced net in file /tmp/petri1015_11677253274163860994.dot
Successfully produced net in file /tmp/petri1016_13019570036379590733.dot
Successfully produced net in file /tmp/petri1017_9006373952539349876.dot
Successfully produced net in file /tmp/petri1018_5578769748713023599.dot
Successfully produced net in file /tmp/petri1019_15779042398182763320.dot
Successfully produced net in file /tmp/petri1020_5774112735200565027.dot
Successfully produced net in file /tmp/petri1021_10469397948609557552.dot
Successfully produced net in file /tmp/petri1022_3150058471025541101.dot
Successfully produced net in file /tmp/petri1023_8076281231316291183.dot
Successfully produced net in file /tmp/petri1024_11279327835250649386.dot
Successfully produced net in file /tmp/petri1025_6162616669938505187.dot
Successfully produced net in file /tmp/petri1026_17684324831812595734.dot
Successfully produced net in file /tmp/petri1027_545483255388942401.dot
Successfully produced net in file /tmp/petri1028_3346129742683948870.dot
Successfully produced net in file /tmp/petri1029_4964083462855303408.dot
Successfully produced net in file /tmp/petri1030_10492709543421268692.dot
Successfully produced net in file /tmp/petri1031_10158516924397132402.dot
Successfully produced net in file /tmp/petri1032_4570698940154953585.dot
Successfully produced net in file /tmp/petri1033_13843939211224296684.dot
Successfully produced net in file /tmp/petri1034_9722767968529410552.dot
Successfully produced net in file /tmp/petri1035_2788650570736930086.dot
Successfully produced net in file /tmp/petri1036_6583709869945267120.dot
Successfully produced net in file /tmp/petri1037_16218828248390513004.dot
Successfully produced net in file /tmp/petri1038_12645093205035852469.dot
Successfully produced net in file /tmp/petri1039_12924927923314389692.dot
Successfully produced net in file /tmp/petri1040_17451884833433085271.dot
Successfully produced net in file /tmp/petri1041_6159311819037431823.dot
Successfully produced net in file /tmp/petri1042_184490475454251424.dot
Successfully produced net in file /tmp/petri1043_3595151780614675012.dot
Successfully produced net in file /tmp/petri1044_4002379469756009938.dot
Successfully produced net in file /tmp/petri1045_10754374352320713599.dot
Successfully produced net in file /tmp/petri1046_1510327271549371985.dot
Successfully produced net in file /tmp/petri1047_11863320409650714155.dot
Successfully produced net in file /tmp/petri1048_4908757832929083748.dot
Successfully produced net in file /tmp/petri1049_6519348074182772841.dot
Successfully produced net in file /tmp/petri1050_12375502735151789161.dot
Successfully produced net in file /tmp/petri1051_4692672560415475265.dot
Successfully produced net in file /tmp/petri1052_375100446515773507.dot
Successfully produced net in file /tmp/petri1053_11007054176771105169.dot
Successfully produced net in file /tmp/petri1054_10700070440795764287.dot
Successfully produced net in file /tmp/petri1055_16082577855914674307.dot
Successfully produced net in file /tmp/petri1056_18039648119129129834.dot
Successfully produced net in file /tmp/petri1057_13561288811879242251.dot
Successfully produced net in file /tmp/petri1058_2364014007757309238.dot
Successfully produced net in file /tmp/petri1059_7724184998827634225.dot
Successfully produced net in file /tmp/petri1060_9541656646790776324.dot
Successfully produced net in file /tmp/petri1061_3096652494198200069.dot
Successfully produced net in file /tmp/petri1062_17587967026002583958.dot
Successfully produced net in file /tmp/petri1063_10642495748787479748.dot
Successfully produced net in file /tmp/petri1064_1505620874424930436.dot
Successfully produced net in file /tmp/petri1065_12901232093671881208.dot
Successfully produced net in file /tmp/petri1066_7844924899630686923.dot
Successfully produced net in file /tmp/petri1067_8659984019715085449.dot
Successfully produced net in file /tmp/petri1068_9214994992437169068.dot
Successfully produced net in file /tmp/petri1069_4913849258175882708.dot
Successfully produced net in file /tmp/petri1070_13942509258846394650.dot
Successfully produced net in file /tmp/petri1071_5829440165179321603.dot
Successfully produced net in file /tmp/petri1072_14655394808461080640.dot
Successfully produced net in file /tmp/petri1073_12492514019945338186.dot
Successfully produced net in file /tmp/petri1074_6417385315173340184.dot
Successfully produced net in file /tmp/petri1075_8204130818142327837.dot
Successfully produced net in file /tmp/petri1076_14039894914567393283.dot
Successfully produced net in file /tmp/petri1077_2903344961038624392.dot
Successfully produced net in file /tmp/petri1078_758119654318579310.dot
Successfully produced net in file /tmp/petri1079_10499280717192520877.dot
Successfully produced net in file /tmp/petri1080_13996935192435977423.dot
Successfully produced net in file /tmp/petri1081_16185029207359901739.dot
Successfully produced net in file /tmp/petri1082_16619378562681310675.dot
Successfully produced net in file /tmp/petri1083_16384341558642138156.dot
Successfully produced net in file /tmp/petri1084_17778925764396811717.dot
Successfully produced net in file /tmp/petri1085_5030652916753472206.dot
Successfully produced net in file /tmp/petri1086_16042440442228747623.dot
Successfully produced net in file /tmp/petri1087_5190732940515188309.dot
Successfully produced net in file /tmp/petri1088_9579522173929442781.dot
Successfully produced net in file /tmp/petri1089_8467976308205985701.dot
Successfully produced net in file /tmp/petri1090_7407922038556618023.dot
Successfully produced net in file /tmp/petri1091_16523108351646809387.dot
Successfully produced net in file /tmp/petri1092_134796716011949500.dot
Successfully produced net in file /tmp/petri1093_11719485770540919151.dot
Successfully produced net in file /tmp/petri1094_3492768039820057871.dot
Successfully produced net in file /tmp/petri1095_578627745655849461.dot
Successfully produced net in file /tmp/petri1096_9018671640555321391.dot
Successfully produced net in file /tmp/petri1097_9686260275434165383.dot
Successfully produced net in file /tmp/petri1098_2453159060641842854.dot
Successfully produced net in file /tmp/petri1099_2791718124529887684.dot
Successfully produced net in file /tmp/petri1100_5434258223460643288.dot
Successfully produced net in file /tmp/petri1101_4830677107594279143.dot
Successfully produced net in file /tmp/petri1102_16074349594399545561.dot
Successfully produced net in file /tmp/petri1103_4048385871655581465.dot
Successfully produced net in file /tmp/petri1104_7802726694926705032.dot
Successfully produced net in file /tmp/petri1105_12142096150006463655.dot
Successfully produced net in file /tmp/petri1106_3258952483825389562.dot
Successfully produced net in file /tmp/petri1107_9862728850264650667.dot
Successfully produced net in file /tmp/petri1108_5775075726386587516.dot
Successfully produced net in file /tmp/petri1109_3880947435486557623.dot
Successfully produced net in file /tmp/petri1110_10380194685155027303.dot
Successfully produced net in file /tmp/petri1111_15473294820859057195.dot
Successfully produced net in file /tmp/petri1112_18157036183407153415.dot
Successfully produced net in file /tmp/petri1113_3877080125461397343.dot
Successfully produced net in file /tmp/petri1114_18396940448821119085.dot
Successfully produced net in file /tmp/petri1115_10542513896995000152.dot
Successfully produced net in file /tmp/petri1116_3172725197933000304.dot
Successfully produced net in file /tmp/petri1117_11333353407092416600.dot
Successfully produced net in file /tmp/petri1118_10375199502340221421.dot
Successfully produced net in file /tmp/petri1119_5730976518446408533.dot
Drop transitions removed 120 transitions
Dominated transitions for bounds rules discarded 120 transitions
Normalized transition count is 17 out of 122 initially.
// Phase 1: matrix 17 rows 19 cols
[2023-03-22 14:36:11] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 319936 resets, run finished after 1266 ms. (steps per millisecond=789 ) properties (out of 1) seen :1
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 20566 ms.

BK_STOP 1679495778457

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-S32C2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S32C2, 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 r229-tall-167856413300501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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