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.r009-oct2-167813597500158.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597500158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 920K 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 ASLink-PT-10a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-10a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678618137087

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=ASLink-PT-10a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:48:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 10:48:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:48:59] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2023-03-12 10:48:59] [INFO ] Transformed 2186 places.
[2023-03-12 10:48:59] [INFO ] Transformed 3192 transitions.
[2023-03-12 10:48:59] [INFO ] Found NUPN structural information;
[2023-03-12 10:48:59] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA ASLink-PT-10a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 43 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 13) seen :5
FORMULA ASLink-PT-10a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :1
FORMULA ASLink-PT-10a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 3158 rows 2186 cols
[2023-03-12 10:49:01] [INFO ] Computed 422 place invariants in 158 ms
[2023-03-12 10:49:02] [INFO ] After 1031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 10:49:02] [INFO ] [Nat]Absence check using 105 positive place invariants in 44 ms returned sat
[2023-03-12 10:49:02] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 125 ms returned sat
[2023-03-12 10:49:27] [INFO ] After 23907ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 10:49:27] [INFO ] After 23938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 10:49:27] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 101 out of 2186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 38 places
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions removed 179 transitions
Trivial Post-agglo rules discarded 179 transitions
Performed 179 trivial Post agglomeration. Transition count delta: 179
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 2129 transition count 2979
Reduce places removed 179 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 188 rules applied. Total rules applied 424 place count 1950 transition count 2970
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 433 place count 1941 transition count 2970
Performed 190 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 190 Pre rules applied. Total rules applied 433 place count 1941 transition count 2780
Deduced a syphon composed of 190 places in 5 ms
Ensure Unique test removed 70 places
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 3 with 450 rules applied. Total rules applied 883 place count 1681 transition count 2780
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 884 place count 1681 transition count 2779
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 885 place count 1680 transition count 2779
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 897 place count 1668 transition count 2709
Ensure Unique test removed 1 places
Iterating global reduction 5 with 13 rules applied. Total rules applied 910 place count 1667 transition count 2709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 911 place count 1667 transition count 2708
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 912 place count 1666 transition count 2700
Iterating global reduction 6 with 1 rules applied. Total rules applied 913 place count 1666 transition count 2700
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 914 place count 1665 transition count 2692
Iterating global reduction 6 with 1 rules applied. Total rules applied 915 place count 1665 transition count 2692
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 916 place count 1664 transition count 2684
Iterating global reduction 6 with 1 rules applied. Total rules applied 917 place count 1664 transition count 2684
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 918 place count 1663 transition count 2676
Iterating global reduction 6 with 1 rules applied. Total rules applied 919 place count 1663 transition count 2676
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 1031 place count 1607 transition count 2620
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1033 place count 1606 transition count 2623
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1036 place count 1606 transition count 2620
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1039 place count 1603 transition count 2620
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1047 place count 1603 transition count 2612
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1055 place count 1595 transition count 2612
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 1068 place count 1595 transition count 2612
Applied a total of 1068 rules in 1379 ms. Remains 1595 /2186 variables (removed 591) and now considering 2612/3158 (removed 546) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1380 ms. Remains : 1595/2186 places, 2612/3158 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 74641 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74641 steps, saw 42653 distinct states, run finished after 3004 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2612 rows 1595 cols
[2023-03-12 10:49:32] [INFO ] Computed 294 place invariants in 59 ms
[2023-03-12 10:49:32] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 10:49:33] [INFO ] [Nat]Absence check using 71 positive place invariants in 32 ms returned sat
[2023-03-12 10:49:33] [INFO ] [Nat]Absence check using 71 positive and 223 generalized place invariants in 132 ms returned sat
[2023-03-12 10:49:57] [INFO ] After 23991ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 10:49:57] [INFO ] State equation strengthened by 54 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-12 10:49:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 10:49:57] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 375 ms.
Support contains 101 out of 1595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1595/1595 places, 2612/2612 transitions.
Applied a total of 0 rules in 102 ms. Remains 1595 /1595 variables (removed 0) and now considering 2612/2612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 1595/1595 places, 2612/2612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1595/1595 places, 2612/2612 transitions.
Applied a total of 0 rules in 118 ms. Remains 1595 /1595 variables (removed 0) and now considering 2612/2612 (removed 0) transitions.
[2023-03-12 10:49:58] [INFO ] Invariant cache hit.
[2023-03-12 10:49:59] [INFO ] Implicit Places using invariants in 1360 ms returned [1, 20, 21, 23, 33, 51, 69, 134, 155, 168, 171, 172, 173, 191, 209, 283, 295, 308, 309, 310, 311, 312, 330, 348, 411, 431, 447, 448, 449, 450, 451, 469, 487, 539, 561, 573, 586, 589, 590, 591, 609, 627, 680, 712, 725, 729, 730, 731, 749, 830, 842, 854, 867, 868, 869, 870, 871, 889, 978, 991, 1004, 1006, 1007, 1008, 1026, 1044, 1115, 1129, 1144, 1146, 1147, 1148, 1166, 1184, 1247, 1258, 1270, 1285, 1287, 1288, 1289, 1307, 1325, 1388, 1408, 1413, 1424, 1425, 1426, 1427, 1428, 1458, 1460, 1463, 1481, 1482, 1483, 1484, 1496, 1502, 1508, 1514, 1520, 1526, 1532, 1538, 1544, 1550, 1556, 1594]
Discarding 110 places :
Implicit Place search using SMT only with invariants took 1379 ms to find 110 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1485/1595 places, 2612/2612 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 1485 transition count 2482
Reduce places removed 130 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 1 with 158 rules applied. Total rules applied 288 place count 1355 transition count 2454
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 316 place count 1327 transition count 2454
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 316 place count 1327 transition count 2402
Deduced a syphon composed of 52 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 105 rules applied. Total rules applied 421 place count 1274 transition count 2402
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 16 rules applied. Total rules applied 437 place count 1262 transition count 2398
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 441 place count 1258 transition count 2398
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 451 place count 1248 transition count 2388
Iterating global reduction 5 with 10 rules applied. Total rules applied 461 place count 1248 transition count 2388
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 464 place count 1245 transition count 2385
Iterating global reduction 5 with 3 rules applied. Total rules applied 467 place count 1245 transition count 2385
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 4 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 5 with 174 rules applied. Total rules applied 641 place count 1158 transition count 2298
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 644 place count 1155 transition count 2295
Iterating global reduction 5 with 3 rules applied. Total rules applied 647 place count 1155 transition count 2295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 649 place count 1155 transition count 2293
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 654 place count 1155 transition count 2288
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 664 place count 1155 transition count 2278
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 676 place count 1145 transition count 2276
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 677 place count 1145 transition count 2275
Free-agglomeration rule (complex) applied 49 times.
Iterating global reduction 7 with 49 rules applied. Total rules applied 726 place count 1145 transition count 2226
Ensure Unique test removed 5 places
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 7 with 54 rules applied. Total rules applied 780 place count 1091 transition count 2226
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 782 place count 1089 transition count 2224
Iterating global reduction 8 with 2 rules applied. Total rules applied 784 place count 1089 transition count 2224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 786 place count 1089 transition count 2222
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 788 place count 1089 transition count 2220
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 789 place count 1089 transition count 2219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 790 place count 1088 transition count 2219
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 811 place count 1088 transition count 2219
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 816 place count 1088 transition count 2219
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 817 place count 1088 transition count 2218
Applied a total of 817 rules in 830 ms. Remains 1088 /1485 variables (removed 397) and now considering 2218/2612 (removed 394) transitions.
// Phase 1: matrix 2218 rows 1088 cols
[2023-03-12 10:50:00] [INFO ] Computed 166 place invariants in 21 ms
[2023-03-12 10:50:01] [INFO ] Implicit Places using invariants in 804 ms returned [94, 105, 107, 111, 119, 120, 192, 198, 210, 211, 216, 217, 269, 287, 298, 300, 301, 306, 307, 384, 397, 404, 405, 488, 493, 496, 503, 504, 560, 578, 591, 601, 606, 607, 680, 686, 689, 709, 781, 787, 803, 885, 898, 905, 913, 914, 967, 985, 997, 999, 1000, 1085]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 811 ms to find 52 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1036/1595 places, 2218/2612 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1036 transition count 2217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1035 transition count 2217
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 16 place count 1021 transition count 2203
Iterating global reduction 2 with 14 rules applied. Total rules applied 30 place count 1021 transition count 2203
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 1017 transition count 2199
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 1017 transition count 2199
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 62 place count 1005 transition count 2187
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 1005 transition count 2184
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 81 place count 1005 transition count 2168
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 97 place count 989 transition count 2168
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 989 transition count 2166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 101 place count 987 transition count 2166
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 987 transition count 2166
Applied a total of 102 rules in 317 ms. Remains 987 /1036 variables (removed 49) and now considering 2166/2218 (removed 52) transitions.
// Phase 1: matrix 2166 rows 987 cols
[2023-03-12 10:50:01] [INFO ] Computed 114 place invariants in 32 ms
[2023-03-12 10:50:02] [INFO ] Implicit Places using invariants in 726 ms returned []
[2023-03-12 10:50:02] [INFO ] Invariant cache hit.
[2023-03-12 10:50:03] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-12 10:50:07] [INFO ] Implicit Places using invariants and state equation in 4611 ms returned []
Implicit Place search using SMT with State Equation took 5344 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 987/1595 places, 2166/2612 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8806 ms. Remains : 987/1595 places, 2166/2612 transitions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 7) seen :1
FORMULA ASLink-PT-10a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 10:50:07] [INFO ] Invariant cache hit.
[2023-03-12 10:50:07] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2023-03-12 10:50:07] [INFO ] [Real]Absence check using 30 positive and 84 generalized place invariants in 51 ms returned sat
[2023-03-12 10:50:07] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 10:50:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2023-03-12 10:50:08] [INFO ] [Nat]Absence check using 30 positive and 84 generalized place invariants in 55 ms returned sat
[2023-03-12 10:50:32] [INFO ] After 24617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 10:50:32] [INFO ] State equation strengthened by 19 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-12 10:50:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 10:50:32] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 310 ms.
Support contains 97 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 2166/2166 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 987 transition count 2164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 985 transition count 2164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 984 transition count 2163
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 984 transition count 2163
Applied a total of 6 rules in 99 ms. Remains 984 /987 variables (removed 3) and now considering 2163/2166 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 984/987 places, 2163/2166 transitions.
Incomplete random walk after 10000 steps, including 97 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 146562 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146562 steps, saw 51617 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2163 rows 984 cols
[2023-03-12 10:50:36] [INFO ] Computed 114 place invariants in 21 ms
[2023-03-12 10:50:37] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-12 10:50:37] [INFO ] [Real]Absence check using 30 positive and 84 generalized place invariants in 57 ms returned sat
[2023-03-12 10:50:37] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 10:50:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2023-03-12 10:50:37] [INFO ] [Nat]Absence check using 30 positive and 84 generalized place invariants in 59 ms returned sat
[2023-03-12 10:51:02] [INFO ] After 24545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:51:02] [INFO ] State equation strengthened by 19 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-12 10:51:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 10:51:02] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 77 ms.
Support contains 97 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 2163/2163 transitions.
Applied a total of 0 rules in 49 ms. Remains 984 /984 variables (removed 0) and now considering 2163/2163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 984/984 places, 2163/2163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 2163/2163 transitions.
Applied a total of 0 rules in 47 ms. Remains 984 /984 variables (removed 0) and now considering 2163/2163 (removed 0) transitions.
[2023-03-12 10:51:02] [INFO ] Invariant cache hit.
[2023-03-12 10:51:03] [INFO ] Implicit Places using invariants in 647 ms returned [581]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 653 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 983/984 places, 2163/2163 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 981 transition count 2161
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 981 transition count 2160
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 981 transition count 2159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 980 transition count 2159
Applied a total of 7 rules in 114 ms. Remains 980 /983 variables (removed 3) and now considering 2159/2163 (removed 4) transitions.
// Phase 1: matrix 2159 rows 980 cols
[2023-03-12 10:51:03] [INFO ] Computed 113 place invariants in 23 ms
[2023-03-12 10:51:03] [INFO ] Implicit Places using invariants in 594 ms returned [625]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 596 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/984 places, 2159/2163 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 978 transition count 2158
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 978 transition count 2158
Applied a total of 2 rules in 79 ms. Remains 978 /979 variables (removed 1) and now considering 2158/2159 (removed 1) transitions.
// Phase 1: matrix 2158 rows 978 cols
[2023-03-12 10:51:03] [INFO ] Computed 112 place invariants in 18 ms
[2023-03-12 10:51:04] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-12 10:51:04] [INFO ] Invariant cache hit.
[2023-03-12 10:51:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 10:51:07] [INFO ] Implicit Places using invariants and state equation in 3476 ms returned []
Implicit Place search using SMT with State Equation took 4044 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 978/984 places, 2158/2163 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5546 ms. Remains : 978/984 places, 2158/2163 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 167325 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167325 steps, saw 61425 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 10:51:11] [INFO ] Invariant cache hit.
[2023-03-12 10:51:11] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned sat
[2023-03-12 10:51:11] [INFO ] [Real]Absence check using 27 positive and 85 generalized place invariants in 25 ms returned sat
[2023-03-12 10:51:11] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 10:51:12] [INFO ] [Nat]Absence check using 27 positive place invariants in 7 ms returned sat
[2023-03-12 10:51:12] [INFO ] [Nat]Absence check using 27 positive and 85 generalized place invariants in 72 ms returned sat
[2023-03-12 10:51:36] [INFO ] After 24491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 10:51:36] [INFO ] State equation strengthened by 20 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
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-12 10:51:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 10:51:36] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 97 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 2158/2158 transitions.
Applied a total of 0 rules in 29 ms. Remains 978 /978 variables (removed 0) and now considering 2158/2158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 978/978 places, 2158/2158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 2158/2158 transitions.
Applied a total of 0 rules in 27 ms. Remains 978 /978 variables (removed 0) and now considering 2158/2158 (removed 0) transitions.
[2023-03-12 10:51:36] [INFO ] Invariant cache hit.
[2023-03-12 10:51:37] [INFO ] Implicit Places using invariants in 625 ms returned []
[2023-03-12 10:51:37] [INFO ] Invariant cache hit.
[2023-03-12 10:51:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 10:51:41] [INFO ] Implicit Places using invariants and state equation in 3716 ms returned []
Implicit Place search using SMT with State Equation took 4364 ms to find 0 implicit places.
[2023-03-12 10:51:41] [INFO ] Redundant transitions in 197 ms returned []
[2023-03-12 10:51:41] [INFO ] Invariant cache hit.
[2023-03-12 10:51:42] [INFO ] Dead Transitions using invariants and state equation in 1129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5748 ms. Remains : 978/978 places, 2158/2158 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 978 transition count 2152
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 972 transition count 2152
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 972 transition count 2151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 971 transition count 2151
Applied a total of 14 rules in 76 ms. Remains 971 /978 variables (removed 7) and now considering 2151/2158 (removed 7) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2151 rows 971 cols
[2023-03-12 10:51:42] [INFO ] Computed 112 place invariants in 28 ms
[2023-03-12 10:51:43] [INFO ] [Real]Absence check using 24 positive place invariants in 67 ms returned sat
[2023-03-12 10:51:43] [INFO ] [Real]Absence check using 24 positive and 88 generalized place invariants in 48 ms returned sat
[2023-03-12 10:51:43] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 10:51:43] [INFO ] [Nat]Absence check using 24 positive place invariants in 35 ms returned sat
[2023-03-12 10:51:43] [INFO ] [Nat]Absence check using 24 positive and 88 generalized place invariants in 51 ms returned sat
[2023-03-12 10:52:15] [INFO ] After 32334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:52:22] [INFO ] After 38539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1068 ms.
[2023-03-12 10:52:23] [INFO ] After 40052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 10:52:23] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-12 10:52:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 978 places, 2158 transitions and 8650 arcs took 17 ms.
[2023-03-12 10:52:23] [INFO ] Flatten gal took : 192 ms
Total runtime 204136 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/570/inv_0_ --invariant=/tmp/570/inv_1_ --invariant=/tmp/570/inv_2_ --invariant=/tmp/570/inv_3_ --invariant=/tmp/570/inv_4_ --invariant=/tmp/570/inv_5_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 15813456 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098704 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ASLink-PT-10a"
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 ASLink-PT-10a, 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 r009-oct2-167813597500158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10a.tgz
mv ASLink-PT-10a 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 ;