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.r171-tall-167838858000070.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 smartxred
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 r171-tall-167838858000070
=====================================================================

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

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r15
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 16:40:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 16:40:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:40:28] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-03-21 16:40:28] [INFO ] Transformed 2127 places.
[2023-03-21 16:40:28] [INFO ] Transformed 1674 transitions.
[2023-03-21 16:40:28] [INFO ] Found NUPN structural information;
[2023-03-21 16:40:28] [INFO ] Parsed PT model containing 2127 places and 1674 transitions and 9700 arcs in 393 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 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 260 ms. (steps per millisecond=38 ) 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 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1674 rows 2127 cols
[2023-03-21 16:40:29] [INFO ] Computed 1065 place invariants in 183 ms
[2023-03-21 16:40:30] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:40:30] [INFO ] [Nat]Absence check using 82 positive place invariants in 26 ms returned sat
[2023-03-21 16:40:30] [INFO ] [Nat]Absence check using 82 positive and 983 generalized place invariants in 324 ms returned sat
[2023-03-21 16:40:31] [INFO ] After 1097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 16:40:32] [INFO ] Deduced a trap composed of 13 places in 581 ms of which 6 ms to minimize.
[2023-03-21 16:40:33] [INFO ] Deduced a trap composed of 16 places in 553 ms of which 2 ms to minimize.
[2023-03-21 16:40:33] [INFO ] Deduced a trap composed of 10 places in 540 ms of which 2 ms to minimize.
[2023-03-21 16:40:34] [INFO ] Deduced a trap composed of 16 places in 560 ms of which 1 ms to minimize.
[2023-03-21 16:40:35] [INFO ] Deduced a trap composed of 14 places in 535 ms of which 2 ms to minimize.
[2023-03-21 16:40:35] [INFO ] Deduced a trap composed of 14 places in 518 ms of which 2 ms to minimize.
[2023-03-21 16:40:36] [INFO ] Deduced a trap composed of 13 places in 499 ms of which 1 ms to minimize.
[2023-03-21 16:40:36] [INFO ] Deduced a trap composed of 15 places in 501 ms of which 1 ms to minimize.
[2023-03-21 16:40:37] [INFO ] Deduced a trap composed of 15 places in 496 ms of which 1 ms to minimize.
[2023-03-21 16:40:38] [INFO ] Deduced a trap composed of 12 places in 554 ms of which 2 ms to minimize.
[2023-03-21 16:40:38] [INFO ] Deduced a trap composed of 11 places in 515 ms of which 1 ms to minimize.
[2023-03-21 16:40:39] [INFO ] Deduced a trap composed of 12 places in 516 ms of which 1 ms to minimize.
[2023-03-21 16:40:39] [INFO ] Deduced a trap composed of 19 places in 489 ms of which 1 ms to minimize.
[2023-03-21 16:40:40] [INFO ] Deduced a trap composed of 14 places in 535 ms of which 1 ms to minimize.
[2023-03-21 16:40:41] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 2 ms to minimize.
[2023-03-21 16:40:41] [INFO ] Deduced a trap composed of 17 places in 424 ms of which 1 ms to minimize.
[2023-03-21 16:40:42] [INFO ] Deduced a trap composed of 14 places in 426 ms of which 1 ms to minimize.
[2023-03-21 16:40:42] [INFO ] Deduced a trap composed of 12 places in 384 ms of which 1 ms to minimize.
[2023-03-21 16:40:43] [INFO ] Deduced a trap composed of 15 places in 419 ms of which 1 ms to minimize.
[2023-03-21 16:40:43] [INFO ] Deduced a trap composed of 21 places in 427 ms of which 1 ms to minimize.
[2023-03-21 16:40:44] [INFO ] Deduced a trap composed of 24 places in 396 ms of which 1 ms to minimize.
[2023-03-21 16:40:44] [INFO ] Deduced a trap composed of 13 places in 383 ms of which 2 ms to minimize.
[2023-03-21 16:40:45] [INFO ] Deduced a trap composed of 16 places in 388 ms of which 1 ms to minimize.
[2023-03-21 16:40:45] [INFO ] Deduced a trap composed of 16 places in 381 ms of which 0 ms to minimize.
[2023-03-21 16:40:46] [INFO ] Deduced a trap composed of 14 places in 392 ms of which 1 ms to minimize.
[2023-03-21 16:40:46] [INFO ] Deduced a trap composed of 10 places in 369 ms of which 1 ms to minimize.
[2023-03-21 16:40:46] [INFO ] Deduced a trap composed of 26 places in 370 ms of which 1 ms to minimize.
[2023-03-21 16:40:47] [INFO ] Deduced a trap composed of 10 places in 351 ms of which 1 ms to minimize.
[2023-03-21 16:40:47] [INFO ] Deduced a trap composed of 11 places in 341 ms of which 1 ms to minimize.
[2023-03-21 16:40:48] [INFO ] Deduced a trap composed of 17 places in 334 ms of which 1 ms to minimize.
[2023-03-21 16:40:48] [INFO ] Deduced a trap composed of 11 places in 346 ms of which 1 ms to minimize.
[2023-03-21 16:40:49] [INFO ] Deduced a trap composed of 13 places in 368 ms of which 1 ms to minimize.
[2023-03-21 16:40:49] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 1 ms to minimize.
[2023-03-21 16:40:50] [INFO ] Deduced a trap composed of 16 places in 368 ms of which 3 ms to minimize.
[2023-03-21 16:40:50] [INFO ] Deduced a trap composed of 12 places in 337 ms of which 1 ms to minimize.
[2023-03-21 16:40:50] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 1 ms to minimize.
[2023-03-21 16:40:51] [INFO ] Deduced a trap composed of 29 places in 413 ms of which 1 ms to minimize.
[2023-03-21 16:40:51] [INFO ] Deduced a trap composed of 12 places in 393 ms of which 1 ms to minimize.
[2023-03-21 16:40:52] [INFO ] Deduced a trap composed of 14 places in 372 ms of which 0 ms to minimize.
[2023-03-21 16:40:52] [INFO ] Deduced a trap composed of 14 places in 398 ms of which 2 ms to minimize.
[2023-03-21 16:40:53] [INFO ] Deduced a trap composed of 14 places in 411 ms of which 1 ms to minimize.
[2023-03-21 16:40:53] [INFO ] Deduced a trap composed of 13 places in 399 ms of which 1 ms to minimize.
[2023-03-21 16:40:54] [INFO ] Deduced a trap composed of 10 places in 411 ms of which 2 ms to minimize.
[2023-03-21 16:40:54] [INFO ] Deduced a trap composed of 19 places in 409 ms of which 1 ms to minimize.
[2023-03-21 16:40:55] [INFO ] Deduced a trap composed of 9 places in 403 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-21 16:40:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 16:40:55] [INFO ] After 25227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 8 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 460 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 461 ms. Remains : 1893/2127 places, 1668/1674 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 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 396342 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 396342 steps, saw 87081 distinct states, run finished after 3005 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1668 rows 1893 cols
[2023-03-21 16:41:00] [INFO ] Computed 833 place invariants in 1338 ms
[2023-03-21 16:41:00] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:41:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-21 16:41:01] [INFO ] [Nat]Absence check using 3 positive and 830 generalized place invariants in 769 ms returned sat
[2023-03-21 16:41:02] [INFO ] After 915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 16:41:02] [INFO ] After 1097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-21 16:41:03] [INFO ] After 2349ms 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 74 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 74 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 65 ms. Remains 1893 /1893 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
[2023-03-21 16:41:03] [INFO ] Invariant cache hit.
[2023-03-21 16:41:07] [INFO ] Implicit Places using invariants in 4019 ms returned [2, 55, 1838, 1891]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4027 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 64 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 4158 ms. Remains : 1889/1893 places, 1668/1668 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 426226 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 426226 steps, saw 91462 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1668 rows 1889 cols
[2023-03-21 16:41:12] [INFO ] Computed 829 place invariants in 1909 ms
[2023-03-21 16:41:12] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:41:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 81 ms returned sat
[2023-03-21 16:41:15] [INFO ] [Nat]Absence check using 3 positive and 826 generalized place invariants in 2632 ms returned sat
[2023-03-21 16:41:16] [INFO ] After 1104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 16:41:17] [INFO ] After 1320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 171 ms.
[2023-03-21 16:41:17] [INFO ] After 4632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 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 69 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 69 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 60 ms. Remains 1889 /1889 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
[2023-03-21 16:41:17] [INFO ] Invariant cache hit.
[2023-03-21 16:41:22] [INFO ] Implicit Places using invariants in 5426 ms returned []
[2023-03-21 16:41:22] [INFO ] Invariant cache hit.
[2023-03-21 16:41:28] [INFO ] Implicit Places using invariants and state equation in 5749 ms returned []
Implicit Place search using SMT with State Equation took 11179 ms to find 0 implicit places.
[2023-03-21 16:41:28] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-21 16:41:28] [INFO ] Invariant cache hit.
[2023-03-21 16:41:32] [INFO ] Dead Transitions using invariants and state equation in 4061 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15397 ms. Remains : 1889/1889 places, 1668/1668 transitions.
Applied a total of 0 rules in 69 ms. Remains 1889 /1889 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 16:41:32] [INFO ] Invariant cache hit.
[2023-03-21 16:41:33] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:41:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2023-03-21 16:41:36] [INFO ] [Nat]Absence check using 3 positive and 826 generalized place invariants in 2885 ms returned sat
[2023-03-21 16:41:38] [INFO ] After 1570ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 16:41:38] [INFO ] After 1818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-21 16:41:38] [INFO ] After 5352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 16:41:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-21 16:41:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1889 places, 1668 transitions and 8804 arcs took 13 ms.
[2023-03-21 16:41:38] [INFO ] Flatten gal took : 222 ms
Total runtime 70341 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Echo (PT), instance d02r15
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1889 places, 1668 transitions, 8804 arcs.
Final Score: 182183.871
Took : 83 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Echo-PT-d02r15-ReachabilityCardinality-12 (reachable & potential(( ( ( ( (tk(P278)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P278)) ) ) & ( ( (tk(P1787)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1787)) ) ) ) & ( ( ( (tk(P204)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P204)) ) ) & ( ( ( ( ( (tk(P116)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P116)) ) ) & ( ( (tk(P126)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P126)) ) ) ) | ( ( ( (tk(P1039)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1039)) ) ) & ( ( (tk(P547)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P547)) ) ) ) ) & ( ( ( (tk(P133)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P133)) ) ) | ( ( ( (tk(P1439)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1439)) ) ) | ( ( ( (tk(P1389)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1389)) ) ) & ( ( (tk(P656)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P656)) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5353256 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103416 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
Caught signal 15, terminating.

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="smartxred"
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 smartxred"
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 r171-tall-167838858000070"
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 '' 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 ;