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-167838858000071.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858000071
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-01
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-02
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-03
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-04
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-05
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-06
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-07
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-08
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-09
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-10
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-11
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-12
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-13
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-14
FORMULA_NAME Echo-PT-d02r15-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679416923812

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=ReachabilityFireability
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:42:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 16:42:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:42:05] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-03-21 16:42:05] [INFO ] Transformed 2127 places.
[2023-03-21 16:42:05] [INFO ] Transformed 1674 transitions.
[2023-03-21 16:42:05] [INFO ] Found NUPN structural information;
[2023-03-21 16:42:05] [INFO ] Parsed PT model containing 2127 places and 1674 transitions and 9700 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 22 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 16) seen :12
FORMULA Echo-PT-d02r15-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r15-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :1
FORMULA Echo-PT-d02r15-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :1
FORMULA Echo-PT-d02r15-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :1
FORMULA Echo-PT-d02r15-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 1674 rows 2127 cols
[2023-03-21 16:42:06] [INFO ] Computed 1065 place invariants in 157 ms
[2023-03-21 16:42:07] [INFO ] After 565ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:42:07] [INFO ] [Nat]Absence check using 82 positive place invariants in 51 ms returned sat
[2023-03-21 16:42:07] [INFO ] [Nat]Absence check using 82 positive and 983 generalized place invariants in 340 ms returned sat
[2023-03-21 16:42:09] [INFO ] After 1174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 16:42:09] [INFO ] Deduced a trap composed of 15 places in 566 ms of which 7 ms to minimize.
[2023-03-21 16:42:10] [INFO ] Deduced a trap composed of 12 places in 512 ms of which 1 ms to minimize.
[2023-03-21 16:42:11] [INFO ] Deduced a trap composed of 12 places in 501 ms of which 2 ms to minimize.
[2023-03-21 16:42:11] [INFO ] Deduced a trap composed of 11 places in 492 ms of which 1 ms to minimize.
[2023-03-21 16:42:12] [INFO ] Deduced a trap composed of 10 places in 495 ms of which 1 ms to minimize.
[2023-03-21 16:42:13] [INFO ] Deduced a trap composed of 17 places in 526 ms of which 1 ms to minimize.
[2023-03-21 16:42:13] [INFO ] Deduced a trap composed of 14 places in 531 ms of which 1 ms to minimize.
[2023-03-21 16:42:14] [INFO ] Deduced a trap composed of 14 places in 495 ms of which 2 ms to minimize.
[2023-03-21 16:42:14] [INFO ] Deduced a trap composed of 11 places in 484 ms of which 1 ms to minimize.
[2023-03-21 16:42:15] [INFO ] Deduced a trap composed of 17 places in 475 ms of which 1 ms to minimize.
[2023-03-21 16:42:16] [INFO ] Deduced a trap composed of 11 places in 502 ms of which 1 ms to minimize.
[2023-03-21 16:42:16] [INFO ] Deduced a trap composed of 19 places in 510 ms of which 1 ms to minimize.
[2023-03-21 16:42:17] [INFO ] Deduced a trap composed of 27 places in 488 ms of which 1 ms to minimize.
[2023-03-21 16:42:18] [INFO ] Deduced a trap composed of 17 places in 510 ms of which 1 ms to minimize.
[2023-03-21 16:42:18] [INFO ] Deduced a trap composed of 20 places in 501 ms of which 1 ms to minimize.
[2023-03-21 16:42:19] [INFO ] Deduced a trap composed of 28 places in 500 ms of which 2 ms to minimize.
[2023-03-21 16:42:20] [INFO ] Deduced a trap composed of 31 places in 495 ms of which 1 ms to minimize.
[2023-03-21 16:42:20] [INFO ] Deduced a trap composed of 21 places in 494 ms of which 1 ms to minimize.
[2023-03-21 16:42:21] [INFO ] Deduced a trap composed of 15 places in 446 ms of which 1 ms to minimize.
[2023-03-21 16:42:22] [INFO ] Deduced a trap composed of 10 places in 447 ms of which 1 ms to minimize.
[2023-03-21 16:42:22] [INFO ] Deduced a trap composed of 10 places in 457 ms of which 2 ms to minimize.
[2023-03-21 16:42:23] [INFO ] Deduced a trap composed of 20 places in 432 ms of which 1 ms to minimize.
[2023-03-21 16:42:23] [INFO ] Deduced a trap composed of 15 places in 437 ms of which 1 ms to minimize.
[2023-03-21 16:42:24] [INFO ] Deduced a trap composed of 19 places in 434 ms of which 2 ms to minimize.
[2023-03-21 16:42:24] [INFO ] Deduced a trap composed of 13 places in 436 ms of which 1 ms to minimize.
[2023-03-21 16:42:25] [INFO ] Deduced a trap composed of 10 places in 448 ms of which 1 ms to minimize.
[2023-03-21 16:42:25] [INFO ] Deduced a trap composed of 12 places in 438 ms of which 1 ms to minimize.
[2023-03-21 16:42:26] [INFO ] Deduced a trap composed of 10 places in 451 ms of which 1 ms to minimize.
[2023-03-21 16:42:27] [INFO ] Deduced a trap composed of 15 places in 466 ms of which 1 ms to minimize.
[2023-03-21 16:42:27] [INFO ] Deduced a trap composed of 12 places in 418 ms of which 1 ms to minimize.
[2023-03-21 16:42:28] [INFO ] Deduced a trap composed of 10 places in 431 ms of which 1 ms to minimize.
[2023-03-21 16:42:28] [INFO ] Deduced a trap composed of 18 places in 464 ms of which 2 ms to minimize.
[2023-03-21 16:42:29] [INFO ] Deduced a trap composed of 20 places in 443 ms of which 1 ms to minimize.
[2023-03-21 16:42:29] [INFO ] Deduced a trap composed of 12 places in 456 ms of which 2 ms to minimize.
[2023-03-21 16:42:30] [INFO ] Deduced a trap composed of 21 places in 448 ms of which 1 ms to minimize.
[2023-03-21 16:42:31] [INFO ] Deduced a trap composed of 11 places in 411 ms of which 1 ms to minimize.
[2023-03-21 16:42:31] [INFO ] Deduced a trap composed of 29 places in 424 ms of which 1 ms to minimize.
[2023-03-21 16:42:32] [INFO ] Deduced a trap composed of 19 places in 429 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:42:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 16:42:32] [INFO ] After 25174ms 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 58 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 1893 are kept as prefixes of interest. Removing 234 places using SCC suffix rule.9 ms
Discarding 234 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 1893 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 1892 transition count 1668
Applied a total of 6 rules in 324 ms. Remains 1892 /2127 variables (removed 235) and now considering 1668/1674 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 1892/2127 places, 1668/1674 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 452961 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 452961 steps, saw 94940 distinct states, run finished after 3003 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1668 rows 1892 cols
[2023-03-21 16:42:37] [INFO ] Computed 832 place invariants in 1819 ms
[2023-03-21 16:42:37] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:42:40] [INFO ] [Nat]Absence check using 0 positive and 832 generalized place invariants in 2210 ms returned sat
[2023-03-21 16:42:42] [INFO ] After 1561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 16:42:42] [INFO ] After 2059ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 522 ms.
[2023-03-21 16:42:43] [INFO ] After 5232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 58 out of 1892 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1892/1892 places, 1668/1668 transitions.
Applied a total of 0 rules in 76 ms. Remains 1892 /1892 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1892/1892 places, 1668/1668 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1892/1892 places, 1668/1668 transitions.
Applied a total of 0 rules in 69 ms. Remains 1892 /1892 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
[2023-03-21 16:42:43] [INFO ] Invariant cache hit.
[2023-03-21 16:42:48] [INFO ] Implicit Places using invariants in 5150 ms returned [2, 55, 1837, 1890]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 5156 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1888/1892 places, 1668/1668 transitions.
Applied a total of 0 rules in 69 ms. Remains 1888 /1888 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5296 ms. Remains : 1888/1892 places, 1668/1668 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 471286 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 471286 steps, saw 97868 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1668 rows 1888 cols
[2023-03-21 16:42:52] [INFO ] Invariants computation overflowed in 1023 ms
[2023-03-21 16:42:53] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:42:54] [INFO ] After 988ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 16:42:54] [INFO ] After 1277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 231 ms.
[2023-03-21 16:42:54] [INFO ] After 1809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 58 out of 1888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1888/1888 places, 1668/1668 transitions.
Applied a total of 0 rules in 76 ms. Remains 1888 /1888 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1888/1888 places, 1668/1668 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1888/1888 places, 1668/1668 transitions.
Applied a total of 0 rules in 56 ms. Remains 1888 /1888 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
// Phase 1: matrix 1668 rows 1888 cols
[2023-03-21 16:42:56] [INFO ] Invariants computation overflowed in 1076 ms
[2023-03-21 16:42:57] [INFO ] Implicit Places using invariants in 2074 ms returned []
// Phase 1: matrix 1668 rows 1888 cols
[2023-03-21 16:42:58] [INFO ] Invariants computation overflowed in 1008 ms
[2023-03-21 16:42:59] [INFO ] Implicit Places using invariants and state equation in 2510 ms returned []
Implicit Place search using SMT with State Equation took 4587 ms to find 0 implicit places.
[2023-03-21 16:42:59] [INFO ] Redundant transitions in 95 ms returned []
// Phase 1: matrix 1668 rows 1888 cols
[2023-03-21 16:43:00] [INFO ] Invariants computation overflowed in 1014 ms
[2023-03-21 16:43:01] [INFO ] Dead Transitions using invariants and state equation in 1837 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6588 ms. Remains : 1888/1888 places, 1668/1668 transitions.
Applied a total of 0 rules in 56 ms. Remains 1888 /1888 variables (removed 0) and now considering 1668/1668 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1668 rows 1888 cols
[2023-03-21 16:43:02] [INFO ] Invariants computation overflowed in 1010 ms
[2023-03-21 16:43:02] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:43:04] [INFO ] After 995ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 16:43:04] [INFO ] After 1288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-21 16:43:04] [INFO ] After 1818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 16:43:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-21 16:43:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1888 places, 1668 transitions and 8800 arcs took 12 ms.
[2023-03-21 16:43:05] [INFO ] Flatten gal took : 205 ms
Total runtime 59968 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 ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1888 places, 1668 transitions, 8800 arcs.
Final Score: 180860.551
Took : 81 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679417068427

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 12586:
syntax error

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="ReachabilityFireability"
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 ReachabilityFireability"
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-167838858000071"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;