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.r170-tall-167838856700102.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 Echo-PT-d03r07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856700102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 9.4K Feb 25 14:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 14:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 14:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 14:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.2M 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678482973997

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r07
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 21:16:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 21:16:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:16:15] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2023-03-10 21:16:15] [INFO ] Transformed 4209 places.
[2023-03-10 21:16:15] [INFO ] Transformed 3518 transitions.
[2023-03-10 21:16:15] [INFO ] Found NUPN structural information;
[2023-03-10 21:16:15] [INFO ] Parsed PT model containing 4209 places and 3518 transitions and 25540 arcs in 335 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA Echo-PT-d03r07-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r07-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 14) seen :8
FORMULA Echo-PT-d03r07-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r07-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r07-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r07-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r07-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r07-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r07-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r07-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 3518 rows 4209 cols
[2023-03-10 21:16:17] [INFO ] Computed 2107 place invariants in 271 ms
[2023-03-10 21:16:19] [INFO ] After 1261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 21:16:19] [INFO ] [Nat]Absence check using 216 positive place invariants in 70 ms returned sat
[2023-03-10 21:16:20] [INFO ] [Nat]Absence check using 216 positive and 1891 generalized place invariants in 803 ms returned sat
[2023-03-10 21:16:44] [INFO ] After 22757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 21:16:44] [INFO ] After 22776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-10 21:16:44] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 111 out of 4209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4209/4209 places, 3518/3518 transitions.
Graph (complete) has 18050 edges and 4209 vertex of which 3861 are kept as prefixes of interest. Removing 348 places using SCC suffix rule.20 ms
Discarding 348 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 3861 transition count 3512
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 3860 transition count 3511
Applied a total of 7 rules in 664 ms. Remains 3860 /4209 variables (removed 349) and now considering 3511/3518 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 666 ms. Remains : 3860/4209 places, 3511/3518 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 6) seen :1
FORMULA Echo-PT-d03r07-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 3511 rows 3860 cols
[2023-03-10 21:16:51] [INFO ] Invariants computation overflowed in 5309 ms
[2023-03-10 21:16:51] [INFO ] After 826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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-10 21:17:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 21:17:16] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 92 out of 3860 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3860/3860 places, 3511/3511 transitions.
Applied a total of 0 rules in 225 ms. Remains 3860 /3860 variables (removed 0) and now considering 3511/3511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 3860/3860 places, 3511/3511 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 5) seen :2
FORMULA Echo-PT-d03r07-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r07-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3511 rows 3860 cols
[2023-03-10 21:17:23] [INFO ] Invariants computation overflowed in 5527 ms
[2023-03-10 21:17:24] [INFO ] After 723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real: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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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-10 21:17:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 21:17:49] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 83 out of 3860 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3860/3860 places, 3511/3511 transitions.
Graph (complete) has 14540 edges and 3860 vertex of which 3858 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 208 ms. Remains 3858 /3860 variables (removed 2) and now considering 3511/3511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 3858/3860 places, 3511/3511 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 3) seen :1
FORMULA Echo-PT-d03r07-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3511 rows 3858 cols
[2023-03-10 21:17:57] [INFO ] Invariants computation overflowed in 7367 ms
[2023-03-10 21:17:58] [INFO ] After 645ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:18:23] [INFO ] After 24271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:18:23] [INFO ] After 24287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-10 21:18:23] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 64 out of 3858 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3858/3858 places, 3511/3511 transitions.
Graph (complete) has 14520 edges and 3858 vertex of which 3857 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 191 ms. Remains 3857 /3858 variables (removed 1) and now considering 3511/3511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 3857/3858 places, 3511/3511 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 116065 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116065 steps, saw 78685 distinct states, run finished after 3003 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3511 rows 3857 cols
[2023-03-10 21:18:37] [INFO ] Invariants computation overflowed in 10492 ms
[2023-03-10 21:18:38] [INFO ] After 611ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real: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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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-10 21:19:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 21:19:03] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 64 out of 3857 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3857/3857 places, 3511/3511 transitions.
Applied a total of 0 rules in 172 ms. Remains 3857 /3857 variables (removed 0) and now considering 3511/3511 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 3857/3857 places, 3511/3511 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3857/3857 places, 3511/3511 transitions.
Applied a total of 0 rules in 170 ms. Remains 3857 /3857 variables (removed 0) and now considering 3511/3511 (removed 0) transitions.
// Phase 1: matrix 3511 rows 3857 cols
[2023-03-10 21:19:14] [INFO ] Invariants computation overflowed in 10896 ms
[2023-03-10 21:19:17] [INFO ] Implicit Places using invariants in 13711 ms returned []
// Phase 1: matrix 3511 rows 3857 cols
[2023-03-10 21:19:28] [INFO ] Invariants computation overflowed in 11346 ms
[2023-03-10 21:19:29] [INFO ] Implicit Places using invariants and state equation in 12274 ms returned []
Implicit Place search using SMT with State Equation took 25988 ms to find 0 implicit places.
[2023-03-10 21:19:29] [INFO ] Redundant transitions in 219 ms returned []
// Phase 1: matrix 3511 rows 3857 cols
[2023-03-10 21:19:40] [INFO ] Invariants computation overflowed in 10803 ms
[2023-03-10 21:19:42] [INFO ] Dead Transitions using invariants and state equation in 13038 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39427 ms. Remains : 3857/3857 places, 3511/3511 transitions.
Applied a total of 0 rules in 160 ms. Remains 3857 /3857 variables (removed 0) and now considering 3511/3511 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 3511 rows 3857 cols
[2023-03-10 21:19:53] [INFO ] Invariants computation overflowed in 10811 ms
[2023-03-10 21:19:54] [INFO ] After 642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 21:20:28] [INFO ] After 33659ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 21:20:32] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2023-03-10 21:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-10 21:20:41] [INFO ] After 46326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9023 ms.
[2023-03-10 21:20:50] [INFO ] After 56025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-10 21:20:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-10 21:20:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3857 places, 3511 transitions and 23715 arcs took 25 ms.
[2023-03-10 21:20:51] [INFO ] Flatten gal took : 403 ms
Total runtime 275868 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Echo_PT_d03r07
(NrP: 3857 NrTr: 3511 NrArc: 23715)

