Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821000517.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LeafsetExtension-PT-S32C4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821000517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 11K Apr 29 12:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 12:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 29 12:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 12:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 9 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.4M May 10 09:34 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-S32C4-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S32C4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652800708091

Running Version 202205111006
[2022-05-17 15:18:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 15:18:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 15:18:29] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2022-05-17 15:18:29] [INFO ] Transformed 5622 places.
[2022-05-17 15:18:29] [INFO ] Transformed 5449 transitions.
[2022-05-17 15:18:29] [INFO ] Parsed PT model containing 5622 places and 5449 transitions in 430 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2022-05-17 15:18:30] [INFO ] Computed 173 place invariants in 392 ms
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 299 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 15) seen :10
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :2
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :2
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 5449 rows 5622 cols
[2022-05-17 15:18:30] [INFO ] Computed 173 place invariants in 222 ms
[2022-05-17 15:18:31] [INFO ] [Real]Absence check using 35 positive place invariants in 67 ms returned sat
[2022-05-17 15:18:31] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 82 ms returned unsat
[2022-05-17 15:18:31] [INFO ] [Real]Absence check using 35 positive place invariants in 62 ms returned sat
[2022-05-17 15:18:32] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 124 ms returned sat
[2022-05-17 15:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 15:18:35] [INFO ] [Real]Absence check using state equation in 3169 ms returned sat
[2022-05-17 15:18:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 15:18:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 74 ms returned sat
[2022-05-17 15:18:36] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 120 ms returned sat
[2022-05-17 15:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 15:18:39] [INFO ] [Nat]Absence check using state equation in 3347 ms returned sat
[2022-05-17 15:18:40] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 258 ms.
[2022-05-17 15:18:40] [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.refineWithCausalOrder(DeadlockTester.java:1188)
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)
[2022-05-17 15:18:41] [INFO ] [Real]Absence check using 35 positive place invariants in 71 ms returned sat
[2022-05-17 15:18:41] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 151 ms returned unsat
[2022-05-17 15:18:41] [INFO ] [Real]Absence check using 35 positive place invariants in 58 ms returned sat
[2022-05-17 15:18:41] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 106 ms returned unsat
[2022-05-17 15:18:42] [INFO ] [Real]Absence check using 35 positive place invariants in 52 ms returned sat
[2022-05-17 15:18:42] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 150 ms returned unsat
[2022-05-17 15:18:43] [INFO ] [Real]Absence check using 35 positive place invariants in 52 ms returned sat
[2022-05-17 15:18:43] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 151 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[1, 0, 1, 1, 1, 1]
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 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 88 are kept as prefixes of interest. Removing 5534 places using SCC suffix rule.13 ms
Discarding 5534 places :
Also discarding 4036 output transitions
Drop transitions removed 4036 transitions
Drop transitions removed 1105 transitions
Reduce isomorphic transitions removed 1105 transitions.
Discarding 16 places :
Implicit places reduction removed 16 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 1137 rules applied. Total rules applied 1138 place count 72 transition count 292
Reduce places removed 18 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 35 rules applied. Total rules applied 1173 place count 54 transition count 275
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 1190 place count 37 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 1190 place count 37 transition count 274
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1192 place count 36 transition count 274
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1208 place count 36 transition count 258
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1224 place count 20 transition count 258
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 1239 place count 20 transition count 258
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 1240 place count 19 transition count 258
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1241 place count 19 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1242 place count 18 transition count 257
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 1257 place count 18 transition count 242
Applied a total of 1257 rules in 96 ms. Remains 18 /5622 variables (removed 5604) and now considering 242/5449 (removed 5207) transitions.
[2022-05-17 15:18:43] [INFO ] Flow matrix only has 32 transitions (discarded 210 similar events)
// Phase 1: matrix 32 rows 18 cols
[2022-05-17 15:18:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 15:18:43] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/5622 places, 242/5449 transitions.
Successfully produced net in file /tmp/petri1000_18174802906409929595.dot
Successfully produced net in file /tmp/petri1001_906591852340181525.dot
Successfully produced net in file /tmp/petri1002_524905333808801309.dot
Successfully produced net in file /tmp/petri1003_1177061245091176433.dot
Successfully produced net in file /tmp/petri1004_5161666294176530412.dot
Successfully produced net in file /tmp/petri1005_4019359259377060389.dot
Successfully produced net in file /tmp/petri1006_11891321416937443800.dot
Successfully produced net in file /tmp/petri1007_15326733275242776187.dot
Successfully produced net in file /tmp/petri1008_6188191182472181663.dot
Successfully produced net in file /tmp/petri1009_5986404217148886581.dot
Successfully produced net in file /tmp/petri1010_4158544891262726741.dot
Successfully produced net in file /tmp/petri1011_356667391922860544.dot
Successfully produced net in file /tmp/petri1012_17525054498996498639.dot
Successfully produced net in file /tmp/petri1013_14925455584452082383.dot
Successfully produced net in file /tmp/petri1014_17722643401594396917.dot
Successfully produced net in file /tmp/petri1015_9624329175349652954.dot
Successfully produced net in file /tmp/petri1016_3527789933946910093.dot
Successfully produced net in file /tmp/petri1017_3384410839029886337.dot
Successfully produced net in file /tmp/petri1018_1653695764689357277.dot
Successfully produced net in file /tmp/petri1019_11704050107024548010.dot
Successfully produced net in file /tmp/petri1020_11657373610464746496.dot
Successfully produced net in file /tmp/petri1021_11167289932580944301.dot
Successfully produced net in file /tmp/petri1022_13476324526121866189.dot
Successfully produced net in file /tmp/petri1023_10216838147510512694.dot
Successfully produced net in file /tmp/petri1024_5693330909314007352.dot
Successfully produced net in file /tmp/petri1025_6065685219739330897.dot
Successfully produced net in file /tmp/petri1026_17627424657308657340.dot
Successfully produced net in file /tmp/petri1027_17468799885604511342.dot
Successfully produced net in file /tmp/petri1028_18099901778432077945.dot
Successfully produced net in file /tmp/petri1029_9411140209005896968.dot
Successfully produced net in file /tmp/petri1030_2073969957691458437.dot
Successfully produced net in file /tmp/petri1031_8289550652400142469.dot
Successfully produced net in file /tmp/petri1032_15572970442339637666.dot
Successfully produced net in file /tmp/petri1033_13583642840578002582.dot
Successfully produced net in file /tmp/petri1034_990535653644861621.dot
Successfully produced net in file /tmp/petri1035_17176899725051235438.dot
Successfully produced net in file /tmp/petri1036_16747466956803996430.dot
Successfully produced net in file /tmp/petri1037_14690494240981074118.dot
Successfully produced net in file /tmp/petri1038_15784542050870287505.dot
Successfully produced net in file /tmp/petri1039_17338336245106155643.dot
Successfully produced net in file /tmp/petri1040_1444508112881715795.dot
Successfully produced net in file /tmp/petri1041_4293425730370140086.dot
Successfully produced net in file /tmp/petri1042_10350002365254641322.dot
Successfully produced net in file /tmp/petri1043_6265652227300624318.dot
Successfully produced net in file /tmp/petri1044_4647914680356061045.dot
Successfully produced net in file /tmp/petri1045_7996025752809338173.dot
Successfully produced net in file /tmp/petri1046_3693547231104538074.dot
Successfully produced net in file /tmp/petri1047_9513585769512319341.dot
Successfully produced net in file /tmp/petri1048_15519144476104609780.dot
Successfully produced net in file /tmp/petri1049_6587012140025737205.dot
Successfully produced net in file /tmp/petri1050_8081972012258540058.dot
Successfully produced net in file /tmp/petri1051_6077811042590671763.dot
Successfully produced net in file /tmp/petri1052_11100452008962208629.dot
Successfully produced net in file /tmp/petri1053_3821220707897299706.dot
Successfully produced net in file /tmp/petri1054_13071049983361653037.dot
Successfully produced net in file /tmp/petri1055_2122244981021610828.dot
Successfully produced net in file /tmp/petri1056_8500427861311015449.dot
Successfully produced net in file /tmp/petri1057_6823341255920541733.dot
Successfully produced net in file /tmp/petri1058_13141697983396388469.dot
Successfully produced net in file /tmp/petri1059_4539061931508985976.dot
Successfully produced net in file /tmp/petri1060_15788845086350602548.dot
Successfully produced net in file /tmp/petri1061_8588588849314951470.dot
Successfully produced net in file /tmp/petri1062_10790103745360901728.dot
Successfully produced net in file /tmp/petri1063_142474369574936040.dot
Successfully produced net in file /tmp/petri1064_14960753285616071130.dot
Successfully produced net in file /tmp/petri1065_6723617499703363278.dot
Successfully produced net in file /tmp/petri1066_16351821552265749767.dot
Successfully produced net in file /tmp/petri1067_2063615546197382750.dot
Successfully produced net in file /tmp/petri1068_16848912700685998085.dot
Successfully produced net in file /tmp/petri1069_7089690836002795698.dot
Successfully produced net in file /tmp/petri1070_17963337535728885352.dot
Successfully produced net in file /tmp/petri1071_1890031056627209799.dot
Successfully produced net in file /tmp/petri1072_15043269693162448359.dot
Successfully produced net in file /tmp/petri1073_14534144285945151455.dot
Successfully produced net in file /tmp/petri1074_17853889847360423945.dot
Successfully produced net in file /tmp/petri1075_11254708581684500830.dot
Successfully produced net in file /tmp/petri1076_16998779530973548963.dot
Successfully produced net in file /tmp/petri1077_9556544044114774863.dot
Successfully produced net in file /tmp/petri1078_3775395543561497292.dot
Successfully produced net in file /tmp/petri1079_8301618745315178952.dot
Successfully produced net in file /tmp/petri1080_8212070715501749666.dot
Successfully produced net in file /tmp/petri1081_3315286507271993702.dot
Successfully produced net in file /tmp/petri1082_15142398614575437093.dot
Successfully produced net in file /tmp/petri1083_18364367023581849670.dot
Successfully produced net in file /tmp/petri1084_16214417305351421160.dot
Successfully produced net in file /tmp/petri1085_15882825761013520303.dot
Successfully produced net in file /tmp/petri1086_11259905438572586790.dot
Successfully produced net in file /tmp/petri1087_10386968894551344223.dot
Successfully produced net in file /tmp/petri1088_2659763347142635750.dot
Successfully produced net in file /tmp/petri1089_13006519007514171489.dot
Successfully produced net in file /tmp/petri1090_1470565952883026592.dot
Successfully produced net in file /tmp/petri1091_6462715857854699128.dot
Successfully produced net in file /tmp/petri1092_5321648877121541425.dot
Successfully produced net in file /tmp/petri1093_12119996736419975386.dot
Successfully produced net in file /tmp/petri1094_17355477511290285432.dot
Successfully produced net in file /tmp/petri1095_11459431617490806962.dot
Successfully produced net in file /tmp/petri1096_7050367870648833727.dot
Successfully produced net in file /tmp/petri1097_18121982684381463847.dot
Successfully produced net in file /tmp/petri1098_7061007387880896551.dot
Successfully produced net in file /tmp/petri1099_2620782640555556291.dot
Successfully produced net in file /tmp/petri1100_9731422467093226476.dot
Successfully produced net in file /tmp/petri1101_14400717692872376802.dot
Successfully produced net in file /tmp/petri1102_10489179371153307334.dot
Successfully produced net in file /tmp/petri1103_11202923273278209361.dot
Successfully produced net in file /tmp/petri1104_8063783249381769865.dot
Successfully produced net in file /tmp/petri1105_6818943656212600818.dot
Successfully produced net in file /tmp/petri1106_5486469327769405449.dot
Successfully produced net in file /tmp/petri1107_15450053645106941131.dot
Successfully produced net in file /tmp/petri1108_10841501336858347644.dot
Successfully produced net in file /tmp/petri1109_12046240344922404270.dot
Successfully produced net in file /tmp/petri1110_3991008077639578765.dot
Successfully produced net in file /tmp/petri1111_13911285147617327908.dot
Successfully produced net in file /tmp/petri1112_9875913096032667609.dot
Successfully produced net in file /tmp/petri1113_5335462370233171488.dot
Successfully produced net in file /tmp/petri1114_9222219845501144468.dot
Successfully produced net in file /tmp/petri1115_4417734609282931359.dot
Successfully produced net in file /tmp/petri1116_5613252182421103010.dot
Successfully produced net in file /tmp/petri1117_14933845095821160951.dot
Successfully produced net in file /tmp/petri1118_1092577645716003610.dot
Successfully produced net in file /tmp/petri1119_14608356502607810580.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 18 cols
[2022-05-17 15:18:43] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 190528 resets, run finished after 1406 ms. (steps per millisecond=711 ) properties (out of 1) seen :1
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15865 ms.

BK_STOP 1652800725601

--------------------
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-S32C4"
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-4028"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S32C4, 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 r132-tall-165271821000517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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