fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r248-tall-167856435400473
Last Updated
May 14, 2023

About the Execution of Marcie+red for MultiCrashLeafsetExtension-PT-S16C03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
951.531 311405.00 375077.00 871.50 T normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r248-tall-167856435400473.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is MultiCrashLeafsetExtension-PT-S16C03, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r248-tall-167856435400473
=====================================================================

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:52:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-13 17:52:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:52:18] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2023-03-13 17:52:18] [INFO ] Transformed 3606 places.
[2023-03-13 17:52:18] [INFO ] Transformed 5141 transitions.
[2023-03-13 17:52:19] [INFO ] Parsed PT model containing 3606 places and 5141 transitions and 20838 arcs in 498 ms.
Incomplete random walk after 10000 steps, including 315 resets, run finished after 1416 ms. (steps per millisecond=7 ) properties (out of 3606) seen :2221
Running SMT prover for 1385 properties.
[2023-03-13 17:52:20] [INFO ] Flow matrix only has 4869 transitions (discarded 272 similar events)
// Phase 1: matrix 4869 rows 3606 cols
[2023-03-13 17:52:20] [INFO ] Computed 459 place invariants in 215 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 17:52:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:52:46] [INFO ] After 25097ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 1385 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1385 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.16 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 0 with 483 rules applied. Total rules applied 484 place count 3580 transition count 4658
Reduce places removed 483 places and 0 transitions.
Iterating post reduction 1 with 483 rules applied. Total rules applied 967 place count 3097 transition count 4658
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 967 place count 3097 transition count 4562
Deduced a syphon composed of 96 places in 7 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 1159 place count 3001 transition count 4562
Discarding 387 places :
Symmetric choice reduction at 2 with 387 rule applications. Total rules 1546 place count 2614 transition count 4175
Iterating global reduction 2 with 387 rules applied. Total rules applied 1933 place count 2614 transition count 4175
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1945 place count 2602 transition count 4139
Iterating global reduction 2 with 12 rules applied. Total rules applied 1957 place count 2602 transition count 4139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1961 place count 2600 transition count 4137
Free-agglomeration rule (complex) applied 271 times.
Iterating global reduction 2 with 271 rules applied. Total rules applied 2232 place count 2600 transition count 3890
Reduce places removed 271 places and 0 transitions.
Iterating post reduction 2 with 271 rules applied. Total rules applied 2503 place count 2329 transition count 3890
Partial Free-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 3 with 96 rules applied. Total rules applied 2599 place count 2329 transition count 3890
Applied a total of 2599 rules in 964 ms. Remains 2329 /3606 variables (removed 1277) and now considering 3890/5141 (removed 1251) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 965 ms. Remains : 2329/3606 places, 3890/5141 transitions.
Interrupted random walk after 478872 steps, including 23158 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 766
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 619) 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 619) 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 619) 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 619) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) 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 619) seen :0
Running SMT prover for 619 properties.
[2023-03-13 17:53:18] [INFO ] Flow matrix only has 3601 transitions (discarded 289 similar events)
// Phase 1: matrix 3601 rows 2329 cols
[2023-03-13 17:53:18] [INFO ] Computed 433 place invariants in 75 ms
[2023-03-13 17:53:41] [INFO ] After 23326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:619
[2023-03-13 17:54:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 54 ms returned sat
[2023-03-13 17:54:01] [INFO ] [Nat]Absence check using 33 positive and 400 generalized place invariants in 96 ms returned sat
[2023-03-13 17:55:24] [INFO ] After 61192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :619
[2023-03-13 17:55:24] [INFO ] State equation strengthened by 1362 read => feed constraints.
[2023-03-13 17:56:14] [INFO ] After 50669ms SMT Verify possible using 1362 Read/Feed constraints in natural domain returned unsat :510 sat :109
[2023-03-13 17:56:16] [INFO ] Deduced a trap composed of 515 places in 1548 ms of which 11 ms to minimize.
[2023-03-13 17:56:18] [INFO ] Deduced a trap composed of 446 places in 1743 ms of which 3 ms to minimize.
[2023-03-13 17:56:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3623 ms
[2023-03-13 17:56:21] [INFO ] Deduced a trap composed of 301 places in 1739 ms of which 3 ms to minimize.
[2023-03-13 17:56:22] [INFO ] Deduced a trap composed of 388 places in 1505 ms of which 3 ms to minimize.
[2023-03-13 17:56:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3569 ms
[2023-03-13 17:56:26] [INFO ] Deduced a trap composed of 433 places in 1688 ms of which 2 ms to minimize.
[2023-03-13 17:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1901 ms
[2023-03-13 17:56:29] [INFO ] Deduced a trap composed of 441 places in 1687 ms of which 2 ms to minimize.
[2023-03-13 17:56:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1904 ms
[2023-03-13 17:56:34] [INFO ] Deduced a trap composed of 306 places in 1646 ms of which 2 ms to minimize.
[2023-03-13 17:56:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1864 ms
[2023-03-13 17:56:39] [INFO ] Deduced a trap composed of 419 places in 1469 ms of which 2 ms to minimize.
[2023-03-13 17:56:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1686 ms
[2023-03-13 17:56:42] [INFO ] Deduced a trap composed of 269 places in 1751 ms of which 2 ms to minimize.
[2023-03-13 17:56:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1971 ms
[2023-03-13 17:56:44] [INFO ] Deduced a trap composed of 418 places in 1667 ms of which 2 ms to minimize.
[2023-03-13 17:56:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1962 ms
[2023-03-13 17:56:47] [INFO ] Deduced a trap composed of 277 places in 1663 ms of which 2 ms to minimize.
[2023-03-13 17:56:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1884 ms
[2023-03-13 17:56:49] [INFO ] Deduced a trap composed of 458 places in 1725 ms of which 2 ms to minimize.
[2023-03-13 17:56:51] [INFO ] Deduced a trap composed of 463 places in 1697 ms of which 2 ms to minimize.
[2023-03-13 17:56:52] [INFO ] Deduced a trap composed of 409 places in 1470 ms of which 2 ms to minimize.
[2023-03-13 17:56:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5350 ms
[2023-03-13 17:56:54] [INFO ] Deduced a trap composed of 281 places in 1747 ms of which 3 ms to minimize.
[2023-03-13 17:56:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1968 ms
[2023-03-13 17:56:57] [INFO ] Deduced a trap composed of 234 places in 1700 ms of which 2 ms to minimize.
[2023-03-13 17:56:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2090 ms
[2023-03-13 17:57:00] [INFO ] Deduced a trap composed of 517 places in 1684 ms of which 2 ms to minimize.
[2023-03-13 17:57:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1899 ms
[2023-03-13 17:57:02] [INFO ] Deduced a trap composed of 360 places in 1651 ms of which 2 ms to minimize.
[2023-03-13 17:57:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1861 ms
[2023-03-13 17:57:06] [INFO ] Deduced a trap composed of 325 places in 1720 ms of which 3 ms to minimize.
[2023-03-13 17:57:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1938 ms
[2023-03-13 17:57:09] [INFO ] Deduced a trap composed of 296 places in 1727 ms of which 2 ms to minimize.
[2023-03-13 17:57:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1949 ms
[2023-03-13 17:57:11] [INFO ] Deduced a trap composed of 279 places in 1681 ms of which 2 ms to minimize.
[2023-03-13 17:57:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1895 ms
[2023-03-13 17:57:13] [INFO ] Deduced a trap composed of 258 places in 1667 ms of which 2 ms to minimize.
[2023-03-13 17:57:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1877 ms
[2023-03-13 17:57:15] [INFO ] Deduced a trap composed of 256 places in 1634 ms of which 2 ms to minimize.
[2023-03-13 17:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1871 ms
[2023-03-13 17:57:17] [INFO ] Deduced a trap composed of 309 places in 1622 ms of which 2 ms to minimize.
[2023-03-13 17:57:19] [INFO ] Deduced a trap composed of 328 places in 1624 ms of which 2 ms to minimize.
[2023-03-13 17:57:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3583 ms
[2023-03-13 17:57:21] [INFO ] Deduced a trap composed of 317 places in 1648 ms of which 2 ms to minimize.
[2023-03-13 17:57:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1863 ms
[2023-03-13 17:57:25] [INFO ] Deduced a trap composed of 345 places in 1674 ms of which 2 ms to minimize.
[2023-03-13 17:57:27] [INFO ] Deduced a trap composed of 350 places in 1660 ms of which 2 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 17:57:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:57:27] [INFO ] After 225667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:619
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Total runtime 309107 ms.
ITS solved all properties within timeout

BK_STOP 1678730248623

--------------------
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="marciexred"
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 marciexred"
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 r248-tall-167856435400473"
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 ;