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

About the Execution of Marcie+red for LeafsetExtension-PT-S32C4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
548.672 49670.00 66419.00 264.20 1 1 1 1 1 4 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.r234-tall-167856420400517.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-S32C4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420400517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 11K Feb 25 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 16:54 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-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 1679522016044

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-S32C4
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 21:53:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 21:53:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 21:53:37] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2023-03-22 21:53:37] [INFO ] Transformed 5622 places.
[2023-03-22 21:53:37] [INFO ] Transformed 5449 transitions.
[2023-03-22 21:53:37] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 452 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2023-03-22 21:53:38] [INFO ] Computed 173 place invariants in 364 ms
Incomplete random walk after 10000 steps, including 301 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 16) seen :12
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-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :2
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :2
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :1
[2023-03-22 21:53:38] [INFO ] Invariant cache hit.
[2023-03-22 21:53:39] [INFO ] [Real]Absence check using 35 positive place invariants in 62 ms returned sat
[2023-03-22 21:53:39] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 132 ms returned sat
[2023-03-22 21:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:53:42] [INFO ] [Real]Absence check using state equation in 3354 ms returned sat
[2023-03-22 21:53:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:53:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 63 ms returned sat
[2023-03-22 21:53:44] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 140 ms returned sat
[2023-03-22 21:53:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:53:47] [INFO ] [Nat]Absence check using state equation in 3388 ms returned sat
[2023-03-22 21:53:48] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 298 ms.
[2023-03-22 21:53:54] [INFO ] Deduced a trap composed of 2 places in 6032 ms of which 13 ms to minimize.
[2023-03-22 21:53:54] [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 21:53:54] [INFO ] [Real]Absence check using 35 positive place invariants in 71 ms returned sat
[2023-03-22 21:53:55] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 147 ms returned unsat
[2023-03-22 21:53:55] [INFO ] [Real]Absence check using 35 positive place invariants in 64 ms returned sat
[2023-03-22 21:53:55] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 158 ms returned sat
[2023-03-22 21:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:53:59] [INFO ] [Real]Absence check using state equation in 3253 ms returned sat
[2023-03-22 21:53:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:53:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 110 ms returned sat
[2023-03-22 21:54:00] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 155 ms returned sat
[2023-03-22 21:54:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:54:03] [INFO ] [Nat]Absence check using state equation in 3356 ms returned sat
[2023-03-22 21:54:03] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 264 ms.
[2023-03-22 21:54:11] [INFO ] Deduced a trap composed of 2 places in 6759 ms of which 7 ms to minimize.
[2023-03-22 21:54:11] [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 2
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 21:54:11] [INFO ] [Real]Absence check using 35 positive place invariants in 53 ms returned sat
[2023-03-22 21:54:11] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 138 ms returned sat
[2023-03-22 21:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:54:15] [INFO ] [Real]Absence check using state equation in 3239 ms returned sat
[2023-03-22 21:54:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:54:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 58 ms returned sat
[2023-03-22 21:54:15] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 147 ms returned sat
[2023-03-22 21:54:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:54:19] [INFO ] [Nat]Absence check using state equation in 3472 ms returned sat
[2023-03-22 21:54:19] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 240 ms.
[2023-03-22 21:54:20] [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.refineWithCausalOrder(DeadlockTester.java:1186)
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, 1, 1, 1] Max seen :[1, 1, 0, 0]
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 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 228 are kept as prefixes of interest. Removing 5394 places using SCC suffix rule.12 ms
Discarding 5394 places :
Also discarding 3167 output transitions
Drop transitions removed 3167 transitions
Drop transitions removed 1104 transitions
Reduce isomorphic transitions removed 1104 transitions.
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 1168 rules applied. Total rules applied 1169 place count 212 transition count 1130
Reduce places removed 51 places and 0 transitions.
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 85 rules applied. Total rules applied 1254 place count 161 transition count 1096
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 1272 place count 143 transition count 1096
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1272 place count 143 transition count 1091
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1282 place count 138 transition count 1091
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1297 place count 123 transition count 1076
Iterating global reduction 3 with 15 rules applied. Total rules applied 1312 place count 123 transition count 1076
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1328 place count 123 transition count 1060
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1344 place count 107 transition count 1060
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 1374 place count 107 transition count 1060
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 1376 place count 105 transition count 1060
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1378 place count 105 transition count 1058
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1380 place count 103 transition count 1058
Applied a total of 1380 rules in 177 ms. Remains 103 /5622 variables (removed 5519) and now considering 1058/5449 (removed 4391) transitions.
[2023-03-22 21:54:20] [INFO ] Flow matrix only has 130 transitions (discarded 928 similar events)
// Phase 1: matrix 130 rows 103 cols
[2023-03-22 21:54:20] [INFO ] Computed 3 place invariants in 11 ms
[2023-03-22 21:54:20] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 553 ms. Remains : 103/5622 places, 1058/5449 transitions.
Successfully produced net in file /tmp/petri1000_4497256745680796773.dot
Successfully produced net in file /tmp/petri1001_16038794634557894970.dot
Successfully produced net in file /tmp/petri1002_10917655912028240887.dot
Successfully produced net in file /tmp/petri1003_821354767072943337.dot
Successfully produced net in file /tmp/petri1004_3281842964955324553.dot
Successfully produced net in file /tmp/petri1005_2455092369284255884.dot
Successfully produced net in file /tmp/petri1006_3242826679049260028.dot
Successfully produced net in file /tmp/petri1007_13308007918409973231.dot
Successfully produced net in file /tmp/petri1008_9751743607288205034.dot
Successfully produced net in file /tmp/petri1009_8520877602070418457.dot
Successfully produced net in file /tmp/petri1010_14407228161489389130.dot
Successfully produced net in file /tmp/petri1011_11123988334176929840.dot
Successfully produced net in file /tmp/petri1012_2421341584180470723.dot
Successfully produced net in file /tmp/petri1013_1387285523177870792.dot
Successfully produced net in file /tmp/petri1014_15031810372821747972.dot
Successfully produced net in file /tmp/petri1015_11943102823366195787.dot
Successfully produced net in file /tmp/petri1016_9933133408676023915.dot
Successfully produced net in file /tmp/petri1017_16596982987899380313.dot
Successfully produced net in file /tmp/petri1018_1576775375965040091.dot
Successfully produced net in file /tmp/petri1019_3878520403575319574.dot
Successfully produced net in file /tmp/petri1020_17297378420616255768.dot
Successfully produced net in file /tmp/petri1021_17064369464824866805.dot
Successfully produced net in file /tmp/petri1022_11835492419706420828.dot
Successfully produced net in file /tmp/petri1023_17886688213752055719.dot
Successfully produced net in file /tmp/petri1024_5425145864543497443.dot
Successfully produced net in file /tmp/petri1025_1669688548709176869.dot
Successfully produced net in file /tmp/petri1026_14758662508785977010.dot
Successfully produced net in file /tmp/petri1027_11540440404345261361.dot
Successfully produced net in file /tmp/petri1028_10015266808940325854.dot
Successfully produced net in file /tmp/petri1029_15113526325435467163.dot
Successfully produced net in file /tmp/petri1030_19300423709738827.dot
Successfully produced net in file /tmp/petri1031_5118853865494763556.dot
Successfully produced net in file /tmp/petri1032_17065192635664675063.dot
Successfully produced net in file /tmp/petri1033_14713113782239614821.dot
Successfully produced net in file /tmp/petri1034_16475624160709156188.dot
Successfully produced net in file /tmp/petri1035_11655704880325172086.dot
Successfully produced net in file /tmp/petri1036_5091200320034424980.dot
Successfully produced net in file /tmp/petri1037_14048734872060365568.dot
Successfully produced net in file /tmp/petri1038_8270073957891437103.dot
Successfully produced net in file /tmp/petri1039_773168618427935004.dot
Successfully produced net in file /tmp/petri1040_15845539082936161568.dot
Successfully produced net in file /tmp/petri1041_14789921194638920905.dot
Successfully produced net in file /tmp/petri1042_7964374329974859792.dot
Successfully produced net in file /tmp/petri1043_16886816394162795647.dot
Successfully produced net in file /tmp/petri1044_5850713374567933155.dot
Successfully produced net in file /tmp/petri1045_12628188806807194468.dot
Successfully produced net in file /tmp/petri1046_8205969397907938846.dot
Successfully produced net in file /tmp/petri1047_15306221547393217902.dot
Successfully produced net in file /tmp/petri1048_8718124057822301222.dot
Successfully produced net in file /tmp/petri1049_18210462670297656438.dot
Successfully produced net in file /tmp/petri1050_13915767693379621266.dot
Successfully produced net in file /tmp/petri1051_11647605868224814297.dot
Successfully produced net in file /tmp/petri1052_4637634146070538383.dot
Successfully produced net in file /tmp/petri1053_17833764388346869836.dot
Successfully produced net in file /tmp/petri1054_4881483462229540152.dot
Successfully produced net in file /tmp/petri1055_9535033456541818092.dot
Successfully produced net in file /tmp/petri1056_9864352120897312237.dot
Successfully produced net in file /tmp/petri1057_5840075173511155737.dot
Successfully produced net in file /tmp/petri1058_151700135219942380.dot
Successfully produced net in file /tmp/petri1059_2995774460456737865.dot
Successfully produced net in file /tmp/petri1060_2426067337513724580.dot
Successfully produced net in file /tmp/petri1061_3153651591333752421.dot
Successfully produced net in file /tmp/petri1062_1178636737306795892.dot
Successfully produced net in file /tmp/petri1063_2970541837579851539.dot
Successfully produced net in file /tmp/petri1064_4394078870683118809.dot
Successfully produced net in file /tmp/petri1065_132500821715640081.dot
Successfully produced net in file /tmp/petri1066_18430354576185122737.dot
Successfully produced net in file /tmp/petri1067_8850547480611116839.dot
Successfully produced net in file /tmp/petri1068_8551063810730826535.dot
Successfully produced net in file /tmp/petri1069_11117984969470443677.dot
Successfully produced net in file /tmp/petri1070_902416169283375025.dot
Successfully produced net in file /tmp/petri1071_7772107134357888943.dot
Successfully produced net in file /tmp/petri1072_9355247737675531611.dot
Successfully produced net in file /tmp/petri1073_347069248744072116.dot
Successfully produced net in file /tmp/petri1074_10660884252802566135.dot
Successfully produced net in file /tmp/petri1075_7277524439747579939.dot
Successfully produced net in file /tmp/petri1076_8078271264546225705.dot
Successfully produced net in file /tmp/petri1077_16813187687507806159.dot
Successfully produced net in file /tmp/petri1078_4740329248807331200.dot
Successfully produced net in file /tmp/petri1079_16977445875169773236.dot
Successfully produced net in file /tmp/petri1080_13165774790092507651.dot
Successfully produced net in file /tmp/petri1081_374930153936551122.dot
Successfully produced net in file /tmp/petri1082_17802393455596309462.dot
Successfully produced net in file /tmp/petri1083_9346156705407139387.dot
Successfully produced net in file /tmp/petri1084_18410272647033143244.dot
Successfully produced net in file /tmp/petri1085_16494769113422820157.dot
Successfully produced net in file /tmp/petri1086_16213823506123661545.dot
Successfully produced net in file /tmp/petri1087_17462833531020826545.dot
Successfully produced net in file /tmp/petri1088_2252133637154168075.dot
Successfully produced net in file /tmp/petri1089_10577298420758863212.dot
Successfully produced net in file /tmp/petri1090_18331119384453350051.dot
Successfully produced net in file /tmp/petri1091_5729572400998288819.dot
Successfully produced net in file /tmp/petri1092_4224422931520145213.dot
Successfully produced net in file /tmp/petri1093_36105721536134247.dot
Successfully produced net in file /tmp/petri1094_9092215279863874890.dot
Successfully produced net in file /tmp/petri1095_7916686093672384196.dot
Successfully produced net in file /tmp/petri1096_3399848169298141881.dot
Successfully produced net in file /tmp/petri1097_9952010287060074090.dot
Successfully produced net in file /tmp/petri1098_16739705656084529623.dot
Successfully produced net in file /tmp/petri1099_15560457178461638676.dot
Successfully produced net in file /tmp/petri1100_1685681091198289718.dot
Successfully produced net in file /tmp/petri1101_2130436287695003702.dot
Successfully produced net in file /tmp/petri1102_3406072080273551882.dot
Successfully produced net in file /tmp/petri1103_12377143655582190574.dot
Successfully produced net in file /tmp/petri1104_14707231108667671428.dot
Successfully produced net in file /tmp/petri1105_11882804453819579933.dot
Successfully produced net in file /tmp/petri1106_13513975288680969696.dot
Successfully produced net in file /tmp/petri1107_11721644293643276860.dot
Successfully produced net in file /tmp/petri1108_18244905871850071851.dot
Successfully produced net in file /tmp/petri1109_235901821255991938.dot
Successfully produced net in file /tmp/petri1110_16936483751349436548.dot
Successfully produced net in file /tmp/petri1111_1519285316123863088.dot
Successfully produced net in file /tmp/petri1112_10749508245292245619.dot
Successfully produced net in file /tmp/petri1113_11427051243651005009.dot
Successfully produced net in file /tmp/petri1114_3931255101960191715.dot
Successfully produced net in file /tmp/petri1115_11138990617064746353.dot
Successfully produced net in file /tmp/petri1116_17671075921361824236.dot
Successfully produced net in file /tmp/petri1117_13135831924590917276.dot
Successfully produced net in file /tmp/petri1118_5765368964196053584.dot
Successfully produced net in file /tmp/petri1119_16569979069526522647.dot
Successfully produced net in file /tmp/petri1120_10829190554312711132.dot
Successfully produced net in file /tmp/petri1121_6383211922271418394.dot
Successfully produced net in file /tmp/petri1122_5356357702904742496.dot
Successfully produced net in file /tmp/petri1123_8062633543497902250.dot
Successfully produced net in file /tmp/petri1124_16542371286023290553.dot
Successfully produced net in file /tmp/petri1125_16236545390624034576.dot
Successfully produced net in file /tmp/petri1126_123628823234778638.dot
Successfully produced net in file /tmp/petri1127_2896873996264448865.dot
Successfully produced net in file /tmp/petri1128_1213802269978272736.dot
Successfully produced net in file /tmp/petri1129_11241968914184437830.dot
Successfully produced net in file /tmp/petri1130_17654864388370866808.dot
Successfully produced net in file /tmp/petri1131_4189850911037114478.dot
Successfully produced net in file /tmp/petri1132_3125201468977287362.dot
Successfully produced net in file /tmp/petri1133_9216564216004629148.dot
Successfully produced net in file /tmp/petri1134_13472283672976139688.dot
Successfully produced net in file /tmp/petri1135_8372484816532906037.dot
Successfully produced net in file /tmp/petri1136_9677569788765997133.dot
Successfully produced net in file /tmp/petri1137_4194585304402021791.dot
Successfully produced net in file /tmp/petri1138_9665678580412387746.dot
Successfully produced net in file /tmp/petri1139_12733525852139961914.dot
Successfully produced net in file /tmp/petri1140_8985874947833759394.dot
Successfully produced net in file /tmp/petri1141_14549403385295099175.dot
Successfully produced net in file /tmp/petri1142_3792875318708714124.dot
Successfully produced net in file /tmp/petri1143_8728690411473449077.dot
Successfully produced net in file /tmp/petri1144_12128102641301126137.dot
Successfully produced net in file /tmp/petri1145_11580899767566407574.dot
Successfully produced net in file /tmp/petri1146_18010151667479776857.dot
Successfully produced net in file /tmp/petri1147_3445530127615326882.dot
Successfully produced net in file /tmp/petri1148_3235661702804373906.dot
Successfully produced net in file /tmp/petri1149_6726954677534128179.dot
Drop transitions removed 150 transitions
Dominated transitions for bounds rules discarded 150 transitions
Normalized transition count is 100 out of 908 initially.
// Phase 1: matrix 100 rows 103 cols
[2023-03-22 21:54:21] [INFO ] Computed 3 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 111250 resets, run finished after 2838 ms. (steps per millisecond=352 ) properties (out of 3) seen :6
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6227 resets, run finished after 718 ms. (steps per millisecond=1392 ) properties (out of 1) seen :4
[2023-03-22 21:54:24] [INFO ] Flow matrix only has 100 transitions (discarded 808 similar events)
// Phase 1: matrix 100 rows 103 cols
[2023-03-22 21:54:24] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-22 21:54:24] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-22 21:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:54:24] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 47304 ms.
ITS solved all properties within timeout

BK_STOP 1679522065714

--------------------
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-S32C4"
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-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 r234-tall-167856420400517"
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 ;