About the Execution of LTSMin+red for Echo-PT-d02r15
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3811.731 | 3600000.00 | 14186969.00 | 519.50 | TTTFFFTTTTTF?TFT | 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.r169-tall-167838855300070.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 ltsminxred
Input is Echo-PT-d02r15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855300070
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.5K Feb 25 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 14:08 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.7K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 9.6K Feb 25 14:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 14:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 14:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 14:11 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 917K 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-d02r15-ReachabilityCardinality-00
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-01
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-02
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-03
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-04
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-05
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-06
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-07
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-08
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-09
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-10
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-11
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-12
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-13
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-14
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678471426206
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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 18:03:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 18:03:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 18:03:47] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2023-03-10 18:03:47] [INFO ] Transformed 2127 places.
[2023-03-10 18:03:47] [INFO ] Transformed 1674 transitions.
[2023-03-10 18:03:47] [INFO ] Found NUPN structural information;
[2023-03-10 18:03:47] [INFO ] Parsed PT model containing 2127 places and 1674 transitions and 9700 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA Echo-PT-d02r15-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r15-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 10) seen :9
FORMULA Echo-PT-d02r15-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1674 rows 2127 cols
[2023-03-10 18:03:48] [INFO ] Computed 1065 place invariants in 160 ms
[2023-03-10 18:03:49] [INFO ] After 539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 18:03:49] [INFO ] [Nat]Absence check using 82 positive place invariants in 30 ms returned sat
[2023-03-10 18:03:49] [INFO ] [Nat]Absence check using 82 positive and 983 generalized place invariants in 369 ms returned sat
[2023-03-10 18:03:51] [INFO ] After 1153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 18:03:51] [INFO ] Deduced a trap composed of 13 places in 647 ms of which 11 ms to minimize.
[2023-03-10 18:03:52] [INFO ] Deduced a trap composed of 16 places in 593 ms of which 2 ms to minimize.
[2023-03-10 18:03:53] [INFO ] Deduced a trap composed of 10 places in 581 ms of which 2 ms to minimize.
[2023-03-10 18:03:53] [INFO ] Deduced a trap composed of 16 places in 587 ms of which 3 ms to minimize.
[2023-03-10 18:03:54] [INFO ] Deduced a trap composed of 14 places in 566 ms of which 2 ms to minimize.
[2023-03-10 18:03:55] [INFO ] Deduced a trap composed of 14 places in 569 ms of which 4 ms to minimize.
[2023-03-10 18:03:55] [INFO ] Deduced a trap composed of 13 places in 541 ms of which 14 ms to minimize.
[2023-03-10 18:03:56] [INFO ] Deduced a trap composed of 15 places in 556 ms of which 1 ms to minimize.
[2023-03-10 18:03:57] [INFO ] Deduced a trap composed of 15 places in 558 ms of which 1 ms to minimize.
[2023-03-10 18:03:57] [INFO ] Deduced a trap composed of 12 places in 562 ms of which 1 ms to minimize.
[2023-03-10 18:03:58] [INFO ] Deduced a trap composed of 11 places in 566 ms of which 1 ms to minimize.
[2023-03-10 18:03:59] [INFO ] Deduced a trap composed of 12 places in 530 ms of which 1 ms to minimize.
[2023-03-10 18:03:59] [INFO ] Deduced a trap composed of 19 places in 529 ms of which 1 ms to minimize.
[2023-03-10 18:04:00] [INFO ] Deduced a trap composed of 14 places in 555 ms of which 2 ms to minimize.
[2023-03-10 18:04:01] [INFO ] Deduced a trap composed of 13 places in 449 ms of which 1 ms to minimize.
[2023-03-10 18:04:01] [INFO ] Deduced a trap composed of 17 places in 449 ms of which 1 ms to minimize.
[2023-03-10 18:04:02] [INFO ] Deduced a trap composed of 14 places in 450 ms of which 1 ms to minimize.
[2023-03-10 18:04:02] [INFO ] Deduced a trap composed of 12 places in 457 ms of which 1 ms to minimize.
[2023-03-10 18:04:03] [INFO ] Deduced a trap composed of 15 places in 449 ms of which 1 ms to minimize.
[2023-03-10 18:04:03] [INFO ] Deduced a trap composed of 21 places in 445 ms of which 1 ms to minimize.
[2023-03-10 18:04:04] [INFO ] Deduced a trap composed of 24 places in 448 ms of which 2 ms to minimize.
[2023-03-10 18:04:04] [INFO ] Deduced a trap composed of 13 places in 423 ms of which 1 ms to minimize.
[2023-03-10 18:04:05] [INFO ] Deduced a trap composed of 16 places in 431 ms of which 1 ms to minimize.
[2023-03-10 18:04:05] [INFO ] Deduced a trap composed of 16 places in 433 ms of which 1 ms to minimize.
[2023-03-10 18:04:06] [INFO ] Deduced a trap composed of 14 places in 418 ms of which 1 ms to minimize.
[2023-03-10 18:04:06] [INFO ] Deduced a trap composed of 10 places in 419 ms of which 1 ms to minimize.
[2023-03-10 18:04:07] [INFO ] Deduced a trap composed of 26 places in 396 ms of which 1 ms to minimize.
[2023-03-10 18:04:07] [INFO ] Deduced a trap composed of 10 places in 394 ms of which 1 ms to minimize.
[2023-03-10 18:04:08] [INFO ] Deduced a trap composed of 11 places in 378 ms of which 1 ms to minimize.
[2023-03-10 18:04:08] [INFO ] Deduced a trap composed of 17 places in 385 ms of which 1 ms to minimize.
[2023-03-10 18:04:09] [INFO ] Deduced a trap composed of 11 places in 386 ms of which 1 ms to minimize.
[2023-03-10 18:04:09] [INFO ] Deduced a trap composed of 13 places in 392 ms of which 1 ms to minimize.
[2023-03-10 18:04:10] [INFO ] Deduced a trap composed of 17 places in 380 ms of which 1 ms to minimize.
[2023-03-10 18:04:10] [INFO ] Deduced a trap composed of 16 places in 399 ms of which 5 ms to minimize.
[2023-03-10 18:04:11] [INFO ] Deduced a trap composed of 12 places in 386 ms of which 1 ms to minimize.
[2023-03-10 18:04:11] [INFO ] Deduced a trap composed of 18 places in 459 ms of which 1 ms to minimize.
[2023-03-10 18:04:12] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 1 ms to minimize.
[2023-03-10 18:04:12] [INFO ] Deduced a trap composed of 12 places in 423 ms of which 1 ms to minimize.
[2023-03-10 18:04:13] [INFO ] Deduced a trap composed of 14 places in 401 ms of which 2 ms to minimize.
[2023-03-10 18:04:13] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 1 ms to minimize.
[2023-03-10 18:04:14] [INFO ] Deduced a trap composed of 14 places in 434 ms of which 1 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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 18:04:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 18:04:14] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 7 ms.
Support contains 11 out of 2127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2127/2127 places, 1674/1674 transitions.
Graph (complete) has 7362 edges and 2127 vertex of which 1894 are kept as prefixes of interest. Removing 233 places using SCC suffix rule.9 ms
Discarding 233 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 1894 transition count 1669
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 1893 transition count 1668
Applied a total of 6 rules in 377 ms. Remains 1893 /2127 variables (removed 234) and now considering 1668/1674 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 377 ms. Remains : 1893/2127 places, 1668/1674 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 383875 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 383875 steps, saw 85513 distinct states, run finished after 3002 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1668 rows 1893 cols
[2023-03-10 18:04:19] [INFO ] Computed 833 place invariants in 1348 ms
[2023-03-10 18:04:19] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 18:04:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-10 18:04:20] [INFO ] [Nat]Absence check using 3 positive and 830 generalized place invariants in 867 ms returned sat
[2023-03-10 18:04:21] [INFO ] After 957ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 18:04:22] [INFO ] After 1148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-10 18:04:22] [INFO ] After 2531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 11 out of 1893 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1893/1893 places, 1668/1668 transitions.
Applied a total of 0 rules in 80 ms. Remains 1893 /1893 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1893/1893 places, 1668/1668 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1893/1893 places, 1668/1668 transitions.
Applied a total of 0 rules in 78 ms. Remains 1893 /1893 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
[2023-03-10 18:04:22] [INFO ] Invariant cache hit.
[2023-03-10 18:04:26] [INFO ] Implicit Places using invariants in 4375 ms returned [2, 55, 1838, 1891]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4384 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1889/1893 places, 1668/1668 transitions.
Applied a total of 0 rules in 68 ms. Remains 1889 /1889 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4532 ms. Remains : 1889/1893 places, 1668/1668 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 391722 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 391722 steps, saw 86401 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1668 rows 1889 cols
[2023-03-10 18:04:32] [INFO ] Computed 829 place invariants in 2053 ms
[2023-03-10 18:04:32] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 18:04:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 28 ms returned sat
[2023-03-10 18:04:35] [INFO ] [Nat]Absence check using 3 positive and 826 generalized place invariants in 2688 ms returned sat
[2023-03-10 18:04:36] [INFO ] After 1174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 18:04:36] [INFO ] After 1396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-10 18:04:37] [INFO ] After 4779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 1889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1889/1889 places, 1668/1668 transitions.
Applied a total of 0 rules in 61 ms. Remains 1889 /1889 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1889/1889 places, 1668/1668 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1889/1889 places, 1668/1668 transitions.
Applied a total of 0 rules in 70 ms. Remains 1889 /1889 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
[2023-03-10 18:04:37] [INFO ] Invariant cache hit.
[2023-03-10 18:04:43] [INFO ] Implicit Places using invariants in 5885 ms returned []
[2023-03-10 18:04:43] [INFO ] Invariant cache hit.
[2023-03-10 18:04:49] [INFO ] Implicit Places using invariants and state equation in 6094 ms returned []
Implicit Place search using SMT with State Equation took 11982 ms to find 0 implicit places.
[2023-03-10 18:04:49] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-10 18:04:49] [INFO ] Invariant cache hit.
[2023-03-10 18:04:53] [INFO ] Dead Transitions using invariants and state equation in 4399 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16556 ms. Remains : 1889/1889 places, 1668/1668 transitions.
Applied a total of 0 rules in 59 ms. Remains 1889 /1889 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-10 18:04:53] [INFO ] Invariant cache hit.
[2023-03-10 18:04:54] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 18:04:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 24 ms returned sat
[2023-03-10 18:04:57] [INFO ] [Nat]Absence check using 3 positive and 826 generalized place invariants in 2970 ms returned sat
[2023-03-10 18:04:59] [INFO ] After 1624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 18:04:59] [INFO ] After 1857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-10 18:04:59] [INFO ] After 5558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 18:04:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-10 18:04:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1889 places, 1668 transitions and 8804 arcs took 18 ms.
[2023-03-10 18:05:00] [INFO ] Flatten gal took : 218 ms
Total runtime 72477 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/624/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12331952 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098116 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
mcc2023
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-d02r15"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Echo-PT-d02r15, 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 r169-tall-167838855300070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d02r15.tgz
mv Echo-PT-d02r15 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 '
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 ;