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.r249-tall-167856436200473.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 MultiCrashLeafsetExtension-PT-S16C03, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r249-tall-167856436200473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 12K Feb 26 02:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 02:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 02:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 02:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 02:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 02:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 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 3.5M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678737610658

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C03
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 20:00:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-13 20:00:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:00:12] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2023-03-13 20:00:12] [INFO ] Transformed 3606 places.
[2023-03-13 20:00:12] [INFO ] Transformed 5141 transitions.
[2023-03-13 20:00:12] [INFO ] Parsed PT model containing 3606 places and 5141 transitions and 20838 arcs in 299 ms.
Incomplete random walk after 10000 steps, including 318 resets, run finished after 1475 ms. (steps per millisecond=6 ) properties (out of 3606) seen :2206
Running SMT prover for 1400 properties.
[2023-03-13 20:00:14] [INFO ] Flow matrix only has 4869 transitions (discarded 272 similar events)
// Phase 1: matrix 4869 rows 3606 cols
[2023-03-13 20:00:14] [INFO ] Computed 459 place invariants in 202 ms
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.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-13 20:00:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 20:00:40] [INFO ] After 25078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 1400 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1400 out of 3606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3606/3606 places, 5141/5141 transitions.
Graph (complete) has 12103 edges and 3606 vertex of which 3580 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.14 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 474 transitions
Trivial Post-agglo rules discarded 474 transitions
Performed 474 trivial Post agglomeration. Transition count delta: 474
Iterating post reduction 0 with 474 rules applied. Total rules applied 475 place count 3580 transition count 4667
Reduce places removed 474 places and 0 transitions.
Iterating post reduction 1 with 474 rules applied. Total rules applied 949 place count 3106 transition count 4667
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 949 place count 3106 transition count 4569
Deduced a syphon composed of 98 places in 6 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 1145 place count 3008 transition count 4569
Discarding 376 places :
Symmetric choice reduction at 2 with 376 rule applications. Total rules 1521 place count 2632 transition count 4193
Iterating global reduction 2 with 376 rules applied. Total rules applied 1897 place count 2632 transition count 4193
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1904 place count 2625 transition count 4172
Iterating global reduction 2 with 7 rules applied. Total rules applied 1911 place count 2625 transition count 4172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1915 place count 2623 transition count 4170
Free-agglomeration rule (complex) applied 273 times.
Iterating global reduction 2 with 273 rules applied. Total rules applied 2188 place count 2623 transition count 3911
Reduce places removed 273 places and 0 transitions.
Iterating post reduction 2 with 273 rules applied. Total rules applied 2461 place count 2350 transition count 3911
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 3 with 98 rules applied. Total rules applied 2559 place count 2350 transition count 3911
Applied a total of 2559 rules in 854 ms. Remains 2350 /3606 variables (removed 1256) and now considering 3911/5141 (removed 1230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 855 ms. Remains : 2350/3606 places, 3911/5141 transitions.
Interrupted random walk after 471784 steps, including 22774 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 776
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 624) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 624) seen :0
Running SMT prover for 624 properties.
[2023-03-13 20:01:11] [INFO ] Flow matrix only has 3625 transitions (discarded 286 similar events)
// Phase 1: matrix 3625 rows 2350 cols
[2023-03-13 20:01:11] [INFO ] Computed 433 place invariants in 83 ms
[2023-03-13 20:01:36] [INFO ] After 24260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:624
[2023-03-13 20:01:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 41 ms returned sat
[2023-03-13 20:01:56] [INFO ] [Nat]Absence check using 31 positive and 402 generalized place invariants in 100 ms returned sat
[2023-03-13 20:03:18] [INFO ] After 60601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :624
[2023-03-13 20:03:18] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-13 20:04:17] [INFO ] After 59363ms SMT Verify possible using 1362 Read/Feed constraints in natural domain returned unsat :510 sat :114
[2023-03-13 20:04:19] [INFO ] Deduced a trap composed of 635 places in 1565 ms of which 8 ms to minimize.
[2023-03-13 20:04:21] [INFO ] Deduced a trap composed of 358 places in 1680 ms of which 3 ms to minimize.
[2023-03-13 20:04:23] [INFO ] Deduced a trap composed of 373 places in 1725 ms of which 2 ms to minimize.
[2023-03-13 20:04:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5385 ms
[2023-03-13 20:04:26] [INFO ] Deduced a trap composed of 359 places in 1509 ms of which 3 ms to minimize.
[2023-03-13 20:04:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1720 ms
[2023-03-13 20:04:28] [INFO ] Deduced a trap composed of 291 places in 1713 ms of which 5 ms to minimize.
[2023-03-13 20:04:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1926 ms
[2023-03-13 20:04:32] [INFO ] Deduced a trap composed of 393 places in 1529 ms of which 2 ms to minimize.
[2023-03-13 20:04:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1740 ms
[2023-03-13 20:04:36] [INFO ] Deduced a trap composed of 297 places in 1734 ms of which 2 ms to minimize.
[2023-03-13 20:04:38] [INFO ] Deduced a trap composed of 365 places in 1560 ms of which 2 ms to minimize.
[2023-03-13 20:04:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3626 ms
[2023-03-13 20:04:41] [INFO ] Deduced a trap composed of 311 places in 1738 ms of which 2 ms to minimize.
[2023-03-13 20:04:43] [INFO ] Deduced a trap composed of 414 places in 1513 ms of which 2 ms to minimize.
[2023-03-13 20:04:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3593 ms
[2023-03-13 20:04:48] [INFO ] Deduced a trap composed of 351 places in 1708 ms of which 2 ms to minimize.
[2023-03-13 20:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1921 ms
[2023-03-13 20:04:50] [INFO ] Deduced a trap composed of 401 places in 1529 ms of which 2 ms to minimize.
[2023-03-13 20:04:52] [INFO ] Deduced a trap composed of 222 places in 1724 ms of which 2 ms to minimize.
[2023-03-13 20:04:54] [INFO ] Deduced a trap composed of 333 places in 1590 ms of which 2 ms to minimize.
[2023-03-13 20:04:56] [INFO ] Deduced a trap composed of 300 places in 1696 ms of which 2 ms to minimize.
[2023-03-13 20:04:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7449 ms
[2023-03-13 20:04:59] [INFO ] Deduced a trap composed of 456 places in 1616 ms of which 3 ms to minimize.
[2023-03-13 20:05:01] [INFO ] Deduced a trap composed of 430 places in 1662 ms of which 2 ms to minimize.
[2023-03-13 20:05:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3609 ms
[2023-03-13 20:05:05] [INFO ] Deduced a trap composed of 309 places in 1730 ms of which 2 ms to minimize.
[2023-03-13 20:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1940 ms
[2023-03-13 20:05:07] [INFO ] Deduced a trap composed of 300 places in 1657 ms of which 2 ms to minimize.
[2023-03-13 20:05:09] [INFO ] Deduced a trap composed of 301 places in 1658 ms of which 2 ms to minimize.
[2023-03-13 20:05:11] [INFO ] Deduced a trap composed of 424 places in 1476 ms of which 3 ms to minimize.
[2023-03-13 20:05:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5308 ms
[2023-03-13 20:05:13] [INFO ] Deduced a trap composed of 302 places in 1666 ms of which 2 ms to minimize.
[2023-03-13 20:05:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1875 ms
[2023-03-13 20:05:16] [INFO ] Deduced a trap composed of 407 places in 1494 ms of which 2 ms to minimize.
[2023-03-13 20:05:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1700 ms
[2023-03-13 20:05:21] [INFO ] Deduced a trap composed of 504 places in 1667 ms of which 2 ms to minimize.
[2023-03-13 20:05:23] [INFO ] Deduced a trap composed of 333 places in 1679 ms of which 3 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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-13 20:05:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 20:05:23] [INFO ] After 226583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:624
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Total runtime 310721 ms.
ITS solved all properties within timeout

BK_STOP 1678737923959

--------------------
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 StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C03"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 MultiCrashLeafsetExtension-PT-S16C03, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r249-tall-167856436200473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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