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-167856419600902.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-S32C03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419600902
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 14K Feb 26 03:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 03:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 03:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 03:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 03:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 03:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 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 18M 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-S32C03-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679657406200

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=MultiCrashLeafsetExtension-PT-S32C03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 11:30:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 11:30:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 11:30:08] [INFO ] Load time of PNML (sax parser for PT used): 631 ms
[2023-03-24 11:30:08] [INFO ] Transformed 15862 places.
[2023-03-24 11:30:08] [INFO ] Transformed 25109 transitions.
[2023-03-24 11:30:08] [INFO ] Parsed PT model containing 15862 places and 25109 transitions and 104566 arcs in 1055 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 319 resets, run finished after 763 ms. (steps per millisecond=13 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 8079 steps, run timeout after 3001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 8079 steps, saw 3864 distinct states, run finished after 3002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 16 properties.
[2023-03-24 11:30:13] [INFO ] Flow matrix only has 24053 transitions (discarded 1056 similar events)
// Phase 1: matrix 24053 rows 15862 cols
[2023-03-24 11:30:15] [INFO ] Computed 1403 place invariants in 2082 ms
[2023-03-24 11:30:20] [INFO ] After 5399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-24 11:30:25] [INFO ] [Nat]Absence check using 76 positive place invariants in 145 ms returned sat
[2023-03-24 11:30:26] [INFO ] [Nat]Absence check using 76 positive and 1327 generalized place invariants in 1049 ms returned sat
[2023-03-24 11:30:45] [INFO ] After 18161ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :3
[2023-03-24 11:30:45] [INFO ] State equation strengthened by 8098 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-24 11:30:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 11:30:45] [INFO ] After 25168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 16 out of 15862 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15862/15862 places, 25109/25109 transitions.
Graph (complete) has 59447 edges and 15862 vertex of which 15820 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.46 ms
Discarding 42 places :
Also discarding 0 output transitions
Drop transitions removed 3146 transitions
Trivial Post-agglo rules discarded 3146 transitions
Performed 3146 trivial Post agglomeration. Transition count delta: 3146
Iterating post reduction 0 with 3146 rules applied. Total rules applied 3147 place count 15820 transition count 21963
Reduce places removed 3146 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 3164 rules applied. Total rules applied 6311 place count 12674 transition count 21945
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 6329 place count 12656 transition count 21945
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 197 Pre rules applied. Total rules applied 6329 place count 12656 transition count 21748
Deduced a syphon composed of 197 places in 24 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 3 with 394 rules applied. Total rules applied 6723 place count 12459 transition count 21748
Discarding 2964 places :
Symmetric choice reduction at 3 with 2964 rule applications. Total rules 9687 place count 9495 transition count 18784
Iterating global reduction 3 with 2964 rules applied. Total rules applied 12651 place count 9495 transition count 18784
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12651 place count 9495 transition count 18782
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12655 place count 9493 transition count 18782
Discarding 982 places :
Symmetric choice reduction at 3 with 982 rule applications. Total rules 13637 place count 8511 transition count 15836
Iterating global reduction 3 with 982 rules applied. Total rules applied 14619 place count 8511 transition count 15836
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 14 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 14683 place count 8479 transition count 15804
Free-agglomeration rule (complex) applied 568 times.
Iterating global reduction 3 with 568 rules applied. Total rules applied 15251 place count 8479 transition count 17200
Reduce places removed 568 places and 0 transitions.
Iterating post reduction 3 with 568 rules applied. Total rules applied 15819 place count 7911 transition count 17200
Partial Free-agglomeration rule applied 131 times.
Drop transitions removed 131 transitions
Iterating global reduction 4 with 131 rules applied. Total rules applied 15950 place count 7911 transition count 17200
Applied a total of 15950 rules in 13628 ms. Remains 7911 /15862 variables (removed 7951) and now considering 17200/25109 (removed 7909) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13634 ms. Remains : 7911/15862 places, 17200/25109 transitions.
Incomplete random walk after 10000 steps, including 522 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-24 11:31:00] [INFO ] Flow matrix only has 15648 transitions (discarded 1552 similar events)
// Phase 1: matrix 15648 rows 7911 cols
[2023-03-24 11:31:01] [INFO ] Computed 1361 place invariants in 786 ms
[2023-03-24 11:31:02] [INFO ] [Real]Absence check using 65 positive place invariants in 167 ms returned sat
[2023-03-24 11:31:03] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 564 ms returned sat
[2023-03-24 11:31:15] [INFO ] After 12264ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-24 11:31:15] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2023-03-24 11:31:17] [INFO ] After 1475ms SMT Verify possible using 8098 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 11:31:17] [INFO ] After 15830ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 11:31:18] [INFO ] [Nat]Absence check using 65 positive place invariants in 156 ms returned sat
[2023-03-24 11:31:18] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 525 ms returned sat
[2023-03-24 11:31:33] [INFO ] After 14426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-24 11:31:42] [INFO ] After 8569ms SMT Verify possible using 8098 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 11:31:42] [INFO ] After 8570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-24 11:31:42] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 14 out of 7911 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7911/7911 places, 17200/17200 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7911 transition count 17199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7910 transition count 17199
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 7910 transition count 17198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 7909 transition count 17198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 6 place count 7907 transition count 17196
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 7907 transition count 17196
Applied a total of 8 rules in 4481 ms. Remains 7907 /7911 variables (removed 4) and now considering 17196/17200 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4481 ms. Remains : 7907/7911 places, 17196/17200 transitions.
Incomplete random walk after 10000 steps, including 523 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 12136 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12136 steps, saw 5603 distinct states, run finished after 3004 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-24 11:31:50] [INFO ] Flow matrix only has 15644 transitions (discarded 1552 similar events)
// Phase 1: matrix 15644 rows 7907 cols
[2023-03-24 11:31:51] [INFO ] Computed 1361 place invariants in 827 ms
[2023-03-24 11:31:52] [INFO ] [Real]Absence check using 65 positive place invariants in 137 ms returned sat
[2023-03-24 11:31:52] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 531 ms returned sat
[2023-03-24 11:32:04] [INFO ] After 12775ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 11:32:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 138 ms returned sat
[2023-03-24 11:32:05] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 521 ms returned sat
[2023-03-24 11:32:20] [INFO ] After 14399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-24 11:32:20] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2023-03-24 11:32:25] [INFO ] After 4861ms SMT Verify possible using 8098 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-24 11:32:39] [INFO ] Deduced a trap composed of 384 places in 13100 ms of which 19 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-24 11:32:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 11:32:39] [INFO ] After 35405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
FORMULA MultiCrashLeafsetExtension-PT-S32C03-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 12 out of 7907 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7907/7907 places, 17196/17196 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 7907 transition count 17195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 7906 transition count 17195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 7905 transition count 17194
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 7905 transition count 17194
Applied a total of 4 rules in 4325 ms. Remains 7905 /7907 variables (removed 2) and now considering 17194/17196 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4325 ms. Remains : 7905/7907 places, 17194/17196 transitions.
Incomplete random walk after 10000 steps, including 522 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 12947 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12947 steps, saw 5966 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 11:32:47] [INFO ] Flow matrix only has 15642 transitions (discarded 1552 similar events)
// Phase 1: matrix 15642 rows 7905 cols
[2023-03-24 11:32:48] [INFO ] Computed 1361 place invariants in 805 ms
[2023-03-24 11:32:49] [INFO ] [Real]Absence check using 65 positive place invariants in 124 ms returned sat
[2023-03-24 11:32:49] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 452 ms returned sat
[2023-03-24 11:33:00] [INFO ] After 11968ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 11:33:01] [INFO ] [Nat]Absence check using 65 positive place invariants in 118 ms returned sat
[2023-03-24 11:33:01] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 503 ms returned sat
[2023-03-24 11:33:12] [INFO ] After 10651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 11:33:12] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2023-03-24 11:33:19] [INFO ] After 6462ms SMT Verify possible using 8098 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 11:33:36] [INFO ] Deduced a trap composed of 442 places in 12527 ms of which 10 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-24 11:33:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 11:33:36] [INFO ] After 36624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 10 ms.
Support contains 12 out of 7905 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7905/7905 places, 17194/17194 transitions.
Applied a total of 0 rules in 1589 ms. Remains 7905 /7905 variables (removed 0) and now considering 17194/17194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1589 ms. Remains : 7905/7905 places, 17194/17194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7905/7905 places, 17194/17194 transitions.
Applied a total of 0 rules in 1568 ms. Remains 7905 /7905 variables (removed 0) and now considering 17194/17194 (removed 0) transitions.
[2023-03-24 11:33:39] [INFO ] Flow matrix only has 15642 transitions (discarded 1552 similar events)
[2023-03-24 11:33:39] [INFO ] Invariant cache hit.
[2023-03-24 11:33:47] [INFO ] Implicit Places using invariants in 7979 ms returned []
Implicit Place search using SMT only with invariants took 7982 ms to find 0 implicit places.
[2023-03-24 11:33:47] [INFO ] Flow matrix only has 15642 transitions (discarded 1552 similar events)
[2023-03-24 11:33:47] [INFO ] Invariant cache hit.
[2023-03-24 11:34:00] [INFO ] Dead Transitions using invariants and state equation in 12431 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21986 ms. Remains : 7905/7905 places, 17194/17194 transitions.
Graph (trivial) has 6853 edges and 7905 vertex of which 32 / 7905 are part of one of the 1 SCC in 8 ms
Free SCC test removed 31 places
Drop transitions removed 1051 transitions
Ensure Unique test removed 1523 transitions
Reduce isomorphic transitions removed 2574 transitions.
Graph (complete) has 39185 edges and 7874 vertex of which 7844 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.6 ms
Discarding 30 places :
Also discarding 0 output transitions
Ensure Unique test removed 639 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node14DetectsThatNode17CanReplaceNode16.Node17IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 415 transitions
Trivial Post-agglo rules discarded 415 transitions
Performed 415 trivial Post agglomeration. Transition count delta: 415
Iterating post reduction 0 with 417 rules applied. Total rules applied 419 place count 7204 transition count 14203
Ensure Unique test removed 1 places
Reduce places removed 416 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 398 transitions.
Drop transitions removed 397 transitions
Trivial Post-agglo rules discarded 397 transitions
Performed 397 trivial Post agglomeration. Transition count delta: 397
Iterating post reduction 1 with 1211 rules applied. Total rules applied 1630 place count 6788 transition count 13408
Ensure Unique test removed 1 places
Reduce places removed 398 places and 0 transitions.
Drop transitions removed 48 transitions
Ensure Unique test removed 333 transitions
Reduce isomorphic transitions removed 381 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 2 with 1110 rules applied. Total rules applied 2740 place count 6390 transition count 12696
Ensure Unique test removed 48 places
Reduce places removed 379 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 312 transitions
Reduce isomorphic transitions removed 314 transitions.
Drop transitions removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 3 with 1005 rules applied. Total rules applied 3745 place count 6011 transition count 12070
Ensure Unique test removed 2 places
Reduce places removed 314 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 295 transitions.
Drop transitions removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 4 with 862 rules applied. Total rules applied 4607 place count 5697 transition count 11522
Ensure Unique test removed 40 places
Reduce places removed 293 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 235 transitions
Reduce isomorphic transitions removed 237 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 5 with 765 rules applied. Total rules applied 5372 place count 5404 transition count 11050
Ensure Unique test removed 2 places
Reduce places removed 237 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 186 transitions
Reduce isomorphic transitions removed 218 transitions.
Drop transitions removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 6 with 639 rules applied. Total rules applied 6011 place count 5167 transition count 10648
Ensure Unique test removed 32 places
Reduce places removed 216 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 165 transitions
Reduce isomorphic transitions removed 167 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 7 with 548 rules applied. Total rules applied 6559 place count 4951 transition count 10316
Ensure Unique test removed 2 places
Reduce places removed 167 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 148 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 8 with 437 rules applied. Total rules applied 6996 place count 4784 transition count 10046
Ensure Unique test removed 24 places
Reduce places removed 146 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 105 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 9 with 353 rules applied. Total rules applied 7349 place count 4638 transition count 9839
Ensure Unique test removed 2 places
Reduce places removed 104 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 85 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 10 with 256 rules applied. Total rules applied 7605 place count 4534 transition count 9687
Ensure Unique test removed 16 places
Reduce places removed 83 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 11 with 181 rules applied. Total rules applied 7786 place count 4451 transition count 9589
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 12 with 102 rules applied. Total rules applied 7888 place count 4401 transition count 9537
Ensure Unique test removed 8 places
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 34 rules applied. Total rules applied 7922 place count 4372 transition count 9532
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 14 with 21 rules applied. Total rules applied 7943 place count 4369 transition count 9514
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 21 rules applied. Total rules applied 7964 place count 4351 transition count 9511
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 198 Pre rules applied. Total rules applied 7964 place count 4351 transition count 9313
Deduced a syphon composed of 198 places in 3 ms
Ensure Unique test removed 194 places
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 16 with 590 rules applied. Total rules applied 8554 place count 3959 transition count 9313
Discarding 220 places :
Symmetric choice reduction at 16 with 220 rule applications. Total rules 8774 place count 3739 transition count 9093
Iterating global reduction 16 with 220 rules applied. Total rules applied 8994 place count 3739 transition count 9093
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 8994 place count 3739 transition count 9092
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 8996 place count 3738 transition count 9092
Discarding 682 places :
Symmetric choice reduction at 16 with 682 rule applications. Total rules 9678 place count 3056 transition count 7046
Iterating global reduction 16 with 682 rules applied. Total rules applied 10360 place count 3056 transition count 7046
Ensure Unique test removed 682 transitions
Reduce isomorphic transitions removed 682 transitions.
Iterating post reduction 16 with 682 rules applied. Total rules applied 11042 place count 3056 transition count 6364
Performed 2297 Post agglomeration using F-continuation condition.Transition count delta: 2297
Deduced a syphon composed of 2297 places in 1 ms
Reduce places removed 2297 places and 0 transitions.
Iterating global reduction 17 with 4594 rules applied. Total rules applied 15636 place count 759 transition count 4067
Drop transitions removed 2258 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 2262 transitions.
Iterating post reduction 17 with 2262 rules applied. Total rules applied 17898 place count 759 transition count 1805
Drop transitions removed 271 transitions
Redundant transition composition rules discarded 271 transitions
Iterating global reduction 18 with 271 rules applied. Total rules applied 18169 place count 759 transition count 1534
Ensure Unique test removed 264 places
Iterating post reduction 18 with 264 rules applied. Total rules applied 18433 place count 495 transition count 1534
Discarding 239 places :
Symmetric choice reduction at 19 with 239 rule applications. Total rules 18672 place count 256 transition count 817
Iterating global reduction 19 with 239 rules applied. Total rules applied 18911 place count 256 transition count 817
Ensure Unique test removed 239 transitions
Reduce isomorphic transitions removed 239 transitions.
Iterating post reduction 19 with 239 rules applied. Total rules applied 19150 place count 256 transition count 578
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 19151 place count 256 transition count 577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 19152 place count 255 transition count 577
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 21 with 7 rules applied. Total rules applied 19159 place count 255 transition count 570
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 21 with 7 rules applied. Total rules applied 19166 place count 248 transition count 570
Discarding 15 places :
Symmetric choice reduction at 22 with 15 rule applications. Total rules 19181 place count 233 transition count 525
Iterating global reduction 22 with 15 rules applied. Total rules applied 19196 place count 233 transition count 525
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 22 with 15 rules applied. Total rules applied 19211 place count 233 transition count 510
Partial Free-agglomeration rule applied 131 times.
Drop transitions removed 131 transitions
Iterating global reduction 23 with 131 rules applied. Total rules applied 19342 place count 233 transition count 510
Discarding 15 places :
Symmetric choice reduction at 23 with 15 rule applications. Total rules 19357 place count 218 transition count 465
Iterating global reduction 23 with 15 rules applied. Total rules applied 19372 place count 218 transition count 465
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 23 with 15 rules applied. Total rules applied 19387 place count 218 transition count 450
Applied a total of 19387 rules in 25081 ms. Remains 218 /7905 variables (removed 7687) and now considering 450/17194 (removed 16744) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 450 rows 218 cols
[2023-03-24 11:34:25] [INFO ] Computed 51 place invariants in 14 ms
[2023-03-24 11:34:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-24 11:34:25] [INFO ] [Real]Absence check using 3 positive and 48 generalized place invariants in 7 ms returned sat
[2023-03-24 11:34:25] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 11:34:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-24 11:34:25] [INFO ] [Nat]Absence check using 3 positive and 48 generalized place invariants in 8 ms returned sat
[2023-03-24 11:34:25] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 11:34:25] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-24 11:34:25] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-24 11:34:25] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-24 11:34:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 7905 places, 17194 transitions and 93062 arcs took 82 ms.
[2023-03-24 11:34:27] [INFO ] Flatten gal took : 1010 ms
Total runtime 259510 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/521/inv_0_ --invariant=/tmp/521/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1062908 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16063056 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S32C03"
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 MultiCrashLeafsetExtension-PT-S32C03, 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 r233-tall-167856419600902"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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