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.r234-tall-167856420400501.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 marciexred
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 r234-tall-167856420400501
=====================================================================

--------------------
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 1679517740907

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 20:42:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 20:42:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:42:22] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2023-03-22 20:42:22] [INFO ] Transformed 5622 places.
[2023-03-22 20:42:22] [INFO ] Transformed 5449 transitions.
[2023-03-22 20:42:22] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-22 20:42:23] [INFO ] Computed 173 place invariants in 342 ms
Incomplete random walk after 10000 steps, including 549 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :10
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-13 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-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-04 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 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :3
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :2
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :2
[2023-03-22 20:42:23] [INFO ] Invariant cache hit.
[2023-03-22 20:42:24] [INFO ] [Real]Absence check using 35 positive place invariants in 63 ms returned sat
[2023-03-22 20:42:24] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 133 ms returned sat
[2023-03-22 20:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:42:27] [INFO ] [Real]Absence check using state equation in 3325 ms returned sat
[2023-03-22 20:42:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:42:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 61 ms returned sat
[2023-03-22 20:42:28] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 141 ms returned sat
[2023-03-22 20:42:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:42:31] [INFO ] [Nat]Absence check using state equation in 3288 ms returned sat
[2023-03-22 20:42:32] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 274 ms.
[2023-03-22 20:42:39] [INFO ] Deduced a trap composed of 2 places in 6714 ms of which 17 ms to minimize.
[2023-03-22 20:42:39] [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: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)
[2023-03-22 20:42:40] [INFO ] [Real]Absence check using 35 positive place invariants in 58 ms returned sat
[2023-03-22 20:42:40] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 180 ms returned sat
[2023-03-22 20:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:42:43] [INFO ] [Real]Absence check using state equation in 3148 ms returned sat
[2023-03-22 20:42:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:42:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 68 ms returned sat
[2023-03-22 20:42:44] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 185 ms returned sat
[2023-03-22 20:42:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:42:47] [INFO ] [Nat]Absence check using state equation in 3148 ms returned sat
[2023-03-22 20:42:48] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 254 ms.
[2023-03-22 20:42:48] [INFO ] Added : 7 causal constraints over 2 iterations in 1040 ms. Result :unknown
[2023-03-22 20:42:49] [INFO ] [Real]Absence check using 35 positive place invariants in 63 ms returned sat
[2023-03-22 20:42:49] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 144 ms returned sat
[2023-03-22 20:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:42:52] [INFO ] [Real]Absence check using state equation in 3248 ms returned sat
[2023-03-22 20:42:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:42:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 55 ms returned sat
[2023-03-22 20:42:53] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 137 ms returned sat
[2023-03-22 20:42:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:42:56] [INFO ] [Nat]Absence check using state equation in 3276 ms returned sat
[2023-03-22 20:42:57] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 231 ms.
[2023-03-22 20:42:58] [INFO ] Added : 10 causal constraints over 2 iterations in 1022 ms. Result :unknown
[2023-03-22 20:42:58] [INFO ] [Real]Absence check using 35 positive place invariants in 57 ms returned sat
[2023-03-22 20:42:58] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 146 ms returned unsat
[2023-03-22 20:42:59] [INFO ] [Real]Absence check using 35 positive place invariants in 56 ms returned sat
[2023-03-22 20:42:59] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 141 ms returned sat
[2023-03-22 20:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:43:02] [INFO ] [Real]Absence check using state equation in 3296 ms returned sat
[2023-03-22 20:43:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 20:43:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 55 ms returned sat
[2023-03-22 20:43:03] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 140 ms returned sat
[2023-03-22 20:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 20:43:06] [INFO ] [Nat]Absence check using state equation in 3243 ms returned sat
[2023-03-22 20:43:07] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 238 ms.
[2023-03-22 20:43:07] [INFO ] Added : 6 causal constraints over 2 iterations in 1011 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1, 1] Max seen :[0, 1, 0, 1, 0]
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S32C2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 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 105 are kept as prefixes of interest. Removing 5517 places using SCC suffix rule.12 ms
Discarding 5517 places :
Also discarding 4036 output transitions
Drop transitions removed 4036 transitions
Drop transitions removed 1089 transitions
Reduce isomorphic transitions removed 1089 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 1120 rules applied. Total rules applied 1121 place count 90 transition count 308
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 33 rules applied. Total rules applied 1154 place count 72 transition count 293
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1169 place count 57 transition count 293
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1169 place count 57 transition count 292
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 1171 place count 56 transition count 292
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1186 place count 41 transition count 277
Iterating global reduction 3 with 15 rules applied. Total rules applied 1201 place count 41 transition count 277
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1202 place count 41 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1203 place count 40 transition count 276
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 1218 place count 40 transition count 261
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1233 place count 25 transition count 261
Applied a total of 1233 rules in 91 ms. Remains 25 /5622 variables (removed 5597) and now considering 261/5449 (removed 5188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 25/5622 places, 261/5449 transitions.
Successfully produced net in file /tmp/petri1000_10120652495044749097.dot
Successfully produced net in file /tmp/petri1001_14772613325743145403.dot
Successfully produced net in file /tmp/petri1002_14925739285640256232.dot
Successfully produced net in file /tmp/petri1003_6282366217237818370.dot
Successfully produced net in file /tmp/petri1004_5328605158060184589.dot
Successfully produced net in file /tmp/petri1005_11188822773260305528.dot
Successfully produced net in file /tmp/petri1006_13327485997044592000.dot
Successfully produced net in file /tmp/petri1007_10994061984689599662.dot
Successfully produced net in file /tmp/petri1008_9433432195363681558.dot
Successfully produced net in file /tmp/petri1009_7934422237843990120.dot
Successfully produced net in file /tmp/petri1010_3427067300484881625.dot
Successfully produced net in file /tmp/petri1011_2613224991454649199.dot
Successfully produced net in file /tmp/petri1012_10357921864164255111.dot
Successfully produced net in file /tmp/petri1013_9664906286094563584.dot
Successfully produced net in file /tmp/petri1014_7239279879900080547.dot
Successfully produced net in file /tmp/petri1015_5553469231923335607.dot
Successfully produced net in file /tmp/petri1016_14345413008861974027.dot
Successfully produced net in file /tmp/petri1017_18386347137603777900.dot
Successfully produced net in file /tmp/petri1018_12991152820267810658.dot
Successfully produced net in file /tmp/petri1019_8160204990995551568.dot
Successfully produced net in file /tmp/petri1020_4168026545828507460.dot
Successfully produced net in file /tmp/petri1021_16851056238177872868.dot
Successfully produced net in file /tmp/petri1022_9973472470845187328.dot
Successfully produced net in file /tmp/petri1023_10982352126098774967.dot
Successfully produced net in file /tmp/petri1024_2161708283903488405.dot
Successfully produced net in file /tmp/petri1025_9293832246564990408.dot
Successfully produced net in file /tmp/petri1026_12224055273528864052.dot
Successfully produced net in file /tmp/petri1027_6197095646876899868.dot
Successfully produced net in file /tmp/petri1028_5081531533636432485.dot
Successfully produced net in file /tmp/petri1029_9476919677258037586.dot
Successfully produced net in file /tmp/petri1030_18299135840577304764.dot
Successfully produced net in file /tmp/petri1031_14957116727850938377.dot
Successfully produced net in file /tmp/petri1032_4730045037707951010.dot
Successfully produced net in file /tmp/petri1033_3315075244814007231.dot
Successfully produced net in file /tmp/petri1034_16872168407733334879.dot
Successfully produced net in file /tmp/petri1035_13224562305764331490.dot
Successfully produced net in file /tmp/petri1036_27785751847630400.dot
Successfully produced net in file /tmp/petri1037_10362908428337303353.dot
Successfully produced net in file /tmp/petri1038_5802245247142169258.dot
Successfully produced net in file /tmp/petri1039_3121312197223842299.dot
Successfully produced net in file /tmp/petri1040_15634566051112749591.dot
Successfully produced net in file /tmp/petri1041_4121616487464897074.dot
Successfully produced net in file /tmp/petri1042_12044040969960514454.dot
Successfully produced net in file /tmp/petri1043_12109991719379876115.dot
Successfully produced net in file /tmp/petri1044_11719371475380124815.dot
Successfully produced net in file /tmp/petri1045_5160658484575111124.dot
Successfully produced net in file /tmp/petri1046_11923851254109640963.dot
Successfully produced net in file /tmp/petri1047_5036701424262184972.dot
Successfully produced net in file /tmp/petri1048_8810863314700465662.dot
Successfully produced net in file /tmp/petri1049_10433549949731180007.dot
Successfully produced net in file /tmp/petri1050_4108535083124568503.dot
Successfully produced net in file /tmp/petri1051_8941509045877150176.dot
Successfully produced net in file /tmp/petri1052_16344863073385450135.dot
Successfully produced net in file /tmp/petri1053_15688259719243091643.dot
Successfully produced net in file /tmp/petri1054_10003268497101080337.dot
Successfully produced net in file /tmp/petri1055_15234620438012570889.dot
Successfully produced net in file /tmp/petri1056_9263245377424412683.dot
Successfully produced net in file /tmp/petri1057_13515603856962116052.dot
Successfully produced net in file /tmp/petri1058_15847442765561748487.dot
Successfully produced net in file /tmp/petri1059_427026609481127263.dot
Successfully produced net in file /tmp/petri1060_2239828329119683826.dot
Successfully produced net in file /tmp/petri1061_8831856643363805740.dot
Successfully produced net in file /tmp/petri1062_6576521131868483370.dot
Successfully produced net in file /tmp/petri1063_4714709712207039527.dot
Successfully produced net in file /tmp/petri1064_17064794581454443457.dot
Successfully produced net in file /tmp/petri1065_11297565701083296987.dot
Successfully produced net in file /tmp/petri1066_17572777954498514445.dot
Successfully produced net in file /tmp/petri1067_9708994885363093461.dot
Successfully produced net in file /tmp/petri1068_3792823663270508357.dot
Successfully produced net in file /tmp/petri1069_12193221403631460327.dot
Successfully produced net in file /tmp/petri1070_4423163686975700195.dot
Successfully produced net in file /tmp/petri1071_6919063368826088441.dot
Successfully produced net in file /tmp/petri1072_3083620491656608392.dot
Successfully produced net in file /tmp/petri1073_15445697704641558288.dot
Successfully produced net in file /tmp/petri1074_12080962889503088854.dot
Successfully produced net in file /tmp/petri1075_8531457729348786276.dot
Successfully produced net in file /tmp/petri1076_6533477394925788918.dot
Successfully produced net in file /tmp/petri1077_11381853113715381608.dot
Successfully produced net in file /tmp/petri1078_18213816363124334416.dot
Successfully produced net in file /tmp/petri1079_6529036689495333125.dot
Successfully produced net in file /tmp/petri1080_11024489304445825288.dot
Successfully produced net in file /tmp/petri1081_11163741703385932098.dot
Successfully produced net in file /tmp/petri1082_8868616693544513702.dot
Successfully produced net in file /tmp/petri1083_6470651376074388666.dot
Successfully produced net in file /tmp/petri1084_13161663834648237378.dot
Successfully produced net in file /tmp/petri1085_4688911969315036463.dot
Successfully produced net in file /tmp/petri1086_15802186424376898818.dot
Successfully produced net in file /tmp/petri1087_11847423687967148122.dot
Successfully produced net in file /tmp/petri1088_6101994540565618125.dot
Successfully produced net in file /tmp/petri1089_9795044052954280719.dot
Successfully produced net in file /tmp/petri1090_8847199057272566734.dot
Successfully produced net in file /tmp/petri1091_13285925556507378152.dot
Successfully produced net in file /tmp/petri1092_16513422090027182199.dot
Successfully produced net in file /tmp/petri1093_3174240230811352311.dot
Successfully produced net in file /tmp/petri1094_14031920592967109728.dot
Successfully produced net in file /tmp/petri1095_5780321091481480385.dot
Successfully produced net in file /tmp/petri1096_39358870908958041.dot
Successfully produced net in file /tmp/petri1097_17465379386799478361.dot
Successfully produced net in file /tmp/petri1098_11039076968151295650.dot
Successfully produced net in file /tmp/petri1099_13914419378539846665.dot
Successfully produced net in file /tmp/petri1100_2722668060957129997.dot
Successfully produced net in file /tmp/petri1101_8622499373838673915.dot
Successfully produced net in file /tmp/petri1102_8036887186059972063.dot
Successfully produced net in file /tmp/petri1103_4592562012253990577.dot
Successfully produced net in file /tmp/petri1104_18131033179094224614.dot
Drop transitions removed 105 transitions
Dominated transitions for bounds rules discarded 105 transitions
Normalized transition count is 38 out of 156 initially.
// Phase 1: matrix 38 rows 25 cols
[2023-03-22 20:43:08] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 180507 resets, run finished after 1267 ms. (steps per millisecond=789 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 14887 resets, run finished after 452 ms. (steps per millisecond=2212 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 12274 resets, run finished after 450 ms. (steps per millisecond=2222 ) properties (out of 2) seen :3
[2023-03-22 20:43:10] [INFO ] Flow matrix only has 38 transitions (discarded 118 similar events)
// Phase 1: matrix 38 rows 25 cols
[2023-03-22 20:43:10] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 20:43:10] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 20:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:43:10] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-22 20:43:10] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 20:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 20:43:10] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 2] Max seen :[1, 2]
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
All properties solved without resorting to model-checking.
Total runtime 48181 ms.
ITS solved all properties within timeout

BK_STOP 1679517791553

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

+ 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="marciexred"
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 marciexred"
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 r234-tall-167856420400501"
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 ;