parse formulas
formulas created successfully
place and transition orderings generation:0m 2.204sec

net check time: 0m 0.004sec

init dd package: 0m 2.868sec


before gc: list nodes free: 1599729

after gc: idd nodes used:85318, unused:63914682; list nodes free:263859620

before gc: list nodes free: 1198665

after gc: idd nodes used:85898, unused:63914102; list nodes free:263857346

before gc: list nodes free: 883623

after gc: idd nodes used:90273, unused:63909727; list nodes free:263837515

before gc: list nodes free: 540506

after gc: idd nodes used:90406, unused:63909594; list nodes free:263837079

before gc: list nodes free: 602753

after gc: idd nodes used:91434, unused:63908566; list nodes free:263832514

before gc: list nodes free: 506447

after gc: idd nodes used:97733, unused:63902267; list nodes free:263804528

before gc: list nodes free: 1518014

after gc: idd nodes used:94911, unused:63905089; list nodes free:265913784

before gc: list nodes free: 1495511

after gc: idd nodes used:97397, unused:63902603; list nodes free:265902802

before gc: list nodes free: 854949

after gc: idd nodes used:96988, unused:63903012; list nodes free:265904151
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6534588 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095348 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.143sec

77124 82787 81432 82611 82393 87091 85781 86902 87695 86358 87711 88245 88146 87957 90367 90212 89511 88805 90833 92443 93228 92346 91662 93101 92735 93312

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="Echo-PT-d03r07"
export BK_EXAMINATION="ReachabilityCardinality"
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 Echo-PT-d03r07, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838856700102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d03r07.tgz
mv Echo-PT-d03r07 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;