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.r233-tall-167856419400775.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 MultiCrashLeafsetExtension-PT-S16C05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400775
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 14K Feb 26 02:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 02:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.6M 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 MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679608923978

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 22:02:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 22:02:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 22:02:05] [INFO ] Load time of PNML (sax parser for PT used): 260 ms
[2023-03-23 22:02:05] [INFO ] Transformed 4914 places.
[2023-03-23 22:02:05] [INFO ] Transformed 6913 transitions.
[2023-03-23 22:02:05] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 525 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 192 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 16) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 14) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-23 22:02:08] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2023-03-23 22:02:08] [INFO ] Computed 535 place invariants in 378 ms
[2023-03-23 22:02:10] [INFO ] [Real]Absence check using 48 positive place invariants in 25 ms returned sat
[2023-03-23 22:02:10] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 205 ms returned sat
[2023-03-23 22:02:16] [INFO ] After 7512ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:11
[2023-03-23 22:02:17] [INFO ] [Nat]Absence check using 48 positive place invariants in 21 ms returned sat
[2023-03-23 22:02:17] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 209 ms returned sat
[2023-03-23 22:02:34] [INFO ] After 16095ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :10
[2023-03-23 22:02:34] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-23 22:02:41] [INFO ] After 6731ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :3 sat :9
[2023-03-23 22:02:41] [INFO ] After 6735ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :9
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-23 22:02:41] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :9
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 151 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.18 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions removed 1236 transitions
Trivial Post-agglo rules discarded 1236 transitions
Performed 1236 trivial Post agglomeration. Transition count delta: 1236
Iterating post reduction 0 with 1236 rules applied. Total rules applied 1237 place count 4884 transition count 5677
Reduce places removed 1236 places and 0 transitions.
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Iterating post reduction 1 with 1338 rules applied. Total rules applied 2575 place count 3648 transition count 5575
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 2 with 102 rules applied. Total rules applied 2677 place count 3546 transition count 5575
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 2677 place count 3546 transition count 5419
Deduced a syphon composed of 156 places in 9 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 2989 place count 3390 transition count 5419
Discarding 1154 places :
Symmetric choice reduction at 3 with 1154 rule applications. Total rules 4143 place count 2236 transition count 4265
Iterating global reduction 3 with 1154 rules applied. Total rules applied 5297 place count 2236 transition count 4265
Discarding 188 places :
Symmetric choice reduction at 3 with 188 rule applications. Total rules 5485 place count 2048 transition count 3325
Iterating global reduction 3 with 188 rules applied. Total rules applied 5673 place count 2048 transition count 3325
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 5691 place count 2039 transition count 3316
Free-agglomeration rule (complex) applied 95 times.
Iterating global reduction 3 with 95 rules applied. Total rules applied 5786 place count 2039 transition count 3221
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 3 with 95 rules applied. Total rules applied 5881 place count 1944 transition count 3221
Partial Free-agglomeration rule applied 157 times.
Drop transitions removed 157 transitions
Iterating global reduction 4 with 157 rules applied. Total rules applied 6038 place count 1944 transition count 3221
Applied a total of 6038 rules in 1509 ms. Remains 1944 /4914 variables (removed 2970) and now considering 3221/6913 (removed 3692) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1510 ms. Remains : 1944/4914 places, 3221/6913 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-23 22:02:43] [INFO ] Flow matrix only has 2854 transitions (discarded 367 similar events)
// Phase 1: matrix 2854 rows 1944 cols
[2023-03-23 22:02:43] [INFO ] Computed 505 place invariants in 56 ms
[2023-03-23 22:02:44] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-23 22:02:44] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 111 ms returned sat
[2023-03-23 22:02:45] [INFO ] After 2123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 22:02:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-23 22:02:46] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 94 ms returned sat
[2023-03-23 22:02:51] [INFO ] After 4395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 22:02:51] [INFO ] State equation strengthened by 1154 read => feed constraints.
[2023-03-23 22:02:58] [INFO ] After 7701ms SMT Verify possible using 1154 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2023-03-23 22:03:01] [INFO ] Deduced a trap composed of 308 places in 1194 ms of which 7 ms to minimize.
[2023-03-23 22:03:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1389 ms
[2023-03-23 22:03:03] [INFO ] Deduced a trap composed of 187 places in 1151 ms of which 3 ms to minimize.
[2023-03-23 22:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1375 ms
[2023-03-23 22:03:05] [INFO ] Deduced a trap composed of 368 places in 1154 ms of which 10 ms to minimize.
[2023-03-23 22:03:07] [INFO ] Deduced a trap composed of 370 places in 1169 ms of which 3 ms to minimize.
[2023-03-23 22:03:08] [INFO ] Deduced a trap composed of 352 places in 1176 ms of which 4 ms to minimize.
[2023-03-23 22:03:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5013 ms
[2023-03-23 22:03:10] [INFO ] Deduced a trap composed of 254 places in 1123 ms of which 2 ms to minimize.
[2023-03-23 22:03:12] [INFO ] Deduced a trap composed of 2 places in 1232 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.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-23 22:03:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:03:12] [INFO ] After 26257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 115 out of 1944 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1944/1944 places, 3221/3221 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1944 transition count 3218
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 1941 transition count 3217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 1940 transition count 3217
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 1940 transition count 3212
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 18 place count 1935 transition count 3212
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 29 place count 1924 transition count 3185
Iterating global reduction 3 with 11 rules applied. Total rules applied 40 place count 1924 transition count 3185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 40 place count 1924 transition count 3184
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 1923 transition count 3184
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 46 place count 1919 transition count 3164
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 1919 transition count 3164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 1918 transition count 3163
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 58 place count 1918 transition count 3157
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 64 place count 1912 transition count 3157
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 71 place count 1912 transition count 3157
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 74 place count 1909 transition count 3154
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 1909 transition count 3154
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 1908 transition count 3149
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 1908 transition count 3149
Applied a total of 79 rules in 811 ms. Remains 1908 /1944 variables (removed 36) and now considering 3149/3221 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 811 ms. Remains : 1908/1944 places, 3149/3221 transitions.
Incomplete random walk after 10000 steps, including 271 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 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 54 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 56142 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56142 steps, saw 25657 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-23 22:03:16] [INFO ] Flow matrix only has 2776 transitions (discarded 373 similar events)
// Phase 1: matrix 2776 rows 1908 cols
[2023-03-23 22:03:16] [INFO ] Computed 505 place invariants in 83 ms
[2023-03-23 22:03:17] [INFO ] [Real]Absence check using 33 positive place invariants in 49 ms returned sat
[2023-03-23 22:03:17] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 100 ms returned sat
[2023-03-23 22:03:17] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 22:03:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-23 22:03:17] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 103 ms returned sat
[2023-03-23 22:03:23] [INFO ] After 4995ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 22:03:23] [INFO ] State equation strengthened by 1118 read => feed constraints.
[2023-03-23 22:03:30] [INFO ] After 7216ms SMT Verify possible using 1118 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 22:03:31] [INFO ] Deduced a trap composed of 303 places in 994 ms of which 2 ms to minimize.
[2023-03-23 22:03:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1179 ms
[2023-03-23 22:03:35] [INFO ] Deduced a trap composed of 250 places in 1105 ms of which 2 ms to minimize.
[2023-03-23 22:03:36] [INFO ] Deduced a trap composed of 258 places in 1103 ms of which 2 ms to minimize.
[2023-03-23 22:03:38] [INFO ] Deduced a trap composed of 420 places in 1117 ms of which 3 ms to minimize.
[2023-03-23 22:03:39] [INFO ] Deduced a trap composed of 265 places in 1106 ms of which 2 ms to minimize.
[2023-03-23 22:03:41] [INFO ] Deduced a trap composed of 244 places in 1106 ms of which 2 ms to minimize.
[2023-03-23 22:03:42] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 8095 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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-23 22:03:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 22:03:42] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 14 ms.
Support contains 115 out of 1908 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1908/1908 places, 3149/3149 transitions.
Applied a total of 0 rules in 99 ms. Remains 1908 /1908 variables (removed 0) and now considering 3149/3149 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 1908/1908 places, 3149/3149 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1908/1908 places, 3149/3149 transitions.
Applied a total of 0 rules in 85 ms. Remains 1908 /1908 variables (removed 0) and now considering 3149/3149 (removed 0) transitions.
[2023-03-23 22:03:42] [INFO ] Flow matrix only has 2776 transitions (discarded 373 similar events)
[2023-03-23 22:03:42] [INFO ] Invariant cache hit.
[2023-03-23 22:03:44] [INFO ] Implicit Places using invariants in 1917 ms returned [4, 8, 12, 13, 15, 16, 17, 22, 28, 36, 49, 61, 75, 90, 105, 107, 108, 109, 110, 122, 132, 140, 146, 154, 157, 171, 178, 181, 182, 184, 185, 186, 189, 193, 201, 210, 220, 232, 245, 258, 259, 260, 261, 262, 263, 273, 281, 288, 292, 295, 297, 311, 318, 321, 323, 325, 326, 329, 333, 337, 347, 356, 366, 377, 388, 389, 390, 391, 392, 393, 401, 408, 413, 415, 417, 419, 433, 439, 442, 443, 444, 445, 446, 447, 449, 451, 453, 458, 464, 472, 481, 490, 491, 492, 493, 494, 495, 501, 506, 508, 510, 512, 514, 527, 533, 536, 537, 538, 539, 541, 543, 545, 548, 551, 557, 563, 570, 577, 578, 579, 580, 581, 582, 586, 588, 590, 592, 594, 596, 610, 617, 620, 621, 622, 623, 625, 627, 629, 631, 633, 638, 642, 647, 652, 653, 654, 656, 657, 659, 661, 663, 665, 667, 672, 685, 691, 694, 695, 696, 697, 698, 699, 701, 703, 705, 708, 710, 712, 715, 719, 720, 721, 722, 723, 724, 726, 729, 731, 733, 735, 738, 751, 757, 760, 761, 762, 763, 764, 765, 767, 769, 771, 773, 775, 778, 780, 783, 784, 785, 787, 788, 790, 792, 794, 796, 800, 802, 816, 818, 821, 824, 825, 826, 827, 828, 829, 832, 834, 836, 838, 840, 842, 844, 848, 849, 850, 851, 852, 854, 859, 861, 863, 865, 867, 886, 889, 890, 891, 892, 894, 896, 901, 903, 905, 907, 909, 911, 914, 916, 917, 918, 919, 921, 923, 925, 927, 929, 934, 947, 953, 956, 957, 958, 959, 960, 961, 963, 965, 967, 970, 972, 974, 976, 980, 981, 982, 983, 984, 985, 987, 989, 991, 993, 995, 997, 1010, 1016, 1019, 1021, 1022, 1024, 1026, 1028, 1030, 1035, 1037, 1041, 1045, 1051, 1052, 1053, 1054, 1055, 1056, 1060, 1062, 1064, 1068, 1070, 1085, 1091, 1094, 1095, 1096, 1098, 1099, 1102, 1104, 1108, 1110, 1113, 1120, 1135, 1136, 1137, 1138, 1140, 1146, 1150, 1152, 1154, 1156, 1161, 1175, 1181, 1184, 1185, 1186, 1187, 1189, 1194, 1196, 1198, 1200, 1205, 1211, 1219, 1229, 1230, 1231, 1233, 1234, 1242, 1248, 1255, 1257, 1259, 1261, 1274, 1281, 1284, 1285, 1286, 1287, 1288, 1289, 1291, 1294, 1296, 1300, 1307, 1315, 1325, 1337, 1338, 1340, 1341, 1342, 1355, 1363, 1369, 1373, 1375, 1377, 1397, 1400, 1401, 1402, 1403, 1406, 1411, 1417, 1423, 1429, 1438, 1448, 1460, 1475, 1476, 1477, 1478, 1479, 1493, 1503, 1511, 1517, 1521, 1524, 1538, 1540, 1544, 1547, 1548, 1549, 1551, 1552, 1558, 1563, 1569, 1577, 1588, 1600, 1614, 1631, 1632, 1633, 1634, 1635, 1650, 1662, 1672, 1683, 1689, 1694, 1708]
Discarding 435 places :
Implicit Place search using SMT only with invariants took 1927 ms to find 435 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1473/1908 places, 3149/3149 transitions.
Discarding 137 places :
Symmetric choice reduction at 0 with 137 rule applications. Total rules 137 place count 1336 transition count 3012
Iterating global reduction 0 with 137 rules applied. Total rules applied 274 place count 1336 transition count 3012
Discarding 137 places :
Symmetric choice reduction at 0 with 137 rule applications. Total rules 411 place count 1199 transition count 2875
Iterating global reduction 0 with 137 rules applied. Total rules applied 548 place count 1199 transition count 2875
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 559 place count 1188 transition count 2820
Iterating global reduction 0 with 11 rules applied. Total rules applied 570 place count 1188 transition count 2820
Applied a total of 570 rules in 146 ms. Remains 1188 /1473 variables (removed 285) and now considering 2820/3149 (removed 329) transitions.
[2023-03-23 22:03:44] [INFO ] Flow matrix only has 2447 transitions (discarded 373 similar events)
// Phase 1: matrix 2447 rows 1188 cols
[2023-03-23 22:03:44] [INFO ] Computed 70 place invariants in 30 ms
[2023-03-23 22:03:45] [INFO ] Implicit Places using invariants in 781 ms returned []
[2023-03-23 22:03:45] [INFO ] Flow matrix only has 2447 transitions (discarded 373 similar events)
[2023-03-23 22:03:45] [INFO ] Invariant cache hit.
[2023-03-23 22:03:46] [INFO ] State equation strengthened by 1074 read => feed constraints.
[2023-03-23 22:04:00] [INFO ] Implicit Places using invariants and state equation in 14827 ms returned []
Implicit Place search using SMT with State Equation took 15611 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1188/1908 places, 2820/3149 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17770 ms. Remains : 1188/1908 places, 2820/3149 transitions.
Incomplete random walk after 10000 steps, including 270 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 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 54 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 62829 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62829 steps, saw 27429 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-23 22:04:03] [INFO ] Flow matrix only has 2447 transitions (discarded 373 similar events)
[2023-03-23 22:04:03] [INFO ] Invariant cache hit.
[2023-03-23 22:04:04] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2023-03-23 22:04:04] [INFO ] [Real]Absence check using 33 positive and 37 generalized place invariants in 11 ms returned sat
[2023-03-23 22:04:04] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 22:04:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-23 22:04:04] [INFO ] [Nat]Absence check using 33 positive and 37 generalized place invariants in 19 ms returned sat
[2023-03-23 22:04:07] [INFO ] After 2644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 22:04:07] [INFO ] State equation strengthened by 1074 read => feed constraints.
[2023-03-23 22:04:11] [INFO ] After 4088ms SMT Verify possible using 1074 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 22:04:12] [INFO ] Deduced a trap composed of 216 places in 475 ms of which 1 ms to minimize.
[2023-03-23 22:04:13] [INFO ] Deduced a trap composed of 198 places in 468 ms of which 1 ms to minimize.
[2023-03-23 22:04:13] [INFO ] Deduced a trap composed of 194 places in 480 ms of which 1 ms to minimize.
[2023-03-23 22:04:14] [INFO ] Deduced a trap composed of 190 places in 487 ms of which 1 ms to minimize.
[2023-03-23 22:04:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2687 ms
[2023-03-23 22:04:15] [INFO ] Deduced a trap composed of 162 places in 501 ms of which 1 ms to minimize.
[2023-03-23 22:04:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 760 ms
[2023-03-23 22:04:19] [INFO ] Deduced a trap composed of 179 places in 507 ms of which 1 ms to minimize.
[2023-03-23 22:04:20] [INFO ] Deduced a trap composed of 152 places in 511 ms of which 1 ms to minimize.
[2023-03-23 22:04:20] [INFO ] Deduced a trap composed of 192 places in 524 ms of which 1 ms to minimize.
[2023-03-23 22:04:21] [INFO ] Deduced a trap composed of 188 places in 527 ms of which 1 ms to minimize.
[2023-03-23 22:04:22] [INFO ] Deduced a trap composed of 200 places in 520 ms of which 1 ms to minimize.
[2023-03-23 22:04:23] [INFO ] Deduced a trap composed of 193 places in 536 ms of which 1 ms to minimize.
[2023-03-23 22:04:23] [INFO ] Deduced a trap composed of 174 places in 520 ms of which 1 ms to minimize.
[2023-03-23 22:04:24] [INFO ] Deduced a trap composed of 221 places in 493 ms of which 1 ms to minimize.
[2023-03-23 22:04:24] [INFO ] Deduced a trap composed of 194 places in 522 ms of which 1 ms to minimize.
[2023-03-23 22:04:25] [INFO ] Deduced a trap composed of 184 places in 536 ms of which 1 ms to minimize.
[2023-03-23 22:04:26] [INFO ] Deduced a trap composed of 241 places in 521 ms of which 1 ms to minimize.
[2023-03-23 22:04:26] [INFO ] Deduced a trap composed of 196 places in 538 ms of which 1 ms to minimize.
[2023-03-23 22:04:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 8294 ms
[2023-03-23 22:04:27] [INFO ] After 19645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2288 ms.
[2023-03-23 22:04:29] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 12 ms.
Support contains 115 out of 1188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1188/1188 places, 2820/2820 transitions.
Applied a total of 0 rules in 64 ms. Remains 1188 /1188 variables (removed 0) and now considering 2820/2820 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1188/1188 places, 2820/2820 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1188/1188 places, 2820/2820 transitions.
Applied a total of 0 rules in 55 ms. Remains 1188 /1188 variables (removed 0) and now considering 2820/2820 (removed 0) transitions.
[2023-03-23 22:04:29] [INFO ] Flow matrix only has 2447 transitions (discarded 373 similar events)
[2023-03-23 22:04:29] [INFO ] Invariant cache hit.
[2023-03-23 22:04:30] [INFO ] Implicit Places using invariants in 751 ms returned []
[2023-03-23 22:04:30] [INFO ] Flow matrix only has 2447 transitions (discarded 373 similar events)
[2023-03-23 22:04:30] [INFO ] Invariant cache hit.
[2023-03-23 22:04:30] [INFO ] State equation strengthened by 1074 read => feed constraints.
[2023-03-23 22:04:44] [INFO ] Implicit Places using invariants and state equation in 14640 ms returned []
Implicit Place search using SMT with State Equation took 15393 ms to find 0 implicit places.
[2023-03-23 22:04:45] [INFO ] Redundant transitions in 171 ms returned []
[2023-03-23 22:04:45] [INFO ] Flow matrix only has 2447 transitions (discarded 373 similar events)
[2023-03-23 22:04:45] [INFO ] Invariant cache hit.
[2023-03-23 22:04:46] [INFO ] Dead Transitions using invariants and state equation in 1139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16768 ms. Remains : 1188/1188 places, 2820/2820 transitions.
Graph (trivial) has 831 edges and 1188 vertex of which 10 / 1188 are part of one of the 1 SCC in 3 ms
Free SCC test removed 9 places
Drop transitions removed 153 transitions
Ensure Unique test removed 376 transitions
Reduce isomorphic transitions removed 529 transitions.
Graph (complete) has 3613 edges and 1179 vertex of which 1170 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Ensure Unique test removed 14 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 1155 transition count 2266
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 58 rules applied. Total rules applied 85 place count 1132 transition count 2231
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 35 rules applied. Total rules applied 120 place count 1115 transition count 2213
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 10 rules applied. Total rules applied 130 place count 1109 transition count 2209
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 133 place count 1106 transition count 2209
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 133 place count 1106 transition count 2177
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 197 place count 1074 transition count 2177
Discarding 124 places :
Symmetric choice reduction at 5 with 124 rule applications. Total rules 321 place count 950 transition count 2053
Iterating global reduction 5 with 124 rules applied. Total rules applied 445 place count 950 transition count 2053
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 462 place count 950 transition count 2036
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 0 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 6 with 1020 rules applied. Total rules applied 1482 place count 440 transition count 1526
Drop transitions removed 259 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 309 transitions.
Iterating post reduction 6 with 309 rules applied. Total rules applied 1791 place count 440 transition count 1217
Discarding 22 places :
Symmetric choice reduction at 7 with 22 rule applications. Total rules 1813 place count 418 transition count 1128
Iterating global reduction 7 with 22 rules applied. Total rules applied 1835 place count 418 transition count 1128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1837 place count 418 transition count 1126
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -202
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1873 place count 400 transition count 1328
Drop transitions removed 160 transitions
Redundant transition composition rules discarded 160 transitions
Iterating global reduction 8 with 160 rules applied. Total rules applied 2033 place count 400 transition count 1168
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 8 with 4 rules applied. Total rules applied 2037 place count 400 transition count 1164
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 5 rules applied. Total rules applied 2042 place count 396 transition count 1163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2043 place count 395 transition count 1163
Discarding 28 places :
Symmetric choice reduction at 11 with 28 rule applications. Total rules 2071 place count 367 transition count 1039
Iterating global reduction 11 with 28 rules applied. Total rules applied 2099 place count 367 transition count 1039
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 2106 place count 367 transition count 1032
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2108 place count 366 transition count 1043
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2116 place count 366 transition count 1035
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 2124 place count 358 transition count 1035
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 2126 place count 358 transition count 1033
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2127 place count 358 transition count 1032
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2128 place count 357 transition count 1032
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 14 with 33 rules applied. Total rules applied 2161 place count 357 transition count 1032
Partial Post-agglomeration rule applied 143 times.
Drop transitions removed 143 transitions
Iterating global reduction 14 with 143 rules applied. Total rules applied 2304 place count 357 transition count 1032
Applied a total of 2304 rules in 715 ms. Remains 357 /1188 variables (removed 831) and now considering 1032/2820 (removed 1788) transitions.
Running SMT prover for 7 properties.
[2023-03-23 22:04:46] [INFO ] Flow matrix only has 999 transitions (discarded 33 similar events)
// Phase 1: matrix 999 rows 357 cols
[2023-03-23 22:04:46] [INFO ] Computed 47 place invariants in 8 ms
[2023-03-23 22:04:47] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-23 22:04:47] [INFO ] [Real]Absence check using 10 positive and 37 generalized place invariants in 6 ms returned sat
[2023-03-23 22:04:47] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 22:04:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-23 22:04:47] [INFO ] [Nat]Absence check using 10 positive and 37 generalized place invariants in 6 ms returned sat
[2023-03-23 22:04:48] [INFO ] After 711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 22:04:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-23 22:04:48] [INFO ] After 576ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 22:04:49] [INFO ] Deduced a trap composed of 134 places in 170 ms of which 0 ms to minimize.
[2023-03-23 22:04:49] [INFO ] Deduced a trap composed of 134 places in 151 ms of which 0 ms to minimize.
[2023-03-23 22:04:49] [INFO ] Deduced a trap composed of 133 places in 160 ms of which 1 ms to minimize.
[2023-03-23 22:04:49] [INFO ] Deduced a trap composed of 132 places in 153 ms of which 3 ms to minimize.
[2023-03-23 22:04:49] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 1 ms to minimize.
[2023-03-23 22:04:50] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 0 ms to minimize.
[2023-03-23 22:04:50] [INFO ] Deduced a trap composed of 127 places in 159 ms of which 1 ms to minimize.
[2023-03-23 22:04:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1355 ms
[2023-03-23 22:04:50] [INFO ] Deduced a trap composed of 127 places in 162 ms of which 1 ms to minimize.
[2023-03-23 22:04:50] [INFO ] Deduced a trap composed of 129 places in 165 ms of which 2 ms to minimize.
[2023-03-23 22:04:50] [INFO ] Deduced a trap composed of 129 places in 179 ms of which 0 ms to minimize.
[2023-03-23 22:04:51] [INFO ] Deduced a trap composed of 127 places in 160 ms of which 1 ms to minimize.
[2023-03-23 22:04:51] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 0 ms to minimize.
[2023-03-23 22:04:51] [INFO ] Deduced a trap composed of 127 places in 169 ms of which 1 ms to minimize.
[2023-03-23 22:04:51] [INFO ] Deduced a trap composed of 135 places in 157 ms of which 0 ms to minimize.
[2023-03-23 22:04:51] [INFO ] Deduced a trap composed of 133 places in 153 ms of which 0 ms to minimize.
[2023-03-23 22:04:52] [INFO ] Deduced a trap composed of 133 places in 158 ms of which 0 ms to minimize.
[2023-03-23 22:04:52] [INFO ] Deduced a trap composed of 140 places in 153 ms of which 1 ms to minimize.
[2023-03-23 22:04:52] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 1 ms to minimize.
[2023-03-23 22:04:52] [INFO ] Deduced a trap composed of 127 places in 163 ms of which 1 ms to minimize.
[2023-03-23 22:04:53] [INFO ] Deduced a trap composed of 132 places in 183 ms of which 5 ms to minimize.
[2023-03-23 22:04:53] [INFO ] Deduced a trap composed of 127 places in 159 ms of which 0 ms to minimize.
[2023-03-23 22:04:53] [INFO ] Deduced a trap composed of 126 places in 159 ms of which 0 ms to minimize.
[2023-03-23 22:04:53] [INFO ] Deduced a trap composed of 145 places in 150 ms of which 0 ms to minimize.
[2023-03-23 22:04:53] [INFO ] Deduced a trap composed of 143 places in 151 ms of which 0 ms to minimize.
[2023-03-23 22:04:54] [INFO ] Deduced a trap composed of 141 places in 144 ms of which 0 ms to minimize.
[2023-03-23 22:04:54] [INFO ] Deduced a trap composed of 146 places in 156 ms of which 4 ms to minimize.
[2023-03-23 22:04:54] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4017 ms
[2023-03-23 22:04:54] [INFO ] Deduced a trap composed of 180 places in 160 ms of which 0 ms to minimize.
[2023-03-23 22:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-23 22:04:54] [INFO ] After 6779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 813 ms.
[2023-03-23 22:04:55] [INFO ] After 8441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-23 22:04:55] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-23 22:04:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1188 places, 2820 transitions and 12894 arcs took 16 ms.
[2023-03-23 22:04:56] [INFO ] Flatten gal took : 219 ms
Total runtime 170702 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 --inv-bin-par --invariant=/tmp/699/inv_0_ --invariant=/tmp/699/inv_1_ --invariant=/tmp/699/inv_2_ --invariant=/tmp/699/inv_3_ --invariant=/tmp/699/inv_4_ --invariant=/tmp/699/inv_5_ --invariant=/tmp/699/inv_6_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 14081056 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16092916 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 ReachabilityFireability -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="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="ReachabilityFireability"
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 MultiCrashLeafsetExtension-PT-S16C05, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856419400775"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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