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

About the Execution of LTSMin+red for Dekker-PT-200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4217.584 3600000.00 10665568.00 3761.60 FTF?T?TTTTTT?F?? 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.r137-smll-167819417200046.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Dekker-PT-200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819417200046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 8.1K Feb 26 04:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 04:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 02:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 06:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 06:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 05:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 26 05:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25M 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 Dekker-PT-200-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678549612491

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-200
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 15:46:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 15:46:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 15:46:56] [INFO ] Load time of PNML (sax parser for PT used): 1691 ms
[2023-03-11 15:46:56] [INFO ] Transformed 1000 places.
[2023-03-11 15:46:57] [INFO ] Transformed 40400 transitions.
[2023-03-11 15:46:57] [INFO ] Found NUPN structural information;
[2023-03-11 15:46:57] [INFO ] Parsed PT model containing 1000 places and 40400 transitions and 320400 arcs in 2012 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-200-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1466 ms. (steps per millisecond=6 ) properties (out of 10) seen :4
FORMULA Dekker-PT-200-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 15:46:59] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2023-03-11 15:46:59] [INFO ] Computed 600 place invariants in 61 ms
[2023-03-11 15:47:00] [INFO ] After 741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 15:47:01] [INFO ] [Nat]Absence check using 400 positive place invariants in 130 ms returned sat
[2023-03-11 15:47:01] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 62 ms returned sat
[2023-03-11 15:47:02] [INFO ] After 1147ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-11 15:47:02] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-11 15:47:03] [INFO ] After 751ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-11 15:47:06] [INFO ] Deduced a trap composed of 4 places in 2474 ms of which 10 ms to minimize.
[2023-03-11 15:47:09] [INFO ] Deduced a trap composed of 4 places in 2665 ms of which 1 ms to minimize.
[2023-03-11 15:47:11] [INFO ] Deduced a trap composed of 4 places in 2353 ms of which 2 ms to minimize.
[2023-03-11 15:47:13] [INFO ] Deduced a trap composed of 4 places in 2297 ms of which 2 ms to minimize.
[2023-03-11 15:47:16] [INFO ] Deduced a trap composed of 4 places in 2233 ms of which 3 ms to minimize.
[2023-03-11 15:47:18] [INFO ] Deduced a trap composed of 4 places in 2293 ms of which 1 ms to minimize.
[2023-03-11 15:47:20] [INFO ] Deduced a trap composed of 4 places in 2285 ms of which 1 ms to minimize.
[2023-03-11 15:47:23] [INFO ] Deduced a trap composed of 4 places in 2276 ms of which 1 ms to minimize.
[2023-03-11 15:47:25] [INFO ] Deduced a trap composed of 4 places in 2222 ms of which 1 ms to minimize.
[2023-03-11 15:47:27] [INFO ] Deduced a trap composed of 4 places in 2211 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-11 15:47:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 15:47:27] [INFO ] After 26867ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA Dekker-PT-200-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 80 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 2568 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2585 ms. Remains : 1000/1000 places, 40400/40400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1072 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 66933 steps, run timeout after 3006 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66933 steps, saw 64830 distinct states, run finished after 3008 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-11 15:47:34] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2023-03-11 15:47:34] [INFO ] Invariant cache hit.
[2023-03-11 15:47:35] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 15:47:35] [INFO ] [Nat]Absence check using 400 positive place invariants in 116 ms returned sat
[2023-03-11 15:47:35] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 61 ms returned sat
[2023-03-11 15:47:37] [INFO ] After 1191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 15:47:37] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-11 15:47:38] [INFO ] After 755ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 15:47:40] [INFO ] Deduced a trap composed of 4 places in 2312 ms of which 1 ms to minimize.
[2023-03-11 15:47:42] [INFO ] Deduced a trap composed of 4 places in 2237 ms of which 12 ms to minimize.
[2023-03-11 15:47:45] [INFO ] Deduced a trap composed of 6 places in 2197 ms of which 1 ms to minimize.
[2023-03-11 15:47:47] [INFO ] Deduced a trap composed of 4 places in 2150 ms of which 1 ms to minimize.
[2023-03-11 15:47:49] [INFO ] Deduced a trap composed of 4 places in 2204 ms of which 1 ms to minimize.
[2023-03-11 15:47:51] [INFO ] Deduced a trap composed of 4 places in 2073 ms of which 1 ms to minimize.
[2023-03-11 15:47:53] [INFO ] Deduced a trap composed of 4 places in 2110 ms of which 1 ms to minimize.
[2023-03-11 15:47:56] [INFO ] Deduced a trap composed of 4 places in 2066 ms of which 1 ms to minimize.
[2023-03-11 15:47:58] [INFO ] Deduced a trap composed of 6 places in 2072 ms of which 1 ms to minimize.
[2023-03-11 15:48:00] [INFO ] Deduced a trap composed of 4 places in 2019 ms of which 1 ms to minimize.
[2023-03-11 15:48:02] [INFO ] Deduced a trap composed of 4 places in 2115 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-11 15:48:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 15:48:02] [INFO ] After 27038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 80 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1555 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1555 ms. Remains : 1000/1000 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1734 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2023-03-11 15:48:05] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2023-03-11 15:48:05] [INFO ] Invariant cache hit.
[2023-03-11 15:48:36] [INFO ] Performed 609/1000 implicitness test of which 62 returned IMPLICIT in 30 seconds.
[2023-03-11 15:48:38] [INFO ] Implicit Places using invariants in 32699 ms returned [400, 406, 409, 412, 415, 421, 424, 427, 430, 433, 436, 439, 442, 445, 448, 451, 454, 457, 460, 463, 466, 469, 472, 475, 478, 484, 487, 490, 493, 496, 499, 502, 505, 508, 511, 514, 520, 523, 526, 529, 532, 535, 541, 544, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 754, 757, 763, 766, 769, 772, 775, 778, 781, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 838, 844, 847, 850, 853, 859, 862, 865, 868, 871, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 907, 910, 913, 916, 919, 922, 925, 928, 931, 934, 937, 940, 943, 946, 949, 952, 955, 958, 961, 967, 970, 976, 979, 982, 985, 988, 994, 997]
Discarding 184 places :
Implicit Place search using SMT only with invariants took 32746 ms to find 184 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 816/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1734 ms. Remains 816 /816 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36223 ms. Remains : 816/1000 places, 40400/40400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 936 ms. (steps per millisecond=10 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 69747 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69747 steps, saw 67550 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-11 15:48:44] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 816 cols
[2023-03-11 15:48:44] [INFO ] Computed 416 place invariants in 9 ms
[2023-03-11 15:48:44] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 15:48:45] [INFO ] [Nat]Absence check using 400 positive place invariants in 98 ms returned sat
[2023-03-11 15:48:45] [INFO ] [Nat]Absence check using 400 positive and 16 generalized place invariants in 5 ms returned sat
[2023-03-11 15:48:46] [INFO ] After 895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 15:48:46] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-11 15:48:47] [INFO ] After 686ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 15:48:49] [INFO ] Deduced a trap composed of 4 places in 1918 ms of which 2 ms to minimize.
[2023-03-11 15:48:51] [INFO ] Deduced a trap composed of 4 places in 2009 ms of which 1 ms to minimize.
[2023-03-11 15:48:53] [INFO ] Deduced a trap composed of 4 places in 1899 ms of which 1 ms to minimize.
[2023-03-11 15:48:55] [INFO ] Deduced a trap composed of 4 places in 1981 ms of which 1 ms to minimize.
[2023-03-11 15:48:57] [INFO ] Deduced a trap composed of 4 places in 1969 ms of which 1 ms to minimize.
[2023-03-11 15:48:59] [INFO ] Deduced a trap composed of 4 places in 1947 ms of which 1 ms to minimize.
[2023-03-11 15:49:01] [INFO ] Deduced a trap composed of 4 places in 1956 ms of which 1 ms to minimize.
[2023-03-11 15:49:03] [INFO ] Deduced a trap composed of 4 places in 1951 ms of which 1 ms to minimize.
[2023-03-11 15:49:05] [INFO ] Deduced a trap composed of 4 places in 1825 ms of which 1 ms to minimize.
[2023-03-11 15:49:07] [INFO ] Deduced a trap composed of 4 places in 1831 ms of which 1 ms to minimize.
[2023-03-11 15:49:08] [INFO ] Deduced a trap composed of 4 places in 1808 ms of which 1 ms to minimize.
[2023-03-11 15:49:08] [INFO ] Trap strengthening procedure interrupted after too many repetitions 21535 ms
[2023-03-11 15:49:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 21535 ms
[2023-03-11 15:49:10] [INFO ] Deduced a trap composed of 4 places in 1793 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-11 15:49:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 15:49:10] [INFO ] After 25950ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 80 out of 816 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 816/816 places, 40400/40400 transitions.
Applied a total of 0 rules in 1797 ms. Remains 816 /816 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1797 ms. Remains : 816/816 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 816/816 places, 40400/40400 transitions.
Applied a total of 0 rules in 1268 ms. Remains 816 /816 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2023-03-11 15:49:13] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2023-03-11 15:49:13] [INFO ] Invariant cache hit.
[2023-03-11 15:49:23] [INFO ] Implicit Places using invariants in 9243 ms returned []
Implicit Place search using SMT only with invariants took 9252 ms to find 0 implicit places.
[2023-03-11 15:49:23] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2023-03-11 15:49:23] [INFO ] Invariant cache hit.
[2023-03-11 15:49:53] [INFO ] Performed 28732/40400 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-11 15:50:03] [INFO ] Dead Transitions using invariants and state equation in 40142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50672 ms. Remains : 816/816 places, 40400/40400 transitions.
Graph (complete) has 1280 edges and 816 vertex of which 280 are kept as prefixes of interest. Removing 536 places using SCC suffix rule.9 ms
Discarding 536 places :
Also discarding 27068 output transitions
Drop transitions removed 27068 transitions
Ensure Unique test removed 15 places
Ensure Unique test removed 13068 transitions
Reduce isomorphic transitions removed 13068 transitions.
Iterating post reduction 0 with 13083 rules applied. Total rules applied 13084 place count 265 transition count 264
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 45 rules applied. Total rules applied 13129 place count 235 transition count 249
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 13144 place count 235 transition count 234
Free-agglomeration rule applied 33 times.
Iterating global reduction 2 with 33 rules applied. Total rules applied 13177 place count 235 transition count 201
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 99 rules applied. Total rules applied 13276 place count 169 transition count 168
Applied a total of 13276 rules in 662 ms. Remains 169 /816 variables (removed 647) and now considering 168/40400 (removed 40232) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 168 rows 169 cols
[2023-03-11 15:50:04] [INFO ] Computed 85 place invariants in 2 ms
[2023-03-11 15:50:04] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 15:50:04] [INFO ] [Nat]Absence check using 85 positive place invariants in 17 ms returned sat
[2023-03-11 15:50:04] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 15:50:04] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-11 15:50:04] [INFO ] After 433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-11 15:50:04] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-11 15:50:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 816 places, 40400 transitions and 283416 arcs took 217 ms.
[2023-03-11 15:50:07] [INFO ] Flatten gal took : 2277 ms
Total runtime 192830 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/601/inv_0_ --invariant=/tmp/601/inv_1_ --invariant=/tmp/601/inv_2_ --invariant=/tmp/601/inv_3_ --invariant=/tmp/601/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11864740 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16034192 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-200"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Dekker-PT-200, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r137-smll-167819417200046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-200.tgz
mv Dekker-PT-200 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;